4 ms·
They are pretty close to a 1:1 mapping http://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems#Relation_to_the_liar_paradox http://en.wikipedia.org
by dejb 17y ago
They are pretty close to a 1:1 mapping
http://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems#Relation_to_the_liar_paradox http://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_t...
'The analysis of the truth and provability of G is a formalized version of the analysis of the truth of the liar sentence.'
- anatoly 17y agoThis is only approximately true. What really is a straightforward formalized version of the liar paradox is Tarski's undefinability theorem, which is what's demonstrated in the blogpost. Goedel's incompleteness sentence is more like inspired by the liar sentence rather than being its formalization; and the proof of Goedel's incompleteness is much more challenging than the simple true->false->true bounce of the liar paradox.