Induction, minimization and collection for Δ n+1 (T)–formulas

Archive for Mathematical Logic 43 (4):505-541 (2004)
  Copy   BIBTEX

Abstract

For a theory T, we study relationships among IΔ n +1 (T), LΔ n+1 (T) and B * Δ n+1 (T). These theories are obtained restricting the schemes of induction, minimization and (a version of) collection to Δ n+1 (T) formulas. We obtain conditions on T (T is an extension of B * Δ n+1 (T) or Δ n+1 (T) is closed (in T) under bounded quantification) under which IΔ n+1 (T) and LΔ n+1 (T) are equivalent. These conditions depend on Th Πn +2 (T), the Π n+2 –consequences of T. The first condition is connected with descriptions of Th Πn +2 (T) as IΣ n plus a class of nondecreasing total Π n –functions, and the second one is related with the equivalence between Δ n+1 (T)–formulas and bounded formulas (of a language extending the language of Arithmetic). This last property is closely tied to a general version of a well known theorem of R. Parikh. Using what we call Π n –envelopes we give uniform descriptions of the previous classes of nondecreasing total Π n –functions. Π n –envelopes are a generalization of envelopes (see [10]) and are closely related to indicators (see [12]). Finally, we study the hierarchy of theories IΔ n+1 (IΣ m ), m≥n, and prove a hierarchy theorem

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
A new "feasible" arithmetic.Stephen Bellantoni & Martin Hofmann - 2002 - Journal of Symbolic Logic 67 (1):104-116.
A note on a theorem of Kanovei.Roman Kossak - 2004 - Archive for Mathematical Logic 43 (4):565-569.
Examining fragments of the quantified propositional calculus.Steven Perron - 2008 - Journal of Symbolic Logic 73 (3):1051-1080.
Remarks on Herbrand normal forms and Herbrand realizations.Ulrich Kohlenbach - 1992 - Archive for Mathematical Logic 31 (5):305-317.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
On normal forms in Łukasiewicz logic.A. Di Nola & A. Lettieri - 2004 - Archive for Mathematical Logic 43 (6):795-823.

Analytics

Added to PP
2013-11-23

Downloads
21 (#741,388)

6 months
7 (#439,760)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Alexis Fernandez
Florida International University

References found in this work

On the induction schema for decidable predicates.Lev D. Beklemishev - 2003 - Journal of Symbolic Logic 68 (1):17-34.
On Σ1‐definable Functions Provably Total in I ∏ 1−.Teresa Bigorajska - 1995 - Mathematical Logic Quarterly 41 (1):135-137.

Add more references