The compactness of the type space Sₙ(T) under the Stone topology is not a coincidence. Which logical theorem does this topological property directly mirror?
AThe completeness theorem — every consistent theory has a model
BThe compactness theorem — a set of formulas is satisfiable iff every finite subset is satisfiable
CThe Löwenheim-Skolem theorem — theories with infinite models have models of all infinite cardinalities
DThe interpolation theorem — between any two formulas there exists an interpolant
Compactness of Sₙ(T) says that any family of basic open sets [φ_i] with the finite intersection property (every finite subfamily intersects non-trivially) has a common point — a type containing all those formulas. This is exactly the compactness theorem for first-order logic: if every finite subset of a set of formulas is satisfiable, then the whole set is satisfiable. The Stone topology makes this logical theorem visible as a topological property of the space of types.
Question 2 Multiple Choice
A theory T has infinitely many 1-types (S₁(T) is an infinite set). What can you immediately conclude about T?
AT is inconsistent — a consistent complete theory can only have finitely many types
BT is ω-categorical — it has a unique countable model up to isomorphism
CT is not ω-categorical — ω-categorical theories have finitely many n-types for every n
DT has no countable models — infinite type spaces require uncountable models
By the Ryll-Nardzewski theorem (and related results), a complete theory T is ω-categorical if and only if Sₙ(T) is finite for every n. If S₁(T) is infinite, T fails this condition and therefore is not ω-categorical — it has more than one countable model up to isomorphism. The number of types is a direct measure of how many distinct behaviors elements can exhibit, and infinitely many types implies the theory is complex enough to distinguish countably many non-isomorphic countable models.
Question 3 True / False
In the Stone topology on Sₙ(T), the basic open set [φ] — the set of all n-types containing formula φ — is simultaneously open and closed (clopen).
TTrue
FFalse
Answer: True
The complement of [φ] is [¬φ] — the set of types containing ¬φ — which is also a basic open set. So [φ] is open by definition, and its complement [¬φ] is also open, making [φ] closed as well. This clopen structure is characteristic of Stone spaces and reflects the Boolean algebra structure of formulas modulo logical equivalence. It means the topology is totally disconnected: connected components are single points.
Question 4 True / False
A theory with a unique countable model up to isomorphism (ω-categorical) is expected to have infinitely many n-types for sufficiently large n.
TTrue
FFalse
Answer: False
This is precisely backwards. A theory is ω-categorical if and only if Sₙ(T) is finite for every n — the type space is a finite discrete set for each arity. The fewer types a theory has, the more constrained and 'simple' its models are. Infinitely many n-types is characteristic of non-ω-categorical theories with multiple non-isomorphic countable models.
Question 5 Short Answer
Why does the Stone topology turn Sₙ(T) into a compact Hausdorff space, and what logical theorem guarantees compactness?
Think about your answer, then reveal below.
Model answer: The Stone topology on Sₙ(T) is defined by taking sets [φ] = {types containing φ} as a basis. Hausdorff follows immediately: if two types p ≠ q differ on formula φ, then [φ] and [¬φ] are disjoint open neighborhoods separating them. Compactness follows from the compactness theorem for first-order logic: any family of basic open sets with the finite intersection property — meaning every finite sub-collection shares a common type — corresponds to a finitely consistent set of formulas, which by the compactness theorem is fully consistent and therefore realized in some complete type. That complete type is the required common point, establishing compactness of Sₙ(T).
The Stone topology is the machinery that translates logical properties into geometric ones. Compactness in topology and compactness in logic are the same fact expressed in two different languages, and Sₙ(T) is the bridge. Understanding this connection is what opens the door to stability theory's geometric methods.