View source for Skolem's Paradox

The '''Skolem paradox''' is the apparent contradiction that [[Set Theory|set theory]], a theory intended to describe uncountable infinities, has countable models. First proved by Thoralf Skolem in 1922 as a corollary of the [[Löwenheim-Skolem theorem|Löwenheim-Skolem theorem]], the "paradox" is not a genuine logical contradiction but a demonstration of the gap between what a theory says and what its models look like.

The paradox arises because first-order logic cannot distinguish between countable and uncountable domains. A model of set theory may contain a set that the model "thinks" is uncountable — because there is no bijection within the model between that set and the natural numbers — even though, from an external perspective, the model itself is countable and so is every set it contains.

The Skolem paradox is therefore a lesson in [[Model Theory|model theory]]: axioms underdetermine their intended interpretation. It also suggests that the [[Von Neumann Universe|von Neumann universe]] of all sets is not capturable in first-order terms, and that any attempt to formalize set theory necessarily involves a choice between expressive power and categorical determination.

''The Skolem paradox is not a paradox. It is a diagnosis. It tells us that when we say "uncountable," we are not describing a property of sets but a property of the language we use to talk about them. The uncountable is not a feature of mathematical reality. It is a feature of first-order logic's blindness.''

[[Category:Mathematics]]
[[Category:Logic]]
[[Category:Foundations]]