Incompleteness Theorems and S i 2 versus S i+1 2Godel Sentences of Bounded Arithmetic
Bulletin of Symbolic Logic 8 (3):433 (2002)
Abstract
This article has no associated abstract. (fix it)DOI
10.2307/3062213
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
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
Review: Jan Krajicek, Pavel Pudlak, Gaisi Takeuti, Bounded Arithmetic and the Polynomial Hierarchy; Samuel R. Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies; Domenico Zambella, Notes on Polynomially Bounded Arithmetic. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
An unexpected separation result in Linearly Bounded Arithmetic.Arnold Beckmann & Jan Johannsen - 2005 - Mathematical Logic Quarterly 51 (2):191-200.
Incompleteness Theorems and S i 2 versus S i+1 2.Gaisi Takeuti - 2002 - Bulletin of Symbolic Logic 8 (3):433-435.
Gödel sentences of bounded arithmetic.Gaisi Takeuti - 2000 - Journal of Symbolic Logic 65 (3):1338-1346.
Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
A Remark on Independence Results for Sharply Bounded Arithmetic.Jan Johannsen - 1998 - Mathematical Logic Quarterly 44 (4):568-570.
Arithmetic and Logic Incompleteness: the Link.Laureano Luna & Alex Blum - 2008 - The Reasoner 2 (3):6.
The Second Incompleteness Theorem and Bounded Interpretations.Albert Visser - 2012 - Studia Logica 100 (1-2):399-418.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.Neil Thapen - 2011 - Archive for Mathematical Logic 50 (7-8):665-680.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Analytics
Added to PP
2010-08-30
Downloads
9 (#938,252)
6 months
2 (#301,800)
2010-08-30
Downloads
9 (#938,252)
6 months
2 (#301,800)
Historical graph of downloads
