- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On Overspill Principles and Axiom Schemes for Bounded Formulas
Mathematical Logic Quarterly 42 (1):341-348 (1996)
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 theoriesAuthor's Profile
My notes
Similar books and articles
Maximum Schemes in Arithmetic.A. Fernández-Margarit & M. J. Pérez-Jiménez - 1994 - Mathematical Logic Quarterly 40 (3):425-430.
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.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Remarks on Herbrand normal forms and Herbrand realizations.Ulrich Kohlenbach - 1992 - Archive for Mathematical Logic 31 (5):305-317.
The bounded proper forcing axiom.Martin Goldstern & Saharon Shelah - 1995 - Journal of Symbolic Logic 60 (1):58-73.
On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
The Bounded Axiom A Forcing Axiom.Thilo Weinert - 2010 - Mathematical Logic Quarterly 56 (6):659-665.
On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
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.
Algebraic Methods and Bounded Formulas.Domenico Zambella - 1997 - Notre Dame Journal of Formal Logic 38 (1):37-48.
Analytics
Added to PP
2013-12-01
Downloads
24 (#672,664)
6 months
10 (#304,201)
2013-12-01
Downloads
24 (#672,664)
6 months
10 (#304,201)
Historical graph of 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.
Weak forms of the Regularity Principle in the presence of equation image.Charalampos Cornaros - 2013 - Mathematical Logic Quarterly 59 (1-2):84-100.
References found in this work
Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-747975fc64-fsjhg uwo