Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T16:33:18.228Z Has data issue: false hasContentIssue false

Maximal sets and fragments of Peano arithmetic

Published online by Cambridge University Press:  22 January 2016

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.

Information

Type
Research Article
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1989