On Overspill Principles and Axiom Schemes for Bounded Formulas

, &
Mathematical Logic Quarterly 42 (1):341-348 (1996)
  Copy   BIBTEX

Abstract

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

Categories

Keywords

Reprint years

DOI

10.1002/malq.19960420129

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

External links

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

Through your library

My notes

Similar books and articles

Induction, minimization and collection for Δ n+1 (T)–formulas.A. Fernández-Margarit & F. F. Lara-Martín - 2004 - Archive for Mathematical Logic 43 (4):505-541.
On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
Dynamic ordinal analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
Intermediate logics with the same disjunctionless fragment as intuitionistic logic.Plerluigi Minari - 1986 - Studia Logica 45 (2):207 - 222.
On the quantifier complexity of Δ n+1 (T)– induction.A. Cordón-Franco, A. Fernández-Margarit & F. F. Lara-Martín - 2004 - Archive for Mathematical Logic 43 (3):371-398.
An incompleteness theorem for β n -models.Carl Mummert & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (2):612-616.
Maximality in finite-valued Lukasiewicz logics defined by order filters.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - 2019 - Journal of Logic and Computation 29 (1):125-156.
Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
Martin's axiom, omitting types, and complete representations in algebraic logic.Tarek Sayed Ahmed - 2002 - Studia Logica 72 (2):285 - 309.
A proof-theoretic analysis of collection.Lev D. Beklemishev - 1998 - Archive for Mathematical Logic 37 (5-6):275-296.

Analytics

Added to PP
2013-12-01

Downloads
29 (#861,538)

6 months
1 (#1,597,699)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.

Add more citations

References found in this work

Add more references