u***************r
发帖数: 11227 | 1 【 在 blaze (blaze) 的大作中提到: 】
I don't see how this article explains any of Godel's
Incompleteness Theorem (GIT for short). GIT has
nothing to do with cardinality of N, Q and R.
GIT says that there exists true but unprovable "first-order
logic" (or predicate logic) sentences in the structure
(N,0,S,+,*), where N is set of natural numbers, 0 is zero,
S is successor function, + and * are addition and multiplication.
This unprovable sentence just says something like "I am unprovable."
The contributi |
