Godel's theorem: A proof from the book?
| Abstract | Here’s one version G¨ odel’s 1931 First Incompleteness Theorem: If T is a nice, sound theory of arithmetic, then it is incomplete, i.e. there are arithmetical sentences ϕ such that T proves neither ϕ nor ¬ϕ. There are three things here to explain straight away. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links | This entry has no external links. Add one. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesN. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
Yi-Zhuang Chen (2004). Edgar Morin's Paradigm of Complexity and Gödel's Incompleteness Theorem. World Futures 60 (5 & 6):421 – 431.
Zofia Adamowicz & Teresa Bigorajska (2001). Existentially Closed Structures and Gödel's Second Incompleteness Theorem. Journal of Symbolic Logic 66 (1):349-356.
Mark Steiner (2001). Wittgenstein as His Own Worst Enemy: The Case of Gödel's Theorem. Philosophia Mathematica 9 (3):257-279.
Peter Smith (2007). An Introduction to Gödel's Theorems. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2009-11-21Total downloads21 ( #58,716 of 549,065 )Recent downloads (6 months)1 ( #63,185 of 549,065 )How can I increase my downloads? |
My notes
Discussion
