Consider the type p(x) = {x > 0, x > 1, x > 2, x > 3, …} in Peano arithmetic — the type of an element larger than every standard natural number. Which claim is correct?
AThis type is inconsistent with PA, because the axioms imply no element can exceed every natural number
BThis type is consistent (every finite subset is satisfied in ℕ by some large standard number) but omitted by the standard model ℕ; a nonstandard model of PA realizes it
CThis type is realized in ℕ because infinity (ω) is an element of the standard model
DThis type is isolated by the formula 'x is infinite,' so the Omitting Types Theorem guarantees it cannot be omitted from any model
Every finite subset {x > 0, …, x > n} is satisfied in ℕ — just take any k > n. So the type is finitely satisfiable and hence consistent with PA. But ℕ has no element that simultaneously exceeds every natural number, so ℕ omits the type. Nonstandard models contain 'infinite' elements that do realize it. This illustrates the central gap: consistency (no finite contradiction) does not guarantee realization in every model.
Question 2 Multiple Choice
A κ-saturated model is best characterized as:
AA model with exactly κ elements satisfying every sentence of the theory
BA model that realizes every type over every parameter set of cardinality less than κ that is consistent with the theory — making it maximally 'rich' in witnesses
CA model in which every definable set has cardinality at most κ
DA model with κ many automorphisms, reflecting internal symmetry
κ-saturation is a maximality condition on type realization: the model contains a witness for every consistent description of an element using fewer than κ parameters. Saturated models are 'rich' in the sense that nothing consistent is missing. This richness has structural consequences: any two saturated models of the same complete theory of the same cardinality are isomorphic, and automorphisms can be built by back-and-forth arguments extending finite partial maps.
Question 3 True / False
A type can be consistent with a complete theory T and yet be omitted by some model of T — the same type may be realized in one model of T and absent from another model of T.
TTrue
FFalse
Answer: True
This is the central insight of type realization and omission. Completeness of T means T decides every sentence — there is no sentence left undetermined. But it does not mean all models are isomorphic (that would be categoricity, a much stronger property). The standard model ℕ and a nonstandard model both satisfy the complete theory of PA, yet they realize different types. Two models of the same complete theory can differ profoundly in which types they contain.
Question 4 True / False
If a theory T is complete, then most models of T realize exactly the same types, since completeness ensures most models are structurally identical.
TTrue
FFalse
Answer: False
Completeness means T decides every sentence — for every sentence φ, either φ ∈ T or ¬φ ∈ T. It does not imply categoricity (all models isomorphic). The theory PA is complete (for first-order logic, with Gödel incompleteness aside) yet has both the standard model ℕ and many nonstandard models, which realize different types. Type realization is precisely what distinguishes models of the same complete theory from one another.
Question 5 Short Answer
What is the significance of the distinction between a type being 'consistent' and a type being 'realized'? Use a concrete example to illustrate why the gap matters.
Think about your answer, then reveal below.
Model answer: A type p(x) is consistent if every finite subset of p is satisfiable — there is no logical contradiction in p. It is realized in M if there is a single element a ∈ M satisfying all formulas in p simultaneously. The gap between these notions is the gap between logical possibility and actual instantiation. Example: the type {x > n : n ∈ ℕ} in PA is consistent — for any finite subset {x > 0, …, x > k}, any standard number larger than k witnesses it. But the standard model ℕ omits this type: no single standard natural number exceeds every other. A nonstandard model realizes it with an 'infinite' element. This gap matters because it shows that models of the same theory can differ radically in their elements, and gives the Omitting Types Theorem its content: a non-isolated type can be deliberately excluded from a countable model, allowing precise construction of 'thin' models with prescribed absences.
The consistency-realization gap is one of model theory's most important distinctions. It underlies the entire study of saturation, omission, and the diversity of models of a fixed theory.