Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-06-16T11:02:50.173Z Has data issue: false hasContentIssue false
  • English
  • Français

Maximal sets and fragments of Peano arithmetic

Published online by Cambridge University Press:  22 January 2016

C.T. Chong
C.T. Chong*
Affiliation:
Department of Mathematics, National University of Singapore, Kent Ridge, Singapore 0511, Republic of Singapore
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This work is inspired by the recent paper of Mytilinaios and Slaman [9] on the infinite injury priority method. It may be considered to fall within the general program of the study of reverse recursion theory: What axioms of Peano arithmetic are required or sufficient to prove theorems in recursion theory? Previous contributions to this program, especially with respect to the finite and infinite injury priority methods, can be found in the works of Groszek and Mytilinaios [4], Groszek and Slaman [5], Mytilinaios [8], Slaman and Woodin [10]. Results of [4] and [9], for example, together pinpoint the existence of an incomplete, nonlow r.e. degree to be provable only within some fragment of Peano arithmetic at least as strong as P- + IΣ2. Indeed an abstract principle on infinite strategies, such as that on the construction of an incomplete high r.e. degree, was introduced in [4] and shown to be equivalent to Σ2 induction over the base theory P- + IΣ0 of Peano arithmetic.

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 115 , September 1989 , pp. 165 - 183
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1989

References

[1] Chong, C. T., Techniques of Admissible Recursion Theory, Lecture Notes in Math. 1106, Springer Verlag, 1984.Google Scholar
[2] Chong, C. T. and Lerman, M., Hyperhypersimple α-r.e. sets, Ann. of Math., Logic, 9 (1976), 1–48.Google Scholar
[3] Friedberg, R. M., Three theorems on recursive enumeration: I. Decomposition, II. Maximal set, III. Enumeration without duplication, J. Symbolic Logic, 23 (1958), 309–316.Google Scholar
[4] Groszek, M. J. and Mytilinaios, M. E., Σ2 induction and the construction of a high degree, to appear.CrossRefGoogle Scholar
[5] Groszek, M. J. and Slaman, T. A., Foundations of the priority method I: Finite and infinite injury, to appear.Google Scholar
[6] Kirby, L. A. and Paris, J. B., Σn collection schémas in arithmetic, in: Logic colloquium ’77, North-Holland, 1978, 199–209.Google Scholar
[7] Lerman, M. and Simpson, S. J., Maximal sets in a-recursion theory, Israel J. Math., 4 (1973), 236–247.CrossRefGoogle Scholar
[8] Mytilinaios, M. E., Finite injury and Σ1 induction, J. Symbolic Logic, 54 (1989), 38–49.CrossRefGoogle Scholar
[9] Mytilinaios, M. E. and Slaman, T. A., Σ2 collection and the infinite injury priority method, J. Symbolic Logic, 53 (1988), 212–221.CrossRefGoogle Scholar
[10] Slaman, T. A. and Woodin, W. H., Σ1 collection and the finite injury priority method, to appear.Google Scholar
[11] Shore, R. A., On the jump of an α-recursively enumerable set, Trans. Amer. Math. Soc, 217 (1976), 351–363.Google Scholar
[12] Soare, R. I., Recursively Enumerable Sets and Degrees, Q Series, Springer Verlag, 1987.Google Scholar