Gödel's Incompleteness Theorems

The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.) (2013)
  Copy   BIBTEX

Abstract

Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal system cannot prove that the system itself is consistent (assuming it is indeed consistent). These results have had a great impact on the philosophy of mathematics and logic. There have been attempts to apply the results also in other areas of philosophy such as the philosophy of mind, but these attempted applications are more controversial. The present entry surveys the two incompleteness theorems and various issues surrounding them.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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 and computer science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
Gödel’s Incompleteness Theorems and Physics.Newton C. A. Da Costa - 2011 - Principia: An International Journal of Epistemology 15 (3):453-459.
From closed to open systems.Carlo Cellucci - 1993 - In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Gödel's incompleteness theorems.Raymond M. Smullyan - 1992 - New York: Oxford University Press. Edited by Lou Goble.
Incompleteness in a general setting (vol 13, pg 21, 2007).John L. Bell - 2008 - Bulletin of Symbolic Logic 14 (1):21 - 30.
The gödel paradox and Wittgenstein's reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.

Analytics

Added to PP
2013-11-22

Downloads
219 (#88,969)

6 months
32 (#101,492)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Panu Raatikainen
Tampere University

Citations of this work

Epistemic Modality and Hyperintensionality in Mathematics.Timothy Bowen - 2017 - Dissertation, Arché, University of St Andrews
Hierarchical Propositions.Bruno Whittle - 2017 - Journal of Philosophical Logic 46 (2):215-231.
Why Computer Simulation Cannot Be an End of Thought Experimentation.N. K. Shinod - 2021 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 52 (3):431-453.

View all 14 citations / Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Set theory and the continuum hypothesis.Paul J. Cohen - 1966 - New York,: W. A. Benjamin.
Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
Grundzüge der theoretischen Logik.D. Hilbert & W. Ackermann - 1928 - Annalen der Philosophie Und Philosophischen Kritik 7:157-157.

View all 29 references / Add more references