Related papers: Well ordering principles and $\Pi^1_4$-statements:…
In a recent paper by M. Rathjen and the present author it has been shown that the statement ``every normal function has a derivative'' is equivalent to $\Pi^1_1$-bar induction. The equivalence was proved over $\mathbf{ACA_0}$, for a…
A dilator is a particularly uniform transformation $X\mapsto T_X$ of linear orders that preserves well-foundedness. We say that $X$ is a Bachmann-Howard fixed point of $T$ if there is an almost order preserving collapsing function…
There are two major generalizations of the standard ordinal analysis: One is Girard's $\Pi^1_2$-proof theory in which dilators are assigned to theories instead of ordinals. The other is Pohlers' generalized ordinal analysis with Spector…
Transformations of well partial orders induce functions on the ordinals, via the notion of maximal order type. In most examples from the literature, these functions are not normal, in marked contrast with the central role that normal…
One of the most important principles of J.-Y. Girard's $\Pi^1_2$-logic is induction on dilators. In particular, Girard used this principle to construct his famous functor $\Lambda$. He claimed that the totality of $\Lambda$ is equivalent to…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
Consider a normal function $f$ on the ordinals (i. e. a function $f$ that is strictly increasing and continuous at limit stages). By enumerating the fixed points of $f$ we obtain a faster normal function $f'$, called the derivative of $f$.…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
In this note the proof-theoretic ordinal of the well-ordering principle for the normal functions ${\sf g}$ on ordinals is shown to be equal to the least fixed point of ${\sf g}$. Moreover corrections to the previous paper are made.
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…
We prove the existence of fixed points of p-tupling renormalization operators for interval and circle mappings having a critical point of arbitrary real degree r > 1. Some properties of the resulting maps are studied: analyticity,…
We have previously established that $\Pi^1_1$-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann-Howard fixed point, over $\mathbf{ATR_0}$. In the present paper we show that the base theory can be…
In Theorem 1 of the paper [V. Pata, A fixed point theorem in metric spaces, J. Fixed Point Theory Appl., 10 (2011), 299-305] it is proved that Picard's iterates for a function converge to a fixed point if a certain condition (C) is verified…
A predilator is a particularly uniform transformation of linear orders. We have a dilator when the transformation preserves well-foundedness. Over the theory $\mathsf{ACA}_0$ from reverse mathematics, any $\Pi^1_2$-formula is equivalent to…
Peter Aczel has given a categorical construction for fixed points of normal functors, i.e. dilators which preserve initial segments. For a general dilator $X\mapsto T_X$ we cannot expect to obtain a well-founded fixed point, as the order…
In the late 1980s, Abrusci, Girard and van de Wiele defined a variant of Goodstein sequences: the so-called inverse Goodstein sequence. In their work, they show that it terminates precisely at the Bachmann-Howard ordinal. This reveals that…
We prove that Picard-Lindel\"of iterations for an arbitrary smooth normal Cauchy problem for PDE converge if we assume a suitable Weissinger-like sufficient condition. This condition includes both a large class of non-analytic PDE or…
Timothy Carlson's patterns of resemblance employ the notion of $\Sigma_1$-elementarity to describe large computable ordinals. It has been conjectured that a relativization of these patterns to dilators leads to an equivalence with…