News for hackers. Stuff that matters.
Re:New math book rescues landmark topology proof by moomin on Friday September 10, 2021 @02:43AM (#28478459)
For those interested:

Assume a formal language that can model the natural numbers.

Consider the set of all provable statements. This is countable because it’s a subset of the list of strings of a finite number of characters, which is countable.

Consider the statement “Statement N is false”. This is both a valid statement and cannot appear in the list.

Godel proved significantly more than that, but that’s the basic result. It’s basically the same as the diagonal argument of real numbers being uncountable and it’s also basically the halting problem.

Re:New math book rescues landmark topology proof by harmoat on Friday September 10, 2021 @03:43AM (#28478781)
Since these 3 results are so similar are they a subset of a more general concept?
Re:New math book rescues landmark topology proof by moomin on Monday September 13, 2021 @07:21AM (#28510068)
Arguably the halting problem is just a subset of Godel where every theorem is "This does or does not halt". Someone's written a paper going the other way: https://www.andrew.cmu.edu/user/avigad/Teaching/halting.pdf

The crucial trick is that you can plug in an entry as data to another "program/theorem". This is extremely interesting, because there are limited logics and limited computation models where Godel and the Halting Problem do not apply.

Not so sure about the diagonal argument.