TheoremComplete

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

Theorem4.2Downward Löwenheim-Skolem

Let M\mathcal{M} be an L\mathcal{L}-structure with A⊆MA \subseteq M. Then there exists an elementary substructure N⪯M\mathcal{N} \preceq \mathcal{M} with A⊆NA \subseteq N and ∣N∣≤∣A∣+∣L∣+ℵ0|N| \leq |A| + |\mathcal{L}| + \aleph_0.

Theorem4.3Upward Löwenheim-Skolem

If TT is a consistent L\mathcal{L}-theory with an infinite model, then for every cardinal κ≥∣L∣+ℵ0\kappa \geq |\mathcal{L}| + \aleph_0, TT has a model of cardinality κ\kappa.


Proof Sketch of Downward LS

Proof

Given M\mathcal{M} and A⊆MA \subseteq M, construct a chain A=A0⊆A1⊆A2⊆⋯A = A_0 \subseteq A_1 \subseteq A_2 \subseteq \cdots where at each step, for each L(An)\mathcal{L}(A_n)-formula ∃x φ(x,aˉ)\exists x \, \varphi(x, \bar{a}) true in M\mathcal{M}, add a witness b∈Mb \in M with M⊨φ(b,aˉ)\mathcal{M} \models \varphi(b, \bar{a}). Let N=⋃nAnN = \bigcup_n A_n. Then ∣N∣≤∣A∣+∣L∣+ℵ0|N| \leq |A| + |\mathcal{L}| + \aleph_0 (adding ≤∣L∣+ℵ0\leq |\mathcal{L}| + \aleph_0 witnesses at each step, ω\omega steps). The substructure N\mathcal{N} with domain NN satisfies N⪯M\mathcal{N} \preceq \mathcal{M} by the Tarski-Vaught test: every existential statement true in M\mathcal{M} about elements of NN has a witness in NN. □\square

■

Consequences

ExampleSkolem's Paradox

ZFC (if consistent) has a countable model M\mathcal{M} by the downward Löwenheim-Skolem theorem. Yet M⊨\mathcal{M} \models "there exist uncountable sets." The resolution: "uncountable" in M\mathcal{M} means there is no bijection within M\mathcal{M} from the set to ωM\omega^{\mathcal{M}}, not that the set is genuinely uncountable from outside.

RemarkCategoricity and Counting Models

A theory TT is κ\kappa-categorical if it has exactly one model (up to isomorphism) of cardinality κ\kappa. 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 TT is κ\kappa-categorical for some uncountable κ\kappa, then TT is κ\kappa-categorical for all uncountable κ\kappa.