There May Be Many Arithmetical Gödel Sentences

Philosophia Mathematica 29 (2):278–287 (2021)
  Copy   BIBTEX

Abstract

We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.

Other Versions

No versions found

Similar books and articles

Analytics

Added to PP
2021-02-15

Downloads
1,198 (#41,420)

6 months
232 (#43,684)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

References found in this work

The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise, Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.
An Introduction to Gödel's Theorems.Peter Smith - 2007 - New York: Cambridge University Press.
An Introduction to Gödel's Theorems.Peter Smith - 2009 - Bulletin of Symbolic Logic 15 (2):218-222.
Maximal consistent sets of instances of Tarski’s schema.Vann McGee - 1992 - Journal of Philosophical Logic 21 (3):235 - 241.

View all 21 references / Add more references