In Ivor Grattan-Guinness (ed.), Landmark Writings in Mathematics. Amsterdam: North-Holland. pp. 917-925 (2005)

Authors
Richard Zach
University of Calgary
Abstract
This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that are neither provable nor refutable. The first theorem is general in the sense that it applies to any axiomatic theory, which is ω-consistent, has an effective proof procedure, and is strong enough to represent basic arithmetic. Their importance lies in their generality: although proved specifically for extensions of system, the method Gödel used is applicable in a wide variety of circumstances. Gödel's results had a profound influence on the further development of the foundations of mathematics. It pointed the way to a reconceptualization of the view of axiomatic foundations.
Keywords Kurt Gödel  incompleteness theorem
Categories (categorize this paper)
Buy the book Find it on Amazon.com
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

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.
On Gödel Sentences and What They Say.Peter Milne - 2007 - Philosophia Mathematica 15 (2):193-226.
Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
An Introduction to Gödel's Theorems.Peter Smith - 2007 - Cambridge University Press.
Gödel's Incompleteness Theorems and Computer Science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Arnold Beckmann, Ulrich Berger, Benedikt Löwe & John V. Tucker (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Berlin: Springer. pp. 575--583.
A Note on Boolos' Proof of the Incompleteness Theorem.Makoto Kikuchi - 1994 - Mathematical Logic Quarterly 40 (4):528-532.
Gödel’s Incompleteness Theorems and Physics.Newton C. A. Da Costa - 2011 - Principia: An International Journal of Epistemology 15 (3):453-459.
Query the Triple Loophole of the Proof of Gödel Incompleteness Theorem.Fangwen Yuan - 2008 - Proceedings of the Xxii World Congress of Philosophy 41:77-94.

Analytics

Added to PP index
2017-10-10

Total views
451 ( #19,034 of 2,462,279 )

Recent downloads (6 months)
54 ( #15,782 of 2,462,279 )

How can I increase my downloads?

Downloads

My notes