|
|
|
|
|
by OmegaHN
5097 days ago
|
|
Eh, this doesn't really explain Godel's 2nd Incompleteness theorem; it only describes it in a roundabout way. The entire piece could be shortened down to: in math, all false statements are possible (i.e. their impossibility cannot be proved), and it doesn't go into any reasoning behind it. I'm not sure about Godel's 2nd, but his 1st theorem can be described and explained with one simple sentence: this statement cannot be proven. If it is proven, then a false statement is proven. If it cannot be proven, then the proving system is flawed. |
|
But I like your explanations too.
However, I think that the Goedel card is counter-played well by the Schrodinger one. "This statement cannot be proven" is only a false statement because you inspect it with your system. It might otherwise be completely true.