Proof-theoretic analysis by iterated reflection

Archive for Mathematical Logic

Volumn 42, Issue 6, 2003, Pages 515-552

  Beklemishev, L D ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041415898     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00153-002-0158-7     Document Type: Article

References (31)

1. 0 + EXP. In P. Agliano and A. Ursini, editors, Logic and Algebra, pages 317-325. Marcel Dekker, New York, 1996.
2. Beklemishev L.D.: Induction rules, reflection principles, and provably recursive functions. Annals of Pure and Applied Logic, 85, 193-242 (1997)
3. Beklemishev L.D.: Notes on local reflection principles. Theoria, 63, 139-146 (1997)
4. Beklemishev L.D.: A proof-theoretic analysis of collection. Archive for Mathematical Logic, 37, 275-296 (1998)
5. Beklemishev L.D.: Parameter free induction and provably total computable functions. Theoretical Computer Science, 224, 13-33 (1999)
6. Beklemishev L.D.: Provability algebras and proof-theoretic ordinals, I. Logic Group Preprint Series 208, University of Utrecht, 2001. http://www.phil.uu.nl/preprints.html. To appear in Annals of Pure and Applied Logic
7. Feferman S.: Arithmetization of metamathematics in a general setting. Fundamenta Mathematicae, 49, 35-92 (1960)
8. Feferman S.: Transfinite recursive progressions of axiomatic theories. Journal of Symbolic Logic, 27, 259-316 (1962)
9. Gaifman H., Dimitracopoulos C.: Fragments of Peano's arithmetic and the MDRP theorem. In Logic and algorithmic (Zurich, 1980), (Monograph. Enseign. Math., 30), pages 187-206. Genève, University of Genève, 1982
10. Goryachev S.: On interpretability of some extensions of arithmetic. Mat. Zametki, 40, 561-572 (1986) In Russian. English translation in Math. Notes, 40
11. Goryachev S.: On interpretability of some extensions of arithmetic. Mat. Zametki, 40, 561-572 (1986) In Russian. English translation in Math. Notes, 40
12. Hájek P., Pudlák P.: Metamathematics of First Order Arithmetic. Springer-Verlag, Berlin, Heidelberg, New York, 1993
13. Kaye, R., Paris, J., Dimitracopoulos, C.: On parameter free induction schemas. Journal of Symbolic Logic 53, 1082-1097 (1988)
14. Kreisel, G.: Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt. Jahresbericht der Deutschen Mathematiker-Vereinigung, 78, 177-223 (1977)
15. Kreisel, G., Lévy, A.L.: Reflection principles and their use for establishing the complexity of axiomatic systems. Zeitschrift f. math. Logik und Grundlagen d. Math., 14, 97-142 (1968)
16. Leivant, D.: The optimality of induction as an axiomatization of arithmetic. Journal of Symbolic Logic 48, 182-184 (1983)
17. Lindström, P.: The modal logic of Parikh provability. Tech. Rep. Filosofiska Meddelanden, Gröna Serien 5, Univ. Göteborg, 1994
18. Möllerfeld, M.: Zur Rekursion längs fundierten Relationen und Hauptfolgen. Diplomarbeit, Institut für Mathematische Logik, Westf. Wilhelms-Universität, Münster, 1996
19. Ono, H.: Reflection principles in fragments of Peano Arithmetic. Zeitschrift f. math. Logik und Grundlagen d. Math., 33, 317-333 (1987)
20. Parikh, R.: Existence and feasibility in arithmetic. Journal of Symbolic Logic 36, 494-508 (1971)
21. Parsons, C.: On a number-theoretic choice schema and its relation to induction. In A. Kino, J. Myhill, and R.E. Vessley, editors, Intuitionism and Proof Theory, pages 459-473. North Holland, Amsterdam, 1970
22. Parsons, C.: On n-quantifier induction. Journal of Symbolic Logic, 37, 466-482 (1972)
23. Pohlers, W.: A short course in ordinal analysis. In A. Axcel and S. Wainer, editors, Proof Theory, Complexity, Logic, pages 867-896. Oxford University Press, Oxford, 1993
24. Pohlers, W.: Subsystems of set theory and second order number theory. In S.R. Buss, editor, Handbook of Proof Theory, pages 210-335. Elsevier, North-Holland, Amsterdam, 1998
25. Rose, H.E.: Subrecursion: Functions and Hierarchies. Clarendon Press, Oxford, 1984
26. Schmerl, U.R.: A fine structure generated by reflection formulas over Primitive Recursive Arithmetic. In M. Boffa, D. van Dalen, and K. McAloon, editors, Logic Colloquium'78, pages 335-350. North Holland, Amsterdam, 1979
27. Smoryński, C.: The incompleteness theorems. In J. Barwise, editor, Handbook of Mathematical Logic, pages 821-865. North Holland, Amsterdam, 1977
28. Sommer, R.: Transfinite induction within Peano arithmetic. Annals of Pure and Applied Logic 76, 231-289 (1995)
29. Turing, A.M.: System of logics based on ordinals. Proc. London Math. Soc. ser. 2, 45, 161-228 (1939)
30. Visser, A.: Interpretability logic. In P.P. Petkov, editor, Mathematical Logic, pages 175-208. Plenum Press, New York, 1990
31. Wilkie, A., Paris, J.: On the scheme of induction for bounded arithmetic formulas. Annals of Pure and Applied Logic 35, 261-302 (1987)