Archive for Mathematical Logic

, Volume 44, Issue 1, pp 1–62 | Cite as

An ordinal analysis of stability



This paper is the first in a series of three which culminates in an ordinal analysis of Π12-comprehension. On the set-theoretic side Π12-comprehension corresponds to Kripke-Platek set theory, KP, plus Σ1-separation. The strength of the latter theory is encapsulated in the fact that it proves the existence of ordinals π such that, for all β>π, π is β-stable, i.e. Lπ is a Σ1-elementary substructure of Lβ. The objective of this paper is to give an ordinal analysis of a scenario of not too complicated stability relations as experience has shown that the understanding of the ordinal analysis of Π12-comprehension is greatly facilitated by explicating certain simpler cases first.

This paper introduces an ordinal representation system based on ν-indescribable cardinals which is then employed for determining an upper bound for the proof–theoretic strength of the theory KPi+ ∀ρππ is π+ρ-stable, where KPi is KP augmented by the axiom saying that every set is contained in an admissible set.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barwise, J.: Admissible Sets and Structures (Springer, Berlin 1975)Google Scholar
  2. 2.
    Buchholz, W.: A simplified version of local predicativity. In: Aczel, Simmons, Wainer (eds.), Leeds Proof Theory 1991 (Cambridge University Press, Cambridge, 1993) pp. 115–147Google Scholar
  3. 3.
    Devlin, K.J.: Constructibility (Springer, Berlin, 1984)Google Scholar
  4. 4.
    Drake, F.: Set Theory: An introduction to large cardinals. Amsterdam: North Holland 1974Google Scholar
  5. 5.
    Feferman, S.: Proof theory: a personal report. In: G. Takeuti. Proof Theory, 2nd edition (North-Holland, Amsterdam, 1987) pp. 445–485Google Scholar
  6. 6.
    Feferman, S.: Remarks for The Trends in Logic. In: Logic Colloquium ‘88 (North-Holland, Amsterdam, 1989) pp. 361–363Google Scholar
  7. 7.
    Feferman, S.: Systems of predicative analysis II: representations of ordinals. J. Symbolic Logic 23, 193–220 (1968)Google Scholar
  8. 8.
    Kanamori, A.: The higher infinite. (Springer, Berlin, 1995)Google Scholar
  9. 9.
    Kanamori, A., Magidor, M.: The evolution of large cardinal axioms in set theory. In: G. H. Müller, D.S. Scott (eds.) Higher Set Theory. Lecture Notes in Mathematics 669 (Springer, Berlin, 1978) pp. 99–275Google Scholar
  10. 10.
    Pohlers, W.: Proof theory and ordinal analysis. Arch. Math. Logic 30, 311–376 (1991)MathSciNetMATHGoogle Scholar
  11. 11.
    Rathjen, M.: Proof-Theoretic Analysis of KPM. Arch. Math. Logic 30, 377–403 (1991)MathSciNetMATHGoogle Scholar
  12. 12.
    Rathjen, M.: How to develop proof–theoretic ordinal functions on the basis of admissible sets. Mathematical Quarterly 39, 47–54 (1993)MathSciNetMATHGoogle Scholar
  13. 13.
    Rathjen, M.: Collapsing functions based on recursively large ordinals: A well–ordering proof for KPM. Archive for Mathematical Logic 33, 35–55 (1994)MathSciNetMATHGoogle Scholar
  14. 14.
    Rathjen, M.: Proof theory of reflection. Annals of Pure and Applied Logic 68, 181–224 (1994)CrossRefMathSciNetMATHGoogle Scholar
  15. 15.
    Rathjen, M.: Recent advances in ordinal analysis: Π12-CA and related systems. Bulletin of Symbolic Logic 1, 468–485 (1995)MathSciNetMATHGoogle Scholar
  16. 16.
    Rathjen, M.: An ordinal analysis of parameter free Π12 comprehension. To appear in Archive for Mathematical Logic (2004?), 100 pagesGoogle Scholar
  17. 17.
    Rathjen, M.: An ordinal analysis of iterated Π12 comprehension and related systems. Preprint, 85 pagesGoogle Scholar
  18. 18.
    Rathjen, M.: Explicit mathematics with the monotone fixed point principle II: Models. Journal of Symbolic Logic 64, 517–550 (1999)MathSciNetMATHGoogle Scholar
  19. 19.
    Richter, W., Aczel, P.: Inductive definitions and reflecting properties of admissible ordinals. In: J.E. Fenstad, Hinman (eds.) Generalized Recursion Theory (North Holland, Amsterdam, 1973) pp. 301–381Google Scholar
  20. 20.
    Sacks, G.E.: Higher recursion theory (Springer, Berlin, 1990)Google Scholar
  21. 21.
    Schütte, K.: Beweistheorie (Springer, Berlin, 1960)Google Scholar
  22. 22.
    Schütte, K.: Proof Theory, (Springer, Berlin, 1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  1. 1.Department of Pure MathematicsUniversity of LeedsLeedsEngland

Personalised recommendations