Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise, J.: Admissible Sets and Structures (Springer, Berlin 1975)
Buchholz, W.: A simplified version of local predicativity. In: Aczel, Simmons, Wainer (eds.), Leeds Proof Theory 1991 (Cambridge University Press, Cambridge, 1993) pp. 115–147
Devlin, K.J.: Constructibility (Springer, Berlin, 1984)
Drake, F.: Set Theory: An introduction to large cardinals. Amsterdam: North Holland 1974
Feferman, S.: Proof theory: a personal report. In: G. Takeuti. Proof Theory, 2nd edition (North-Holland, Amsterdam, 1987) pp. 445–485
Feferman, S.: Remarks for The Trends in Logic. In: Logic Colloquium ‘88 (North-Holland, Amsterdam, 1989) pp. 361–363
Feferman, S.: Systems of predicative analysis II: representations of ordinals. J. Symbolic Logic 23, 193–220 (1968)
Kanamori, A.: The higher infinite. (Springer, Berlin, 1995)
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–275
Pohlers, W.: Proof theory and ordinal analysis. Arch. Math. Logic 30, 311–376 (1991)
Rathjen, M.: Proof-Theoretic Analysis of KPM. Arch. Math. Logic 30, 377–403 (1991)
Rathjen, M.: How to develop proof–theoretic ordinal functions on the basis of admissible sets. Mathematical Quarterly 39, 47–54 (1993)
Rathjen, M.: Collapsing functions based on recursively large ordinals: A well–ordering proof for KPM. Archive for Mathematical Logic 33, 35–55 (1994)
Rathjen, M.: Proof theory of reflection. Annals of Pure and Applied Logic 68, 181–224 (1994)
Rathjen, M.: Recent advances in ordinal analysis: Π12-CA and related systems. Bulletin of Symbolic Logic 1, 468–485 (1995)
Rathjen, M.: An ordinal analysis of parameter free Π12 comprehension. To appear in Archive for Mathematical Logic (2004?), 100 pages
Rathjen, M.: An ordinal analysis of iterated Π12 comprehension and related systems. Preprint, 85 pages
Rathjen, M.: Explicit mathematics with the monotone fixed point principle II: Models. Journal of Symbolic Logic 64, 517–550 (1999)
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–381
Sacks, G.E.: Higher recursion theory (Springer, Berlin, 1990)
Schütte, K.: Beweistheorie (Springer, Berlin, 1960)
Schütte, K.: Proof Theory, (Springer, Berlin, 1977)
Author information
Authors and Affiliations
Corresponding author
Additional information
The results in this paper were obtained in 1995 when the author was a Heisenberg Fellow of the German Science Foundation, Deutsche Forschungsgemeinschaft.
Rights and permissions
About this article
Cite this article
Rathjen, M. An ordinal analysis of stability. Arch. Math. Logic 44, 1–62 (2005). https://doi.org/10.1007/s00153-004-0226-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-004-0226-2