Related papers: Ackermann and Goodstein go functorial
Urysohn's Lemma is a crucial property of normal spaces that deals with separation of closed sets by continuous functions. It is also a fundamental ingredient in proving the Tietze Extension Theorem, another property of normal spaces that…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We study versions of Goodwillie's calculus of functors for indexing diagrams other than cubes. We in particular construct universal excisive approximations for a larger class of diagrams, which yields an extension of the Taylor tower. We…
A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…
We prove a analogous of Stein theorem for rational functions in several variables: we bound the number of reducible fibers by a formula depending on the degree of the fraction.
In this note, we mainly extend some Gorenstein homological properties from special rings (Noetherian or coherent rings ) to arbitrary rings by introducing the notions of Gorenstein weak injective and weak projective modules respectively.
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
We recall how the Gauss-Bonnet theorem can be interpreted as a finite dimen- sional index theorem. We describe the construction given in hep-th/0512293 of a function that can be interpreted as a gravitational effective action on a…
We study Neumann functions for divergence form, second order elliptic systems with bounded measurable coefficients in a bounded Lipschitz domain or a Lipschitz graph domain. We establish existence, uniqueness, and various estimates for the…
To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…
For a regular normal element in an arbitrary ring, we study the category of its module factorizations. The cokernel functor relates module factorizations with Gorenstein projective components to Gorenstein projective modules over the…
We build an explicit link between coherent functors in the sense of Auslander and strict polynomial functors in the sense of Friedlander and Suslin. Applications to functor cohomology are discussed.
Building on Buchholz' assignment for ordinals below Bachmann-Howard ordinal, see Buchholz 2003, we introduce systems of fundamental sequences for two kinds of relativized $\vartheta$-function-based notation systems of strength…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We give a new construction of the equivariant $K$-theory of group actions (cf. Barwick et al.), producing an infinite loop $G$-space for each Waldhausen category with $G$-action, for a finite group $G$. On the category $R(X)$ of retractive…
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
Recent work of Biedermann and R\"ondigs has translated Goodwillie's calculus of functors into the language of model categories. Their work focuses on symmetric multilinear functors and the derivative appears only briefly. In this paper we…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…