A type p(x) over a complete theory T is principal. Which of the following best explains why the Omitting Types Theorem cannot guarantee a model that omits p?
APrincipal types contain infinitely many formulas, making them too large to omit
BA formula φ isolates p, so any model satisfying ∃x φ(x) is forced to realize every formula in p
CThe Omitting Types Theorem only applies to uncountable theories
DPrincipal types are always realized in atomic models, but can be omitted in non-atomic ones
Principality means p is isolated by a single formula φ: every formula in p is entailed by T + ∃x φ(x). This means any model containing an element satisfying φ must realize p — there is no formula 'extending' a formula consistent with ∃x φ(x) that avoids realizing p. The density condition used in the Henkin proof fails for principal types: you cannot always find a refinement that dodges the type. Non-principality is exactly the hypothesis needed to keep the construction going.
Question 2 Multiple Choice
In the Henkin construction proof of the Omitting Types Theorem, what role does non-principality play?
AIt ensures the model built is always uncountable
BIt guarantees the density condition: for any formula ψ consistent with T, there exists an extension ψ' that avoids committing to realizing each type p_i
CIt allows the completeness theorem to apply directly without modification
DIt ensures every formula in each type p_i is independent of T
The density condition is the heart of the proof: for each formula ψ consistent with T and each non-principal type p_i, there must exist a formula ψ' extending ψ (still consistent with T) that does not commit to realizing p_i. Non-principality guarantees this is always possible — no single formula forces all of p_i, so you can always find a refinement that blocks realization. This is done countably many times (for each type and each formula), which is why countability of the language and the family of types is required.
Question 3 True / False
The Omitting Types Theorem applies to any consistent theory, regardless of whether its language is countable.
TTrue
FFalse
Answer: False
Countability is a genuine requirement. The theorem states: for a complete consistent theory in a *countable* language, a countable family of non-principal types can be simultaneously omitted in a countable model. The proof is a Henkin construction that proceeds in countably many steps; an uncountable language would require uncountably many decisions that cannot all be handled in ω steps. For uncountable languages or uncountably many types, the theorem fails in general.
Question 4 True / False
If a type p over a complete countable theory T cannot be omitted in any model of T, then p must be principal.
TTrue
FFalse
Answer: True
This is the contrapositive of the Omitting Types Theorem. The theorem states: if p is non-principal, then there exists a countable model of T omitting p. Taking the contrapositive: if no model of T omits p (i.e., p is realized in every model of T), then p cannot be non-principal — it must be principal. A principal type, isolated by some formula φ, is indeed realized in every model satisfying ∃x φ(x), confirming the converse direction.
Question 5 Short Answer
Why do both the countability of the language and the countability of the family of types matter for the Omitting Types Theorem? What would go wrong without these conditions?
Think about your answer, then reveal below.
Model answer: The proof runs a Henkin construction in countably many (ω) steps, at each step extending the diagram by one formula while ensuring no type is forced. With a countable language, there are only countably many formulas to handle — each can be addressed at some finite stage. With a countable family of non-principal types, the density condition can be applied for each type at each step. If either condition fails, the bookkeeping exceeds ω steps and the construction breaks down: you cannot complete all obligations in the required order.
Countability is not merely a technical convenience — it is constitutive of the proof method. The Henkin construction is fundamentally a step-by-step process that works through all formulas in a countable enumeration. Adding uncountably many types or an uncountable language would require uncountably many density-condition applications that cannot be organized into a single ω-sequence.