Philosophia Mathematica 15 (2):193-226 (2007)
AbstractProofs of Gödel's First Incompleteness Theorem are often accompanied by claims such as that the gödel sentence constructed in the course of the proof says of itself that it is unprovable and that it is true. The validity of such claims depends closely on how the sentence is constructed. Only by tightly constraining the means of construction can one obtain gödel sentences of which it is correct, without further ado, to say that they say of themselves that they are unprovable and that they are true; otherwise a false theory can yield false gödel sentences
Similar books and articles
On Turing Machines Knowing Their Own Gödel-Sentences.Neil Tennant - 2001 - Philosophia Mathematica 9 (1):72-79.
On the Philosophical Relevance of Gödel's Incompleteness Theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
How Do We Know That the Godel Sentence of a Consistent Theory Is True?G. Sereny - 2011 - Philosophia Mathematica 19 (1):47-73.
Questioning Gödel's Ontological Proof: Is Truth Positive?Gregor Damschen - 2011 - European Journal for Philosophy of Religion 3 (1):161-169.
The Modal Logic of Gödel Sentences.Hirohiko Kushida - 2010 - Journal of Philosophical Logic 39 (5):577 - 590.
The Gödel Paradox and Wittgenstein's Reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
Sentences Undecidable in Formalized Arithmetic: An Exposition of the Theory of Kurt Gödel.Andrzej Mostowski - 1952 - Amsterdam, Netherlands: Greenwood Press.
Added to PP
Historical graph of downloads
Citations of this work
Self-Reference in Arithmetic I.Volker Halbach & Albert Visser - 2014 - Review of Symbolic Logic 7 (4):671-691.
Self-Reference Upfront: A Study of Self-Referential Gödel Numberings.Balthasar Grabmayr & Albert Visser - forthcoming - Review of Symbolic Logic:1-40.
There May Be Many Arithmetical Gödel Sentences.Kaave Lajevardi & Saeed Salehi - 2021 - Philosophia Mathematica 29 (2):278–287.
References found in this work
Mathematical Logic.Joseph R. Shoenfield - 1967 - Reading, MA, USA: Reading, Mass., Addison-Wesley Pub. Co..
Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 1974 - Cambridge, England: Cambridge University Press.