Incompleteness theorems and Si2 versus Si+12 and Gödel sentences of bounded arithmetic [Book Review]

Bulletin of Symbolic Logic 8 (3):433-434 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1182353902

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Incompleteness Theorems and S i 2 versus S i+1 2Godel Sentences of Bounded Arithmetic.Arnold Beckmann & Gaisi Takeuti - 2002 - Bulletin of Symbolic Logic 8 (3):433.
Arithmetic Proof and Open Sentences.Neil Thompson - 2012 - Philosophy Study 2 (1):43-50.
Three theorems of Godel.Andrew Boucher - manuscript
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
On the philosophical relevance of Gödel's incompleteness theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
Gödel's incompleteness theorems and computer science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
Arithmetic and Logic Incompleteness: the Link.Laureano Luna & Alex Blum - 2008 - The Reasoner 2 (3):6.
Gödel’s Incompleteness Theorems and Physics.Newton C. A. Da Costa - 2011 - Principia: An International Journal of Epistemology 15 (3):453-459.
Completude Diz-se em Vários Sentidos: Completeness can be Said in Several Meanings.Edelcio Gonçalves de Souza - 2004 - Cognitio 5 (2):78-82.
The Modal Logic of Gödel Sentences.Hirohiko Kushida - 2010 - Journal of Philosophical Logic 39 (5):577 - 590.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
On Gödel Sentences and What They Say.Peter Milne - 2007 - Philosophia Mathematica 15 (2):193-226.
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.

Analytics

Added to PP
2014-03-24

Downloads
18 (#781,713)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references