An Introduction to Gödel's Theorems

New York: Cambridge University Press (2007)
  Copy   BIBTEX

Abstract

In 1931, the young Kurt Gödel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory of arithmetic, there are some arithmetical truths the theory cannot prove. This remarkable result is among the most intriguing in logic. Gödel also outlined an equally significant Second Incompleteness Theorem. How are these Theorems established, and why do they matter? Peter Smith answers these questions by presenting an unusual variety of proofs for the First Theorem, showing how to prove the Second Theorem, and exploring a family of related results. The formal explanations are interwoven with discussions of the wider significance of the two Theorems. This book will be accessible to philosophy students with a limited formal background. It is equally suitable for mathematics students taking a first course in mathematical logic.

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

Similar books and articles

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.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
Gödel's incompleteness theorems.Raymond M. Smullyan - 1992 - New York: Oxford University Press. Edited by Lou Goble.
Interpreting Gödel: Critical Essays.Juliette Kennedy (ed.) - 2014 - Cambridge: Cambridge University Press.
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
Gödel's incompleteness theorems and computer science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
From closed to open systems.Carlo Cellucci - 1993 - In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Goedel's Way: Exploits Into an Undecidable World.Gregory J. Chaitin - 2011 - Crc Press. Edited by Francisco Antônio Doria & Newton C. A. da Costa.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
A Note on Boolos' Proof of the Incompleteness Theorem.Makoto Kikuchi - 1994 - Mathematical Logic Quarterly 40 (4):528-532.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.

Analytics

Added to PP
2009-01-28

Downloads
76 (#209,950)

6 months
9 (#242,802)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Smith
Cambridge University

References found in this work

No references found.

Add more references