The consistent sentences with no computable models.
To do it that way, you would need a consistent sentence that implies Peano Arithmetic. Do you know of such a thing?
-
-
Tennenbaum's Theorem only requires a finitely axiomatizable fragment of PA to go through.
-
(That is, it requires only finitely many instances of the induction schema.)
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.