- 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
Bounded existential induction
Journal of Symbolic Logic 50 (1):72-90 (1985)
Abstract
This article has no associated abstract. (fix it)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
An Independence Result on Weak Second Order Bounded Arithmetic.Satoru Kuroda - 2001 - Mathematical Logic Quarterly 47 (2):183-186.
Notes on bounded induction for the compositional truth predicate.Bartosz Wcisło & Mateusz Łełyk - 2017 - Review of Symbolic Logic 10 (3):455-480.
A note on exponentiation.Ch Cornaros & C. Dimitracopoulos - 1993 - Journal of Symbolic Logic 58 (1):64-71.
Bounded Induction and Satisfaction Classes.Henryk Kotlarski - 1986 - Mathematical Logic Quarterly 32 (31-34):531-544.
Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.
The bounded functional interpretation of bar induction.Patrícia Engrácia - 2012 - Annals of Pure and Applied Logic 163 (9):1183-1195.
Second order inductive logic and Wilmers' principle.M. S. Kließ & J. B. Paris - 2014 - Journal of Applied Logic 12 (4):462-476.
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.
The strength of sharply bounded induction.Emil Jeřábek - 2006 - Mathematical Logic Quarterly 52 (6):613-624.
Analytics
Added to PP
2009-01-28
Downloads
34 (#484,801)
6 months
10 (#309,337)
2009-01-28
Downloads
34 (#484,801)
6 months
10 (#309,337)
Historical graph of downloads
Citations of this work
Pell equations and exponentiation in fragments of arithmetic.Paola D'Aquino - 1996 - Annals of Pure and Applied Logic 77 (1):1-34.
Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1):143-157.
A sharpened version of McAloon's theorem on initial segments of models of IΔ0.Paola D'Aquino - 1993 - Annals of Pure and Applied Logic 61 (1-2):49-62.
A sharpened version of McAloon's theorem on initial segments of models of< i> IΔ_< sub> 0.Paola D'Aquino - 1993 - Annals of Pure and Applied Logic 61 (1):49-62.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
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-68866f4b87-hhxx8 uwo