The notion of countable well order admits an alternative definition in terms of embeddings between initial segments. We use the framework of reverse mathematics to investigate the logical strength of this definition and its connection with Fraïssé’s conjecture, which has been proved by Laver. We also fill a small gap in Shore’s proof that Fraïssé’s conjecture implies arithmetic transfinite recursion over $\mathbf {RCA}_0$, by giving a new proof of $\Sigma ^0_2$ -induction.

Following our [6], though with somewhat different methods here, further variants of Goodstein sequences are introduced in terms of parameterized Ackermann–Péter functions. Each of the sequences is shown to terminate, and the proof-theoretic strengths of these facts are calibrated by means of ordinal assignments, yielding independence results for a range of theories: PRA, PA,$\Sigma ^1_1$-DC$_0$, ATR$_0$, up to ID$_1$. The key is the so-called “Hardy hierarchy” of proof-theoretic bounding finctions, providing a uniform method for associating Goodstein-type sequences with parameterized normal (...) form representations of positive integers. (shrink)

In ordinal analysis of impredicative theories so-called collapsing functions are of central importance. Unfortunately, the definition procedure of these functions makes essential use of uncountable cardinals whereas the notation system that they call into being corresponds to a recursive ordinal. It has long been claimed that, instead, one should manage to develop such functions directly on the basis of admissible ordinals. This paper is meant to show how this can be done. Interpreting the collapsing functions as operating directly on admissible (...) sets also renders a new and perspicuous approach to well-ordering proofs possible. MSC: 03F15, 03F35. (shrink)

It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the$\Pi ^1_1$reflection strength order. We prove that there are no descending sequences of$\Pi ^1_1$sound extensions of$\mathsf {ACA}_0$in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any$\Pi (...) ^1_1$sound extension of$\mathsf {ACA}_0$. We prove that for any$\Pi ^1_1$sound theoryTextending$\mathsf {ACA}_0^+$, the reflection rank ofTequals the$\Pi ^1_1$proof-theoretic ordinal ofT. We also prove that the$\Pi ^1_1$proof-theoretic ordinal of$\alpha $iterated$\Pi ^1_1$reflection is$\varepsilon _\alpha $. Finally, we use our results to provide straightforward well-foundedness proofs of ordinal notation systems based on reflection principles. (shrink)

We show the following results on Wainer's notation for a minimal subrecursive inaccessible ordinal τ: First, we give a constructive proof of the collapsing theorem. Secondly, we prove that the slow-growing hierarchy and the fast-growing hierarchy up to τ have elementary properties on increase and domination, which completes Wainer's proof that τ is a minimal subrecursive inaccessible. Our results are obtained by showing a strong normalization theorem for the term structure of the notation. MSC: 03D20, 03F15.

We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ1 0. It follows that the supremum of order-types of primitive recursive well-orderings, whose well-foundedness on co-r.e. sets is provable in Σ1 0, equals the limit of all recursive ordinals ω1 ck . RID=""ID="" Mathematics Subject Classification (2000): 03B30, 03F15 RID=""ID="" Supported by the Deutschen Akademie der Naturforscher Leopoldina grant #BMBF-LPD 9801-7 with funds from the Bundesministerium für Bildung, Wissenschaft, Forschung und Technologie. (...) RID=""ID="" I would like to thank A. SETZER for his hospitality during my stay in Uppsala in December 1998 – these investigations are inspired by a discussion with him; S. BUSS for his hospitality during my stay at UCSD and for valuable remarks on a previous version of this paper; and M. MÖLLERFELD for remarks on a previous title. (shrink)

We introduce the computable FS-jump, an analog of the classical Friedman–Stanley jump in the context of equivalence relations on the natural numbers. We prove that the computable FS-jump is proper with respect to computable reducibility. We then study the effect of the computable FS-jump on computably enumerable equivalence relations (ceers).

For f: On → On let supp: = ξ: 0, and let S := {f : On → On : supp finite}. For f,g ϵ S definef ≤ g : ↔ [h one-to-one ⁁ f ≤ g)].A function ψ : S → On is called monotonic increasing, if f≤ψ and if f ≤ g implies ψ ≤ ψ. For a mapping ψ : S → On let Clψ be the least set T of ordinals which contains 0 as an element (...) and which is closed under the following rule: If f ϵ S, range ⊆ T and supp ⊆ T, then ψ ϵ T. Let φ be the enumeration function of the class {ξ: [ξ = ωn]}. Let φ be the induced Schütte-Klammerterm-function which generates the Schütte-Veblen-hierarchy of ordinals. Then φ is monotonic increasing. We show: If ψ: S → On is monotonic increasing, then otyp) ≤ min {ξ : ξ = Φ, where 1ξ = 1 if α = ξ and 1ξ = 0 if α ↔ = 0 if α ≠ ξ. For τ an ordinal let Sτ := {f ϵ S : supp ⊆ τ}. A function ψ : Sτ → On is called τ-monotonic increasing if fξ and if f ≤ g implies ψ ≤ . For a function ψ Sτ → On let Clψ ↔ τ be the least set T of ordinals, which contains 0 as an element, such that if f ϵ Sτ and range ϵ T, then ψ ϵ T. We show: if ≥2 and if ψ Sτ → On is τ-monotonic increasing, then otyp ↔ τ) ≤. We also prove a generalization of this theorem in terms of well-partial orderings. MSC: 03F15, 03E10, 06A06. (shrink)

We give a simple and elementary proof of the following result of Girard and Vauzeilles which is proved in [5]: “The binary Veblen function ψ: On × On — On is a dilator.” Our proof indicates the intimate connection between the traditional theory of ordinal notation systems and Girard's theory of denotation systems. MSC: 03F15.

We present an analogue of Gödel’s second incompleteness theorem for systems of second-order arithmetic. Whereas Gödel showed that sufficiently strong theories that are $\Pi ^0_1$ -sound and $\Sigma ^0_1$ -definable do not prove their own $\Pi ^0_1$ -soundness, we prove that sufficiently strong theories that are $\Pi ^1_1$ -sound and $\Sigma ^1_1$ -definable do not prove their own $\Pi ^1_1$ -soundness. Our proof does not involve the construction of a self-referential sentence but rather relies on ordinal analysis.

This article provides a detailed comparison between two systems of collapsing functions. These functions play a crucial role in proof theory, in the analysis of patterns of resemblance, and the analysis of maximal order types of well partial orders. The exact correspondence given here serves as a starting point for far reaching extensions of current results on patterns and well partial orders. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.