Article contents
On parameter free induction schemas
Published online by Cambridge University Press: 12 March 2014
Abstract
We present a comprehensive study of the axiom schemas (induction and collection schemas for parameter free Σ
n
formulas) and some closely related schemas.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1988
References
REFERENCES
[1]
Gaifman, H. and Dimitracopoulos, C., Fragments of Peano's arithmetic and the MRDP theorem, Logic and algorithmic (symposium in honor of Ernest Specker, Zürich, 1980), Monographies de L'Enseignement Mathématique, vol. 30, Université de Genève, Geneva, 1982, pp. 187–206.Google Scholar
[2]
Ketonen, J. and Solovay, R., Rapidly growing Ramsey functions, Annals of Mathematics, ser. 2, vol. 113 (1981), pp. 267–314.CrossRefGoogle Scholar
[3]
Lessan, H., Models of arithmetic, Ph.D. thesis, University of Manchester, Manchester, 1978.Google Scholar
[4]
Paris, J. and Kirby, L.,
Σ
n
-collection schemas in arithmetic, Logic Colloquium '77, North-Holland, Amsterdam, 1978, pp. 199–209.CrossRefGoogle Scholar
[5]
Paris, J., A hierarchy of cuts in models of arithmetic, Models theory of algebra and arithmetic (proceedings, Karpacz, 1979), Lecture Notes in Mathematics, vol. 834, Springer-Verlag, Berlin, 1980, pp. 312–337.CrossRefGoogle Scholar
[6]
Wilkie, A. J., Some results and problems on weak systems of arithmetic, Logic Colloquium '77, North-Holland, Amsterdam, 1978, pp. 285–296.CrossRefGoogle Scholar
[7]
Wilkie, A. J. and Paris, J. B., On the scheme of induction for bounded arithmetic formulas, Annals of Pure and Applied Logic, vol. 35 (1987), pp. 261–302.CrossRefGoogle Scholar
[8]
Wilmers, G., Bounded existential induction, this Journal, vol. 50 (1985), pp. 72–90.Google Scholar
- 14
- Cited by