Hi Ladyjane,
“I am shocked! Shocked! I say. To find …†someone attacking a rival’s proof.
Godel’s theorem presently stands even if Godel’s proof is invalid, BECAUSE Peter Smith’s proof, which is totally different than Godel’s proof, is considered valid.
At this point I am torn as to whether or not I should rehash my comments on the Skolem Paradox, but I will try again assuming that there may be other people reading this post.
Skolem’s Paradox says that if axiomized ZFC has a model, then (because ZFC is a first order theory) by the Lowenstein Skolem theorem that model is countable. Since ZFC implies uncountable sets exist, the model must be uncountable.
In order for this paradox to be valid there must be a model for ZFC. More particularily there must be a model for the the axioms of ZFC.
This means that there must be a set from which we can construct , using the approved grammer, the axioms of ZFC; and most importantly (by the definition of model) we are required to prove that these axioms are true.
Even though a couple of axioms of ZFC are in fact theorems, in general they are not. For poetic justice I will asssign you the task of proving that the axiom schema of comprehension is true
.
All of the talk about isomorphisms, countable, and uncountable sets rests on finding this model.
Never say never, but it ain’t gonna happen.