Ordinal analysis

The field of ordinal analysis was formed when Gerhard Gentzen in 1934 used cut elimination to prove, in modern terms, that the proof-theoretic ordinal of Peano arithmetic is ε0. See Gentzen's consistency proof. ==Definition==

Ordinal analysis concerns true, effective (recursive) theories that can interpret a sufficient portion of arithmetic to make statements about ordinal notations. The proof-theoretic ordinal of such a theory T is the supremum of the order types of all ordinal notations (necessarily recursive, see next section) that the theory can prove are well founded—the supremum of all ordinals \alpha for which there exists a notation o in Kleene's sense such that T proves that o is an ordinal notation. Equivalently, it is the supremum of all ordinals \alpha such that there exists a recursive relation R on \omega (the set of natural numbers) that well-orders it with ordinal \alpha and such that T proves transfinite induction of arithmetical statements for R. Ordinal notations Some theories, such as subsystems of second-order arithmetic (Z2), have no conceptualization or way to make arguments about transfinite ordinals. For example, to formalize what it means for a subsystem T of Z2 to "prove \alpha well-ordered", we instead construct an ordinal notation (A,\tilde with order type \alpha. T can now work with various transfinite induction principles along (A,\tilde , which substitute for reasoning about set-theoretic ordinals. However, some pathological notation systems exist that are unexpectedly difficult to work with. For example, Rathjen gives a primitive recursive notation system (\mathbb N, that is well-founded if and only if PA is consistent,p. 3 despite having order type \omega. Including such a notation in the ordinal analysis of PA would result in the false equality \mathsf{PTO(PA)}=\omega. ==Upper bound==

Since an ordinal notation must be recursive, the proof-theoretic ordinal of any theory is less than or equal to the Church–Kleene ordinal \omega_1^{\mathrm{CK}}. In particular, the proof-theoretic ordinal of an inconsistent theory is equal to \omega_1^{\mathrm{CK}}, because an inconsistent theory trivially proves that all ordinal notations are well-founded. For any theory that's both \Sigma^1_1-axiomatizable and \Pi^1_1-sound, the existence of a recursive ordering that the theory fails to prove is well-ordered follows from the \Sigma^1_1 bounding theorem, and said provably well-founded ordinal notations are in fact well-founded by \Pi^1_1-soundness. Thus the proof-theoretic ordinal of a \Pi^1_1-sound theory that has a \Sigma^1_1 axiomatization will always be a (countable) recursive ordinal, that is, strictly less than \omega_1^{\mathrm{CK}}.Theorem 2.21 ==Examples==

