3 ms·
Undecidability basically guarantees the existence of arbitrarily hard to prove but easy to state theorems.
by danharaj 9y ago
Undecidability basically guarantees the existence of arbitrarily hard to prove but easy to state theorems.
- posterboy 9y agoWhy is the completeness theorem never mentioned in this context? FOL is decidable! And as far as I can see, RH is in FOL.