Löwenheim-Skolem Theorems
The Löwenheim-Skolem theorems address the cardinality of models of first-order theories. They show that first-order logic cannot control the size of its models, a phenomenon known as the "Skolem paradox."
Statements
Let be an -structure with . Then there exists an elementary substructure with and .
If is a consistent -theory with an infinite model, then for every cardinal , has a model of cardinality .
Proof Sketch of Downward LS
Given and , construct a chain where at each step, for each -formula true in , add a witness with . Let . Then (adding witnesses at each step, steps). The substructure with domain satisfies by the Tarski-Vaught test: every existential statement true in about elements of has a witness in .
Consequences
ZFC (if consistent) has a countable model by the downward Löwenheim-Skolem theorem. Yet "there exist uncountable sets." The resolution: "uncountable" in means there is no bijection within from the set to , not that the set is genuinely uncountable from outside.
A theory is -categorical if it has exactly one model (up to isomorphism) of cardinality . The Löwenheim-Skolem theorems show that a first-order theory with an infinite model cannot be categorical in all cardinalities. Morley's theorem states that if is -categorical for some uncountable , then is -categorical for all uncountable .