What the work claims
The completeness theorem claims that first-order logic is complete: all universally true statements are provable. The incompleteness theorems claim that no consistent, sufficiently powerful formal system can decide all arithmetical truths or prove its own consistency. Gödel also claimed that neither the axiom of choice nor the continuum hypothesis can be disproved from Zermelo–Fraenkel set theory, assuming its consistency.
How it was done
Gödel proved the completeness theorem in 1929 as part of his doctoral dissertation under Hans Hahn at the University of Vienna. He published the incompleteness theorems in 1931 using Gödel numbering — a method encoding formal expressions as natural numbers. He constructed a self-referential formula claiming its own unprovability within a given formal system.
What holds up
The completeness theorem holds for first-order logic: every logically valid formula is provable. The incompleteness theorems hold for any consistent, sufficiently powerful formal system capable of expressing basic arithmetic. Gödel’s independence results for the axiom of choice and continuum hypothesis hold assuming Zermelo–Fraenkel set theory is consistent.
What does not
The theorems do not show that mathematics is irrational, incomplete in practice, or doomed to inconsistency. They apply only to formal axiomatic systems satisfying specific technical conditions — not to human reasoning, intuition, or informal proof.
Why it matters beyond the lab
These results constrain automated reasoning, shape the theory of computation, and define the boundary between syntax and semantics. They underpin undecidability in computer science. They do not support mysticism, anti-rationalism, or claims about consciousness — those are misreadings.
Is it worth your time
Yes. The incompleteness theorems set hard limits on what formal systems can achieve. They remain foundational for logic, computing, and philosophy of mathematics. No working mathematician or theoretical computer scientist can ignore them.