A proof-theoretic analysis of collection

Archive for Mathematical Logic

Volumn 37, Issue 5-6, 1998, Pages 275-296

  Beklemishev, Lev D ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032221392     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050099     Document Type: Article

References (26)

1. n+1(N). Fundamenta mathematicae 129:231-236, 1988
2. L.D. Beklemishev. Notes on local reflection principles. Logic Group Preprint Series 133, University of Utrecht, 1995
3. L.D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of Pure and Applied Logic 85(3):193-242, 1997
4. S. Buss. The witness function method and fragments of Peano arithmetic. In Proceedings of the ninth International Congress on Logic, Methodology and Philosophy of Science; Uppsala, Sweden August 7-14, 1991, pages 29-68. Elsevier, North-Holland, Amsterdam, 1994
5. P. Clote, P. Hájek, and J. Paris. On some formalized conservation results in arithmetic. Archive for Mathematical Logic 30:201-218, 1990
6. S.A. Cook. Computational complexity of higher type functions. In Proceedings of the international congress of math., Kyoto, Japan, 1990, pages 55-69. Math. Society of Japan, 1991
7. S. Feferman. Arithmetization of metamathematics in a general setting. Fundamenta Mathematicae 49-35-92, 1960
8. H. Gaifman and C. Dimitracopoulos. Fragments of Peano's arithmetic and the MDRP theorem. In Logic and algorithmic (Zürich, 1980), (Monograph. Enseign. Math., 30), pages 187-206. Genève, University of Genève, 1982
9. P. Hájek. Interpretability and fragments of arithmetic. In P. Clote and J. Krajíček, editors, Arithmetic, Proof Theory, and Computational Complexity, pages 185-196. Oxford University Press, Oxford, 1992
10. P. Hájek and P. Pudlák. Metamathematics of First Order Arithmetic. Springer-Verlag, Berlin, Heidelberg, New-York, 1993
11. R. Kaye. Using Herbrand-type theorems to separate strong fragments of arithmetic. In P. Clote and J. Krajíček, editors, Arithmetic, Proof Theory, and Computational Complexity, pages 238-246. Oxford University Press, Oxford, 1992
12. R. Kaye, J. Paris, and C. Dimitracopoulos. On parameter free induction schemas. Journal of Symbolic Logic 53(4): 1082-1097, 1988
13. G. Kreisel and A. Lévy. Reflection principles and their use for establishing the complexity of axiomatic systems. Zeitschrift f. math. Logik und Grundlagen d. Math. 14:97-142, 1968
14. D. Leivant. The optimality of induction as an axiomatization of arithmetic. Journal of Symbolic Logic 48:182-184, 1983
15. H. Ono. Reflection principles in fragments of Peano Arithmetic. Zeitschrift f. math. Logik und Grundlasen d. Math. 33(4):317-333, 1987
16. J. Paris. A hierarchy of cuts in models of arithmetic. In L. Pacholsky et al., editor, Model theory of algebra and arithmetic. Proceedings, Karapacz, Poland, 1979. Lecture Notes in Mathematics, v. 834, pages 312-337. Springer-Verlag, Berlin, 1980
17. J. Paris. A hierarchy of cuts in models of arithmetic. In L. Pacholsky et al., editor, Model theory of algebra and arithmetic. Proceedings, Karapacz, Poland, 1979. Lecture Notes in Mathematics, v. 834, pages 312-337. Springer-Verlag, Berlin, 1980
18. n-collection schema in arithmetic. In Logic Colloquium '77, pages 199-209. North Holland, Amsterdam, 1978
19. C. Parsons. Hierarchies of primitive recursive functions. Zeitschrift f. math. Logik und Grundlagen d. Math. 14(4):357-376, 1968
20. C. Parsons. On a number-theoretic choice schema and its relation to induction. In Kino, Myhill, and Vessley, editors, Intuitionism and Proof Theory, pages 459-473. North Holland, Amsterdam, 1970
21. C. Parsons. On n-quantifier induction. Journal of Symbolic Logic 37(3):466-482, 1972
22. H. Schwichtenberg. Some applications of cut-elimination. In J. Barwise, editor, Handbook of Mathematical Logic, pages 867-896. North Holland, Amsterdam, 1977
23. J.R. Shoenfield. Mathematical Logic. Addison-Wesley Publishing Company, 1967
24. W. Sieg. Fragments of arithmetic. Annals of Pure and Applied Logic 28:33-71, 1985
25. A. Visser. The formalization of interpretability. Studia Logica 50(1):81-106, 1991
26. A. Visser. Unprovability of small inconsistency. Archive for Math. Logic 32:275-298, 1993