- 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 parameter free induction schemas
Journal of Symbolic Logic 53 (4):1082-1097 (1988)
Abstract
We present a comprehensive study of the axiom schemas IΣ - n , BΣ - n (induction and collection schemas for parameter free Σ n formulas) and some closely related schemasAuthor's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Envelopes, indicators and conservativeness.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2006 - Mathematical Logic Quarterly 52 (1):51-70.
Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.
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 Overspill Principles and Axiom Schemes for Bounded Formulas.Joaquín Borrego-Díaz, Alejandro Fernández-Margarit & Mario Pérez-Jiménez - 1996 - Mathematical Logic Quarterly 42 (1):341-348.
On some formalized conservation results in arithmetic.P. Clote, P. Hájek & J. Paris - 1990 - Archive for Mathematical Logic 30 (4):201-218.
Local induction and provably total computable functions.Andrés Cordón-Franco & F. Félix Lara-Martín - 2014 - Annals of Pure and Applied Logic 165 (9):1429-1444.
A note on parameter free Π1 -induction and restricted exponentiation.A. Cordón-Franco, A. Fernández-Margarit & F. F. Lara-Martín - 2011 - Mathematical Logic Quarterly 57 (5):444-455.
Truth definitions without exponentiation and the Σ₁ collection scheme.Zofia Adamowicz, Leszek Aleksander Kołodziejczyk & Jeff Paris - 2012 - Journal of Symbolic Logic 77 (2):649-655.
Deontic Logic: A Comprehensive Appraisal and a New Proposal.Azizah al-Hibri - 1978 - Washington, DC, USA: University Press of America.
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
Analytics
Added to PP
2009-01-28
Downloads
77 (#269,114)
6 months
18 (#156,046)
2009-01-28
Downloads
77 (#269,114)
6 months
18 (#156,046)
Historical graph of downloads
Author's Profile
Citations of this work
Bounded arithmetic for NC, ALogTIME, L and NL.P. Clote & G. Takeuti - 1992 - Annals of Pure and Applied Logic 56 (1-3):73-117.
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories.Albert Visser - 2014 - Mathematical Logic Quarterly 60 (1-2):92-117.
Induction and Skolemization in saturation theorem proving.Stefan Hetzl & Jannik Vierling - 2023 - Annals of Pure and Applied Logic 174 (1):103167.
The Arithmetics of a Theory.Albert Visser - 2015 - Notre Dame Journal of Formal Logic 56 (1):81-119.
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.
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-f8568656d-kkgnk uwo