Is this a good way to explain Skolem's Paradox?

[mpitluk]

"The paradox: Let T be a standard first-order formulation of ZFC. Assume T has a model. By Skolem's Theorem, T has a countable model M. Since T ⊢ ∃A(A is uncountable), M ⊨ ∃A(A is uncountable). But how can M—i.e. a model that “sees” only countably many things in the universe—“say” some sets contain uncountably many elements? How can M account for all the “extra” members of A? It can’t. According to M, A can be at most countable as there are only countably many “things” available (in the domain of M) to be in A. So A paradoxically looks countable and uncountable."

Is there anything WRONG? UNECESSARY? MISSING?

Or, is there a simpler way to put it, so that a 10 year old could understand it?

Gracias.

 

[Hurkyl]

I like to use colors. Countable[/color] is a property of set[/color]s in the set-theoretic universe in which we've formulated logic. It means there is a function[/color] that provides a bijection[/color] from the set[/color] to the natural numbers[/color].

Countable[/color] is a property of set[/color]s in the theory T. It means there is a function[/color] that provides a bijection[/color] from the set[/color] to the natural numbers[/color].

Countable[/color] is a property of set[/color]s in a model of T. It means there is a function[/color] that provides a bijection[/color] from the set[/color] to the natural numbers[/color].

We can assume the model is regular, so that every set[/color] is a set[/color]. Countable[/color] is, of course, the interpretation of countable[/color] in the model.

Continuing with the assumption, every function[/color] between sets[/color] is also a function[/color]. But the reverse might not be true.

So, a set can be countable[/color] without being countable[/color].

 

[spoirier]

After this explanation by Hurkyl (that is rigorously correct), we may ask further questions : how is it possible that a function between given sets in the model, may exist outside the model but not inside it ? The theory gives a name to the set of all functions between given sets (say the set of functions from E to F is named F^E), but this name may have different interpretations between models.
In each model this name means the set of all functions from E to F that exist inside this model, so that they are in this set whenever they are in this model; but it cannot exclude the existence of such functions ouside the model (that do not coincide with any function inside).
This sort of incompleteness is a specific character of the powerset, that does not happen for some other constructions of sets (union, image of a function, subset defined by formulas with bounded quantifiers).
I have explained this difference and other paradoxical aspects of the foundations of mathematics in my web site.