4 ms·
1. Gödel encodes statements about number theory into numbers via Gödel numbering: an arithmetic encoding. 2. Thus we can then talk about properties of expressi
by kazinator 3y ago
1. Gödel encodes statements about number theory into numbers via Gödel numbering: an arithmetic encoding.
2. Thus we can then talk about properties of expressions as being properties of number. We can make statements which say things like "X has a proof", "Y can be proven false", "Z has no proof", where X, Y and Z are embedded numbers (literals). These literals themselves are expressed symbolically in a way that is susceptible to Gödel numbering. These entire statements are Gödel-encoded and so have numbers; e.g. the Gödel number of "X has a proof" for some given X is some other number W.
3. A Gödel sentence can be constructed which says that "G cannot be proven true", where G is the Gödel number of that sentence itself: in effect, the sentence says "I cannot be proven". The sentence contains a literal G, or perhaps some expression which calculates G. When the Gödel number of the sentence is calculated, it turns out to be G.
This is a bit like "This sentence is false", but different. It's not a direct contradiction.
"I cannot be proven true" can be taken to be true, without contradiction. The sentence says it has no proof and by golly, none can be found.
That allows us to regard it as true and add it as a new axiom.
That shows that our system wasn't complete; there are truths that can be expressed in its symbols that have to be treated as new postulates.