Theories with proof-theoretic ordinal ω • Q, Robinson arithmetic (although the definition of the proof-theoretic ordinal for such weak theories has to be tweaked). • PA–, the first-order theory of the nonnegative part of a discretely ordered ring. Theories with proof-theoretic ordinal ω2 • RFA, rudimentary function arithmetic. • IΔ0, arithmetic with induction on Δ0-predicates without any axiom asserting that exponentiation is total. Theories with proof-theoretic ordinal ω3 • EFA, elementary function arithmetic. • IΔ0 + exp, arithmetic with induction on Δ0-predicates augmented by an axiom asserting that exponentiation is total. • RCA, a second-order form of EFA sometimes used in reverse mathematics. • WKL, a second-order form of EFA sometimes used in reverse mathematics. Friedman's grand conjecture suggests that much "ordinary" mathematics can be proved in weak systems having this as their proof-theoretic ordinal. ===Theories with proof-theoretic ordinal ωn (for n = 2, 3, ... ω)=== • IΔ0 or EFA augmented by an axiom ensuring that each element of the n-th level \mathcal{E}^n of the Grzegorczyk hierarchy is total. Theories with proof-theoretic ordinal ωω • RCA0, recursive comprehension. • WKL0, weak Kőnig's lemma. • PRA, primitive recursive arithmetic. • IΣ1, arithmetic with induction on Σ1-predicates. Theories with proof-theoretic ordinal ε0 • PA, Peano arithmetic (shown by Gentzen using cut elimination). • ACA0, arithmetical comprehension. ===Theories with proof-theoretic ordinal the Feferman–Schütte ordinal Γ0=== • ATR0, arithmetical transfinite recursion. • Martin-Löf type theory with arbitrarily many finite level universes. This ordinal is sometimes considered to be the upper limit for "predicative" theories. ===Theories with proof-theoretic ordinal the Bachmann–Howard ordinal=== • ID1, the first theory of inductive definitions. • KP, Kripke–Platek set theory with the axiom of infinity. • CZF, Aczel's constructive Zermelo–Fraenkel set theory. • EON, a weak variant of the Feferman's explicit mathematics system T0. The Kripke–Platek or CZF set theories are weak set theories without axioms for the full powerset given as set of all subsets. Instead, they tend to either have axioms of restricted separation and formation of new sets, or they grant existence of certain function spaces (exponentiation) instead of carving them out from bigger relations. Theories with larger proof-theoretic ordinals • \Pi^1_1\mbox{-}\mathsf{CA}_0, Π11 comprehension has a rather large proof-theoretic ordinal, which was described by Takeuti in terms of "ordinal diagrams",p. 13 and which is bounded by ψ0(Ωω) in Buchholz's notation. It is also the ordinal of ID_{, the theory of finitely iterated inductive definitions. And also the ordinal of MLW, Martin-Löf type theory with indexed W-Types . • IDω, the theory of ω-iterated inductive definitions. Its proof-theoretic ordinal is equal to the Takeuti–Feferman–Buchholz ordinal. • T0, Feferman's constructive system of explicit mathematics has a larger proof-theoretic ordinal, which is also the proof-theoretic ordinal of the KPi, Kripke–Platek set theory with iterated admissibles and \Sigma^1_2\mbox{-}\mathsf{AC} + \mathsf{BI}. • KPi, an extension of Kripke–Platek set theory based on a recursively inaccessible ordinal, has a very large proof-theoretic ordinal \psi(\varepsilon_{I + 1}) described in a 1983 paper of Jäger and Pohlers, where I is the smallest inaccessible. This ordinal is also the proof-theoretic ordinal of \Delta^1_2\mbox{-}\mathsf{CA} + \mathsf{BI}. • KPM, an extension of Kripke–Platek set theory based on a recursively Mahlo ordinal, has a very large proof-theoretic ordinal θ, which was described by . • TTM, an extension of Martin-Löf type theory by one Mahlo-universe, has an even larger proof-theoretic ordinal \psi_{\Omega_1}(\Omega_{M+\omega}). • \mathsf{KP} + \Pi_3 - Ref has a proof-theoretic ordinal equal to \Psi(\varepsilon_{K + 1}), where K refers to the first weakly compact, due to (Rathjen 1993) • \mathsf{KP} + \Pi_\omega - Ref has a proof-theoretic ordinal equal to \Psi^{\varepsilon_{\Xi + 1}}_X, where \Xi refers to the first \Pi^2_0-indescribable and \mathbb{X} = (\omega^+; P_0; \epsilon, \epsilon, 0), due to (Stegert 2010). • \mathsf{Stability} has a proof-theoretic ordinal equal to \Psi^{\varepsilon_{\Upsilon+1}}_{\mathbb{X}} where \Upsilon is a cardinal analogue of the least ordinal \alpha which is (\alpha+\beta) -stable for all \beta and \mathbb{X} = (\omega^+; P_0; \epsilon, \epsilon, 0), due to (Stegert 2010). Most theories capable of describing the power set of the natural numbers have proof-theoretic ordinals that are so large that no explicit combinatorial description has yet been given. This includes \Pi^1_2 - CA_0, full second-order arithmetic (\Pi^1_\infty - CA_0) and set theories with powersets including ZF and ZFC. The strength of intuitionistic ZF (IZF) equals that of ZF. == Table of ordinal analyses ==

