Do the incompleteness theorems say mathematics is inconsistent?

No. They say that any single consistent and sufficiently strong formal system is incomplete and cannot certify its own consistency. They place no doubt on the truth of mathematics, only on the reach of any one axiomatic system.

Does incompleteness mean some truths are unknowable?

Not in an absolute sense. A sentence unprovable in one theory may be provable in a stronger one, for instance by adding a consistency statement or a stronger axiom. Incompleteness is a limitation of each fixed system, not a barrier to mathematical knowledge overall.

Goedel's Incompleteness Theorems

Goedel's incompleteness theorems establish that any consistent formal theory capable of expressing elementary arithmetic is incomplete and cannot prove its own consistency, setting fundamental limits on the axiomatic method.

Definition

The first incompleteness theorem states that any consistent, effectively axiomatized theory that interprets a modest fragment of arithmetic has a sentence neither it nor its negation can prove; the second states that such a theory cannot prove a formal statement asserting its own consistency.

Scope

This topic covers the arithmetization of syntax and Goedel numbering, the diagonal lemma and the construction of a self-referential sentence, the first incompleteness theorem on the existence of true unprovable sentences, the second incompleteness theorem on unprovability of consistency, and the standard conditions and consequences such as Tarski's theorem on the undefinability of truth.

Core questions

How is the syntax of a theory encoded within arithmetic itself?
How does the diagonal lemma produce a sentence asserting its own unprovability?
Why must a sufficiently strong consistent theory be incomplete?
Why can such a theory not prove its own consistency?

Key theories

Diagonal lemma: For any formula with one free variable there is a sentence that the theory proves to be equivalent to that formula applied to the sentence's own code, enabling controlled self-reference.
First incompleteness theorem: Applying the diagonal lemma to the provability predicate yields a sentence that is true exactly when unprovable, so a consistent effectively axiomatized arithmetic theory has a sentence it can neither prove nor refute.
Second incompleteness theorem: Formalizing the proof of the first theorem within the theory shows that the theory proves its own consistency only if it is inconsistent, so a consistent theory cannot establish its own consistency.

Clinical relevance

The incompleteness theorems reshaped the foundations of mathematics by showing that no single consistent formal system can settle every arithmetical question or certify its own reliability, which bounds Hilbert's programme and motivates ordinal-theoretic measures of theoretical strength and the study of relative consistency.

History

Goedel announced the incompleteness theorems in 1930 and published them in 1931, overturning the expectation that arithmetic could be completely and self-certifiably axiomatized. Rosser strengthened the hypotheses in 1936, and Tarski's contemporaneous theorem on the undefinability of truth gave a closely related limitative result.

Key figures

Kurt Goedel
Alfred Tarski
J. Barkley Rosser
David Hilbert

Seminal works

smith2013
godel1931
boolos2007

Frequently asked questions

Do the incompleteness theorems say mathematics is inconsistent?: No. They say that any single consistent and sufficiently strong formal system is incomplete and cannot certify its own consistency. They place no doubt on the truth of mathematics, only on the reach of any one axiomatic system.
Does incompleteness mean some truths are unknowable?: Not in an absolute sense. A sentence unprovable in one theory may be provable in a stronger one, for instance by adding a consistency statement or a stronger axiom. Incompleteness is a limitation of each fixed system, not a barrier to mathematical knowledge overall.