Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Hájek, P. Pudlák (1993)
Metamathematics of First-Order Arithmetic
L. Beklemishev (1999)
Parameter Free Induction and Provably Total Computable FunctionsTheor. Comput. Sci., 224
G. Takeuti (1994)
Grzegorcyk's hierarchy and IepΣ1Journal of Symbolic Logic, 59
A. Fernández-Margarit, F. Martín (2004)
Induction, minimization and collection for Δn+1(T)–formulasArchive for Mathematical Logic, 43
P. D'Aquino (1993)
A Sharpened Version of McAloon's Theorem on Initial Segments of Models of I Delta0Ann. Pure Appl. Log., 61
Teresa Bigorajska (1995)
On Sigma1-definable Functions Provably Total in I-Pi1-Math. Log. Q., 41
L. Kirby, J. Paris (1977)
Initial segments of models of Peano's axioms
L. Beklemishev (1998)
A proof-theoretic analysis of collectionArchive for Mathematical Logic, 37
(2003)
Fragments of Arithmetic with Extensions of Bounded Complexity
R. Kaye, J. Paris, C. Dimitracopoulos (1988)
On parameter free induction schemasJournal of Symbolic Logic, 53
R. Kaye (1991)
Models of Peano arithmetic, 15
(1988)
Dimitracopoulos
H. Rose (1984)
Subrecursion: Functions and Hierarchies
L. Beklemishev (1995)
Induction Rules, Reflection Principles, and Provably Recursive FunctionsAnn. Pure Appl. Log., 85
(1987)
Diophantine and Parameter–free Induction
(1990)
Transfinite induction and hierarchies generated by transfinite recursion within Peano arithmetic
D. Leivant (1983)
The optimality of induction as an axiomatization of arithmeticJournal of Symbolic Logic, 48
G. Wilmers (1993)
Models OF Peano Arithmetic (Oxford Logic Guides 15)Bulletin of The London Mathematical Society, 25
C. Parsons (1972)
On n-quantifier inductionJournal of Symbolic Logic, 37
In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class of theories such that IΔ n+1 (T) is Π n+2 –axiomatizable. In particular, IΔ n+1 (IΔ n+1 ) gives an axiomatization of Th Π n+2 (IΔ n+1 ) and is not finitely axiomatizable. This fact relates the fragment IΔ n+1 (IΔ n+1 ) to induction rule for Δ n+1 –formulas. Our arguments, involving a construction due to R. Kaye (see [9]), provide proofs of Parsons’ conservativeness theorem (see [16]) and (a weak version) of a result of L.D. Beklemishev on unnested applications of induction rules for Π n+2 and Δ n+1 formulas (see [2]).
Archive for Mathematical Logic – Springer Journals
Published: Feb 2, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.