Ordinal analysis

From Wikipedia, the free encyclopedia

In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength. The field was formed when Gerhard Gentzen used cut elimination to prove, in modern terms, that the proof theoretic ordinal of Peano arithmetic is ε₀.

Contents 1 Definition 2 Examples 2.1 Theories with proof theoretic ordinal ω2 2.2 Theories with proof theoretic ordinal ω3 2.3 Theories with proof theoretic ordinal ωn 2.4 Theories with proof theoretic ordinal ωω 2.5 Theories with proof theoretic ordinal ε0 2.6 Theories with proof theoretic ordinal the Feferman-Schütte ordinal Γ0 2.7 Theories with proof theoretic ordinal the Bachmann-Howard ordinal 2.8 Theories with larger proof theoretic ordinals 3 References

[edit] 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 is the smallest recursive ordinal that the theory cannot prove is well founded — the supremum of all ordinals α 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 α such that there exists a recursive relation R on ω (the set of natural numbers) which well-orders it with ordinal α and such that T proves transfinite induction of arithmetical statements for R.

The existence of any recursive ordinal which the theory fails to prove is well ordered follows from the bounding theorem, as the set of natural numbers which an effective theory proves to be ordinal notations is a set (see Hyperarithmetical theory). Thus the proof theoretic ordinal of a theory will always be a countable ordinal less than the Church-Kleene ordinal .

In practice, the proof theoretic ordinal of a theory is a good measure of the strength of a theory. If theories have the same proof theoretic ordinal they are often equiconsistent, and if one theory has a larger proof theoretic ordinal than another it can often prove the consistency of the second theory.

[edit] Examples

[edit] Theories with proof theoretic ordinal ω²

• , rudimentary function arithmetic.
• (arithmetic with induction on Δ₀ predicates) without any axiom asserting that exponentiation is total.

[edit] Theories with proof theoretic ordinal ω³

• , elementary function arithmetic.
• (arithmetic with induction on Δ₀ predicates) augmented by an axiom asserting that exponentiation is total.

[edit] Theories with proof theoretic ordinal ωⁿ

• or augmented by an axiom ensuring that each element of the nth level of the Grzegorczyk hierarchy is total.

[edit] Theories with proof theoretic ordinal ω^ω

• , Recursive Comprehension.
• , Weak König's lemma.
• , primitive recursive arithmetic.
• (arithmetic with induction on Σ₁ predicates).

[edit] Theories with proof theoretic ordinal ε₀

• Gentzen showed using cut elimination that the proof theoretic ordinal of Peano arithmetic is ε₀.
• , Arithmetical comprehension.

[edit] Theories with proof theoretic ordinal the Feferman-Schütte ordinal Γ₀

This ordinal is sometimes considered to be the upper limit for "predicative" theories.

• , Arithmetical Transfinite Recursion.
• Martin-Löf type theory.

[edit] Theories with proof theoretic ordinal the Bachmann-Howard ordinal

• , the theory of inductive definitions.
• Kripke-Platek set theory with the axiom of infinity.
• The system CZF of constructive set theory.

[edit] Theories with larger proof theoretic ordinals

• , Π₁¹ comprehension has a rather large proof theoretic ordinal, which was described by Takeuti in terms of "ordinal diagrams", and which is bounded by ψ₀(Ω_ω) in Buchholz's notation. It is also the ordinal of ID _{< ω}, the theory of finitely iterated inductive definitions.
• KPM, an extension of Kripke-Platek set theory, has a very large proof theoretic ordinal, which was described by Rathjen (1990).

Most theories capable of describing the power set of the natural numbers have proof theoretic ordinals that are (as of 2008) so large that no explicit combinatorial description has yet been given. This includes second order arithmetic and set theories with powersets. (Kripke-Platek set theory mentioned above is a weak set theory without power sets.)

[edit] References

• Buchholz, W.; Feferman, S.; Pohlers, W. & Sieg, W. (1981), Iterated inductive definitions and sub-systems of analysis, vol. 897, Lecture Notes in Math., Berlin: Springer-Verlag, ISBN 978-3-540-11170-2, DOI 10.1007/BFb0091894 
• Pohlers, Wolfram (1989), Proof theory, vol. 1407, Lecture Notes in Mathematics, Berlin: Springer-Verlag, MR1026933, ISBN 3-540-51842-8 
• Pohlers, Wolfram (1998), “Set Theory and Second Order Number Theory”, Handbook of Proof Theory, vol. 137, Studies in Logic and the Foundations of Mathematics, Amsterdam: Elsevier Science B. V., pp. 210-335, MR1640328, ISBN 0-444-89840-9 
• Rathjen, Michael (1990), “Ordinal notations based on a weakly Mahlo cardinal.”, Arch. Math. Logic 29 (4): 249-263, MR1062729 
• Rathjen, Michael (2006), “The art of ordinal analysis”, International Congress of Mathematicians, vol. II, Zürich,: Eur. Math. Soc., pp. 45-69, MR2275588, <http://www.icm2006.org/proceedings/Vol_II/contents/ICM_Vol_2_03.pdf> 
• Rose, H. (1984), Subrecursion. Functions and Hierarchies, vol. 9, Oxford logic guides, Oxford, New York: Clarendon Press, Oxford University Press 
• Schütte, Kurt (1977), Proof theory, vol. 225, Grundlehren der Mathematischen Wissenschaften, Berlin-New York: Springer-Verlag, pp. xii+299, MR0505313, ISBN 3-540-07911-4 
• Takeuti, Gaisi (1987), Proof theory, vol. 81 (Second ed.), Studies in Logic and the Foundations of Mathematics, Amsterdam: North-Holland Publishing Co., MR0882549, ISBN 0-444-87943-9