On Overspill Principles and Axiom Schemes for Bounded Formulas

We study the theories I∇n, L∇n and overspill principles for ∇n formulas. We show that IEn L∇n I∇n, but we do not know if I∇n L∇n. We introduce a new scheme, the growth scheme Crγ, and we prove that L∇n Cr∇n I∇n. Also, we analyse the utility of bounded collection axioms for the study of the above theories. Mathematics Subject Classification: 03F30, 03H15.

[1]  Costas Dimitracopoulos,et al.  Overspill and fragments of arithmetic , 1989, Arch. Math. Log..

[2]  George M. Wilmers,et al.  Bounded Existential Induction , 1985, J. Symb. Log..

[3]  Richard Kaye Parameter-Free Universal Induction , 1989, Math. Log. Q..

[4]  George Wilmers,et al.  Models OF Peano Arithmetic (Oxford Logic Guides 15) , 1993 .

[5]  Mario J. Pérez-Jiménez,et al.  Maximum Schemes in Arithmetic , 1994, Math. Log. Q..

[6]  Petr Hájek,et al.  Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.