An ordinal analysis of parameter free Π1 2- comprehension

Archive for Mathematical Logic

Volumn 44, Issue 3, 2005, Pages 263-362

  Rathjen, Michael ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444392810     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00153-004-0232-4     Document Type: Article

References (26)

1. Barwise, J.: Admissible Sets and Structures. Springer, Berlin, 1975
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-147
3. Devlin, K.J.: Constructibility. Springer, Berlin, 1984
4. Drake, F.: Set Theory: An introduction to large cardinals. Amsterdam: North Holland, 1974
5. Feferman, S.: Systems of predicative analysis. J. Symbolic Logic 29, 1-30 (1964)
6. Feferman, S.: Systems of predicative analysis II: representations of ordinals. J. Symbolic Logic 23, 193-220 (1968)
7. nd edition, North-Holland, Amsterdam, 1987, pp. 445-485
8. Feferman, S.: Remarks for "The Trends in Logic". In: Logic Colloquium '88, North-Holland, Amsterdam, 1989, pp. 361-363
9. Gentzen, G.: Stenogramm von G. Gentzen, 1945 Transcription by H. Kneser and H. Urban, 13 pages
10. Jensen, R.B.: The fine structure of the constructible hierarchy. Ann. Math. Logic 4, 229-308 (1972)
11. Kanamori, A.: The higher infinite. Springer, Berlin, 1995
12. 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
13. Pohlers, W.: Proof theory and ordinal analysis. Arch. Math. Logic 30, 311-376 (1991)
14. Rathjen, M.: How to develop proof-theoretic ordinal functions on the basis of admissible sets. Math. Quart. 39, 47-54 (1993)
15. Rathjen, M.: Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. Arch. Math. Logic 33, 35-55 (1994)
16. Rathjen, M.: Proof theory of reflection. Ann. Pure Appl. Logic 68, 181-224 (1994)
17. 1-CA and related systems. Bulletin of Symbolic Logic 1, 468-485 (1995)
18. 1 comprehension and related systems. Preprint
19. Rathjen, M.: Explicit mathematics with the monotone fixed point principle II. Models. J. Symbolic Logic 64, 517-550 (1999)
20. Rathjen, M.: An ordinal analysis of stability. To appear in: Archive for Mathematical Logic
21. 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
22. Sacks, G.E.: Higher recursion theory. Springer, Berlin, 1990
23. Schlüter, A.: Provability in set theories with reflection. Submitted
24. Scḧtte, K.: Proof Theory. Springer, Berlin, 1977
25. Solovay, R.M., Reinhard, W.N., Kanamori, A.: Strong Axioms of Infinity and Elementary Embeddings, Ann. Math. Logic 13, 73-116 (1978)
26. Takeuti, G.: Proof theory and set theory. Synthese 62, 255-263 (1985)