A note on parameter free Π1 -induction and restricted exponentiation

Mathematical Logic Quarterly 57 (5):444-455 (2011)
  Copy   BIBTEX

Abstract

We characterize the sets of all Π2 and all equation image theorems of IΠ−1 in terms of restricted exponentiation, and use these characterizations to prove that both sets are not deductively equivalent. We also discuss how these results generalize to n > 0. As an application, we prove that a conservation theorem of Beklemishev stating that IΠ−n + 1 is conservative over IΣ−n with respect to equation image sentences cannot be extended to Πn + 2 sentences. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
36 (#457,838)

6 months
8 (#415,167)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Andrés Cordón
Universidad de Sevilla
Alonso Fernandez
Universidad Panamericana Sede México
Felicity Martin
University of Sydney

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
On n-quantifier induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466-482.
On 퐧-Quantifier Induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466 - 482.
On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.

View all 8 references / Add more references