On the scheme of induction for bounded arithmetic formulas
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
WEIHRAUCH, K. and KREITZ, C., Representations of the real numbers and of the open subsets of the set of real numbers WILKIE, AJ and PARIS, JB, On the scheme of induction for bounded arithmetic formulas. [REVIEW]Las Kirby &R. Diaconescu -1987 -Annals of Pure and Applied Logic 35:303.
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):49-62.
Structures interpretable in models of bounded arithmetic.Neil Thapen -2005 -Annals of Pure and Applied Logic 136 (3):247-266.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln,J. Mitchell &A. Scedrov -1992 -Annals of Pure and Applied Logic 56:365.
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann -2004 -Annals of Pure and Applied Logic 126 (1-3):255-280.
Bounded arithmetic and truth definition.Gaisi Takeuti -1988 -Annals of Pure and Applied Logic 39 (1):75-104.
Separations of theories in weak bounded arithmetic.Gaisi Takeuti -1995 -Annals of Pure and Applied Logic 71 (1):47-67.
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.
Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz -2021 -Annals of Pure and Applied Logic 172 (2):102885.
Analytics
Added to PP
2014-01-16
Downloads
72 (#319,515)
6 months
6 (#745,008)
2014-01-16
Downloads
72 (#319,515)
6 months
6 (#745,008)
Historical graph of downloads
How can I increase my downloads?Author's Profile
Citations of this work
On the Invariance of Gödel’s Second Theorem with Regard to Numberings.Balthasar Grabmayr -2021 -Review of Symbolic Logic 14 (1):51-84.
Bounded arithmetic and the polynomial hierarchy.Jan Krajíček,Pavel Pudlák &Gaisi Takeuti -1991 -Annals of Pure and Applied Logic 52 (1-2):143-153.
On Interpretations of Arithmetic and Set Theory.Richard Kaye &Tin Lok Wong -2007 -Notre Dame Journal of Formal Logic 48 (4):497-510.
Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev -1997 -Annals of Pure and Applied Logic 85 (3):193-242.
Provability of the pigeonhole principle and the existence of infinitely many primes.J. B. Paris,A. J. Wilkie &A. R. Woods -1988 -Journal of Symbolic Logic 53 (4):1235-1244.
References found in this work
Existence and feasibility in arithmetic.Rohit Parikh -1971 -Journal of Symbolic Logic 36 (3):494-508.
A note on the undefinability of cuts.J. B. Paris &C. Dimitracopoulos -1983 -Journal of Symbolic Logic 48 (3):564-569.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-5b9ff6f457-pc6d8 uwo