At its core, Gödel’s Incompleteness Theorems (1931) prove that there are inherent limits to what can be achieved using a formal system of logic (like a set of mathematical axioms).
There are two theorems.
1. The First Incompleteness Theorem
The Claim: In any consistent formal system that is powerful enough to do basic arithmetic, there will always be statements that are true, but unprovable within that system.
How it works (The Logic):
Gödel used a technique called “Gödel Numbering” to let mathematics talk about itself. He essentially created a mathematical version of the “Liar’s Paradox” (“This sentence is false”).
He constructed a statement that effectively says:
“This statement cannot be proven using the rules of this system.”
- If the system proves the statement, the statement is false (because it said it couldn’t be proven). This means the system is inconsistent (it proves false things).
- If the system cannot prove the statement, the statement is true (because it accurately claimed it couldn’t be proven). This means the system is incomplete.
Assuming we want our math to be consistent (not proving lies), we must accept that it is incomplete.
2. The Second Incompleteness Theorem
The Claim: A consistent system cannot prove its own consistency.
The Practicality:
If you have a set of axioms, you cannot use those same axioms to prove that they will never lead to a contradiction. To prove a system is consistent, you need a stronger system (more axioms), but then that stronger system cannot prove its own consistency, and so on.
Why it matters (The Operational Reality)
Before Gödel, mathematicians (led by David Hilbert) believed that math could be “completed”—that we could find a finite set of axioms from which every single mathematical truth could be derived.
Gödel proved this is impossible.
The Trade-off:
- Provability ≠ Truth. Truth is a larger category than provability.
- Formalism has a ceiling. No matter how many rules or axioms you add to a system to “fix” the holes, the act of adding those rules creates new true statements that are still unprovable. You can never “close the loop.”
Liar’s Paradox
The Liar’s Paradox is a classic problem in logic and philosophy that arises from self-reference. It occurs when a statement refers to itself in a way that makes it impossible for the statement to be either true or false.
The simplest version is the sentence:
“This sentence is false.”
The Logic Loop
If you try to assign a truth value to that sentence, you hit an infinite contradiction:
- Assume the sentence is TRUE: If it is true, then what it says must be accurate. It says it is false. Therefore, it must be FALSE.
- Assume the sentence is FALSE: If it is false, then the claim “this sentence is false” is a lie. The opposite of “false” is true. Therefore, it must be TRUE.
No matter which side you start on, you are immediately forced into the opposite conclusion. It is a circular dependency where the output of the logic is the negation of the input.
Why it’s a problem for Logic
In classical logic, we rely on the Law of Bivalence: every statement must be either true or false. The Liar’s Paradox breaks this law.
Connection to Gödel (The “Practical” Version)
As mentioned in the previous explanation of Gödel’s Theorem, Kurt Gödel didn’t use a “flat” paradox like this (because “True” and “False” are concepts, not mathematical proofs). Instead, he shifted the paradox from Truth to Provability.
- Liar’s Paradox: “This statement is false.” (Logical deadlock)
- Gödel’s Statement: “This statement is unprovable.” (Logical gap)
By changing “false” to “unprovable,” Gödel avoided the simple deadlock and instead proved that there is a gap between what is True and what can be Proven.
