Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-14T08:13:52.070Z Has data issue: false hasContentIssue false
  • English
  • Français

On parameter free induction schemas

Published online by Cambridge University Press:  12 March 2014

R. Kaye ,
J. Paris  and
C. Dimitracopoulos
R. Kaye
Affiliation:
Department of Mathematics, University of Manchester, Manchester M13 9PL, England Department of Mathematics, University of Crete, 71409 Iraklion, Greece
J. Paris*
Affiliation:
Department of Mathematics, University of Manchester, Manchester M13 9PL, England Department of Mathematics, University of Crete, 71409 Iraklion, Greece
C. Dimitracopoulos
Affiliation:
Department of Mathematics, University of Manchester, Manchester M13 9PL, England Department of Mathematics, University of Crete, 71409 Iraklion, Greece
*
Jesus College, Oxford OX1 3DW, England
Get access Rights & Permissions [Opens in a new window]

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
The Journal of Symbolic Logic , Volume 53 , Issue 4 , December 1988 , pp. 1082 - 1097
Copyright
Copyright © Association for Symbolic Logic 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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