Key This is a list of symbols used in this table: • ψ represents various ordinal collapsing functions as defined in their respective citations. • Ψ represents either Rathjen's or Stegert's Psi. • φ represents Veblen's function. • ω represents the first transfinite ordinal. • εα represents the epsilon numbers. • Γα represents the gamma numbers (Γ0 is the Feferman–Schütte ordinal) • Ωα represent the uncountable ordinals (Ω1, abbreviated Ω, is ω1). Countability is considered necessary for an ordinal to be regarded as proof theoretic. • \mathbb S is an ordinal term denoting a stable ordinal, and \mathbb S^+ the least admissible ordinal above \mathbb S. • \mathbb I_N is an ordinal term denoting an ordinal such that L_{\mathbb{I}_N}\models\mathsf{KP}\omega+\Pi_N-\mathsf{Collection}+(V=L); N is a variable that defines a series of ordinal analyses of the results of \Pi_N-\mathsf{Collection} forall 1 \leq N . when N=1, \psi_{\omega_1^{CK}}(\varepsilon_{\mathbb I_1+1})=\psi_{\omega_1^{CK}}(\varepsilon_{\mathbb I+1}) • Additional symbols can be found in the notes. This is a list of the abbreviations used in this table: • First-order arithmetic • \mathsf{Q} is Robinson arithmetic • \mathsf{PA}^- is the first-order theory of the nonnegative part of a discretely ordered ring. • \mathsf{RFA} is rudimentary function arithmetic. • \mathsf{I\Delta}_0 is arithmetic with induction restricted to Δ0-predicates without any axiom asserting that exponentiation is total. • \mathsf{EFA} is elementary function arithmetic. • \mathsf{I\Delta}_0^{\mathsf{+}} is arithmetic with induction restricted to Δ0-predicates augmented by an axiom asserting that exponentiation is total. • \mathsf{EFA}^{\mathsf{n}} is elementary function arithmetic augmented by an axiom ensuring that each element of the n-th level \mathcal{E}^n of the Grzegorczyk hierarchy is total. • \mathsf{I\Delta}_0^{\mathsf{n+}} is \mathsf{I\Delta}_0^{\mathsf{+}} augmented by an axiom ensuring that each element of the n-th level \mathcal{E}^n of the Grzegorczyk hierarchy is total. • \mathsf{PRA} is primitive recursive arithmetic. • \mathsf{I\Sigma}_1 is arithmetic with induction restricted to Σ1-predicates. • \mathsf{PA} is Peano arithmetic. • \mathsf{ID}_\nu\# is \widehat{\mathsf{ID}}_\nu but with induction only for positive formulas. • \widehat{\mathsf{ID}}_\nu extends PA by ν iterated fixed points of monotone operators. • \mathsf{U(PA)} is not exactly a first-order arithmetic system, but captures what one can get by predicative reasoning based on the natural numbers. • \mathsf{Aut(\widehat{ID})} is autonomously iterated \widehat{\mathsf{ID}}_\nu (in other words, once an ordinal is defined, it can be used to index a new series of definitions.) • \mathsf{ID}_\nu extends PA by ν iterated least fixed points of monotone operators. • \mathsf{U(ID}_\nu\mathsf{)} is not exactly a first-order arithmetic system, but captures what one can get by predicative reasoning based on ν-times iterated generalized inductive definitions. • \mathsf{Aut(U(ID))} is autonomously iterated \mathsf{U(ID}_\nu\mathsf{)}. • \mathsf{W-ID}_{\nu} is a weakened version of \mathsf{ID}_{\nu} based on W-types. • \mathsf{TI}[\Pi_0^{1-},\alpha] is a transfinite induction of length α no more than \Pi_0^1-formulas. It happens to be the representation of the ordinal notation when used in first-order arithmetic. • Second-order arithmetic In general, a subscript 0 means that the induction scheme is restricted to a single set induction axiom. • \mathsf{RCA}_0^* is a second order form of \mathsf{EFA} sometimes used in reverse mathematics. • \mathsf{WKL}_0^* is a second order form of \mathsf{EFA} sometimes used in reverse mathematics. • \mathsf{RCA}_0 is recursive comprehension. • \mathsf{WKL}_0 is weak Kőnig's lemma. • \mathsf{ACA}_0 is arithmetical comprehension. • \mathsf{ACA} is \mathsf{ACA}_0 plus the full second-order induction scheme. • \mathsf{TJ}(n, X, Y) is the predicate "the nth Turing jump of X is Y". • \mathsf{ATR}_0 is arithmetical transfinite recursion. • \mathsf{ATR} is \mathsf{ATR}_0 plus the full second-order induction scheme. • \mathsf{BI} is the bar induction axiom. • \mathsf{\Delta}_2^1\mathsf{-CA+BI+(M)} is \mathsf{\Delta}_2^1\mathsf{-CA+BI} plus the assertion "every true \mathsf{\Pi}^1_3-sentence with parameters holds in a (countable coded) \beta-model of \mathsf{\Delta}_2^1\mathsf{-CA}". • Kripke–Platek set theory • \mathsf{KP} is Kripke–Platek set theory with the axiom of infinity. • \mathsf{KP\omega} is Kripke–Platek set theory, whose universe is an admissible set containing \omega. • \mathsf{W-KPI} is a weakened version of \mathsf{KPI} based on W-types. • \mathsf{KPI} asserts that the universe is a limit of admissible sets. • \mathsf{W-KPi} is a weakened version of \mathsf{KPi} based on W-types. • \mathsf{KPi} asserts that the universe is inaccessible sets. • \mathsf{KPh} asserts that the universe is hyperinaccessible: an inaccessible set and a limit of inaccessible sets. • \mathsf{KPM} asserts that the universe is a Mahlo set. • \mathsf{KP + \Pi}_\mathsf{n} - \mathsf{Ref} is \mathsf{KP} augmented by a certain first-order reflection scheme. • \mathsf{Stability} is KPi augmented by the axiom \forall \alpha \exists \kappa \geq \alpha (L_\kappa \preceq_1 L_{\kappa + \alpha}). • \mathsf{KPM}^+ is KPI augmented by the assertion "at least one recursively Mahlo ordinal exists". • \mathsf{KP}\omega+(M\prec_{\Sigma_1}V) is \mathsf{KP}\omega with an axiom stating that 'there exists a non-empty and transitive set M such that M\prec_{\Sigma_1}V'. A superscript zero indicates that \in-induction is removed (making the theory significantly weaker). • Type theory • \mathsf{CPRC} is the Herbelin-Patey Calculus of Primitive Recursive Constructions. • \mathsf{ML}_\mathsf{n} is type theory without W-types and with n universes. • \mathsf{ML}_{ is type theory without W-types and with finitely many universes. • \mathsf{MLU} is type theory with a next universe operator. • \mathsf{MLS} is type theory without W-types and with a superuniverse. • \mathsf{Aut(ML)} is type theory without W-types and with autonomously iterated universes. • \mathsf{ML}_1\mathsf{V} is type theory with one universe and Aczel's type of iterative sets. • \mathsf{MLW} is type theory with indexed W-Types. • \mathsf{ML}_1\mathsf{W} is type theory with W-types and one universe. • \mathsf{ML}_{ is type theory with W-types and finitely many universes. • \mathsf{Aut(MLW)} is type theory with W-types and with autonomously iterated universes. • \mathsf{TTM} is type theory with a Mahlo universe. • \lambda 2 is System F, also polymorphic lambda calculus or second-order lambda calculus. • Constructive set theory • \mathsf{CZF} is Aczel's constructive set theory. • \mathsf{CZF+REA} is \mathsf{CZF} plus the regular extension axiom. • \mathsf{CZF+REA+FZ}_2 is \mathsf{CZF+REA} plus the full-second order induction scheme. • \mathsf{CZFM} is \mathsf{CZF} with a Mahlo universe. • Explicit mathematics • \mathsf{EM}_0 is basic explicit mathematics plus elementary comprehension • \mathsf{EM}_0 \mathsf{+JR} is \mathsf{EM}_0 plus join rule • \mathsf{EM}_0 \mathsf{+J} is \mathsf{EM}_0 plus join axioms • \mathsf{EON} is a weak variant of the Feferman's \mathsf{T}_0. • \mathsf{T}_0 is \mathsf{EM}_0 \mathsf{+J+IG}, where \mathsf{IG} is inductive generation. • \mathsf{T} is \mathsf{EM}_0 \mathsf{+J+IG+FZ}_2, where \mathsf{FZ}_2 is the full second-order induction scheme. == See also ==