On the induction schema for decidable predicates

Journal of Symbolic Logic

Volumn 68, Issue 1, 2003, Pages 17-34

  Beklemishev, Lev D ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037354610     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1045861504     Document Type: Article

References (11)

1. L. D. Beklemishev, Induction rules, reflection principles, and provably recursive functions, Annals of Pure and Applied Logic, vol. 85 (1997), pp. 193-242.
2. L. D. Beklemishev, A proof-theoretic analysis of collection, Archive for Mathematical Logic, vol. 37 (1998), pp. 275-296.
3. L. D. Beklemishev, Open least element principle and bounded query computation, Computer science logic, 13th international workshop, CSL’99, Madrid, Spain, September 20—25, 1999, Proceedings (J. Flum and M. Rodrigues-Artalejo, editors), Lecture Notes in Computer Science, vol. 1683, Springer-Verlag, Berlin, 1999, pp. 389-404.
4. P. ClOTe and J. KRAJíček, Open problems, Arithmetic, proof theory, and computational complexity (P Clote and J. KrajiCek, editors), Oxford University Press, Oxford, 1993, pp. 1-19.
5. P HAjEk and P PuDlák, Metamathematics of first order arithmetic, Springer-Verlag, Berlin, Heidelberg, New York, 1993.
6. R. Kaye, J. Paris, and C. Dimitracopoulos, On parameter free induction schemas, this Journai, vol. 53 (1988), no. 4, pp. 1082-1097.
7. J. Paris, A hierarchy of cuts in models of arithmetic, Model theory of algebra and arithmetic, Proceedings, Karapascz, Poland, 1979, Lecture Notes in Mathematics, vol. 834, Springer-Verlag, 1980, pp. 312-337.
8. C. Parsons, On a number-theoretic choice schema and its relation to induction, Intuitionism and proof theory (A. Kino, J. Myhill, and R. E. Vessley, editors), North-Holland, Amsterdam, 1970, pp. 459-473.
9. C. Parsons, On n-quantifier induction, this Journal, vol. 37 (1972), no. 3, pp. 466-482.
10. A. Rastsvetaev and L. Beklemishev, On the query complexity offinding a local maximum point, Logic Group Preprint Series 206, University of Utrecht, 2000.
11. H. Schwichtenberg, Some applications of cut-elimination, Handbook of mathematical logic (J. Barwise, editor), North-Holland, Amsterdam, 1977, pp. 867-896.