[1] https://inference-review.com/article/loebs-theorem-and-curry...
It seems like most expositions of Gödel's incompleteness theorem go into a surprising amount of detail about Gödel numbering. In a way it's nice though, because you see that the proof is actually pretty elementary and doesn't require fancy math as a prerequisite.
- It can't be false, because if it's false then it is provable, and 'provable' means ' can be proven to be true.' That would be a contraction.
- So therefore it must be true, implying that it can't be proven. Consequently there are statements that are true but unprovable, even just within the axioms of arithmetic.
This is Gödel's incompleteness theorem in a nutshell. Most of the proof is spent developing machinery for doing logic, talking about provability, and ultimately getting a statement to refer to itself all using integers and their properties. It's quite satisfying because it doesn't require any super-advanced math, and yet the result is very deep.
The catch is that when we proved that the sentence is not false, we used proof by contradiction, and for proof by contradiction to be a valid method of proof, we need to assume that the axioms we are working with are consistent (and therefore can't produce a contradiction). So really all we have proved is that either:
- the sentence is true
Or
- the axioms of arithmetic are inconsistent
We can't prove that the axioms of arithmetic are consistent, so we haven't actually proven that the sentence is true. Contradiction avoided.
This issue is actually a major part of Gödel's theorem; we can only avoid a paradox of the axioms of arithmetic can't prove their own consistency. These theorems apply to any system of axioms that are rich enough to state the liar's paradox.