News for hackers. Stuff that matters.
Re:New Foundations is consistent – a difficult mathematical ... by randallholmes on Thursday April 25, 2024 @06:51PM (#40164053)
You don't work around what is impossible. A consistency proof for a theory T is usually a construction of a model of that theory in some context we have confidence in. Godel's theorem shows that that context has to be stronger than T. This isn't some kind of obstruction, it is reality. And there are strong systems we have confidence in.
Re:New Foundations is consistent – a difficult mathematical ... by lmm on Thursday April 25, 2024 @07:30PM (#40164321)
> Godel's theorem shows that that context has to be stronger than T. This isn't some kind of obstruction, it is reality.

What distinction are you drawing? I see no contradiction between something being reality and something being an obstruction to be worked around.