A logician claims to have written a first-order theory T that uniquely characterizes the real numbers — every model of T is isomorphic to ℝ. What do the Löwenheim-Skolem theorems say about this claim?
AThe claim is achievable if the axioms are sufficiently strong and the theory is complete
BThe claim is impossible — T must have countable models and models of every uncountable cardinality
CThe claim holds as long as T is consistent and has exactly one axiom about cardinality
DThe claim is possible only if T is a finite axiom system
The Löwenheim-Skolem theorems directly refute this claim. The downward theorem gives T a countable model (not isomorphic to ℝ, which is uncountable). The upward theorem gives T models of every infinite cardinality larger than |ℝ|. Since T has models of many different cardinalities, it cannot be categorical. First-order logic lacks the expressive power to pin down infinite cardinality — this is a theorem about the logic itself, independent of how clever or numerous T's axioms are.
Question 2 Multiple Choice
ZFC set theory has a countable model M, yet M contains a set S that M considers uncountable. Which explanation correctly resolves this apparent contradiction?
AM must be inconsistent — a consistent set theory cannot have a countable model
BS is actually finite inside M; 'uncountable' is just M's word for large finite sets
CS is uncountable relative to M because the bijection from S to ℕ does not exist inside M, even though it exists externally
DZFC's proof that uncountable sets exist is flawed and this is evidence of that
This is Skolem's paradox, resolved by recognizing that 'uncountable' is model-relative. M is externally countable (a bijection from M's domain to ℕ exists from outside), but the specific bijection witnessing that S is countable doesn't exist as a function inside M. Since M can only 'see' functions in its own domain, S appears uncountable from M's internal perspective. There is no contradiction — just a relativity of set-theoretic concepts to the model you're working in.
Question 3 True / False
The upward Löwenheim-Skolem theorem implies that any consistent first-order theory with an infinite model has models of arbitrarily large infinite cardinality.
TTrue
FFalse
Answer: True
The upward theorem states: if a theory has an infinite model of cardinality κ, it has models of every infinite cardinality λ ≥ κ. So having any infinite model at all guarantees models of every larger infinite size. Combined with the downward theorem (which provides countable models), the spectrum of model cardinalities is vast in both directions. No first-order theory can be categorical for any infinite structure.
Question 4 True / False
The Löwenheim-Skolem theorems apply to second-order logic just as they do to first-order logic, showing that no formal logic can pin down the cardinality of infinite structures.
TTrue
FFalse
Answer: False
The theorems apply specifically to first-order logic and do not hold for second-order logic. Second-order logic can quantify over sets and functions, not just individuals, which gives it dramatically greater expressive power. Peano's second-order axioms categorically characterize the natural numbers — every model is isomorphic to ℕ. The failure of categorical characterization is a feature of first-order expressivity specifically, not a universal fact about all logics.
Question 5 Short Answer
Explain Skolem's paradox: how can ZFC, which proves uncountable sets exist, itself have a countable model? Is this a contradiction?
Think about your answer, then reveal below.
Model answer: It is not a contradiction. ZFC proves '∃S such that no bijection from S to ℕ exists' — but the quantifier 'there exists a bijection' ranges only over functions inside the model. In a countable model M, a set S exists such that no bijection S → ℕ is an element of M. Externally, such a bijection exists (M itself is countable), but M cannot see it. So S is uncountable from M's internal perspective, and the theorem ZFC proves is true under that internal meaning of 'uncountable.' The resolution is that 'uncountable' is relative to a model, not an absolute fact.
The key insight is that logical quantifiers range only over the current model's domain. 'No bijection exists' means 'no bijection exists in this model.' This relativity of set-theoretic concepts to models is one of the deepest lessons in mathematical logic.