A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
The set Sₙ(T) of all n-types over a complete theory T forms a topological space under the Stone topology, where basic open sets are defined by formulas. This space is compact and Hausdorff. The topology reveals hidden geometric structure in the theory: connected components and dimension measures of complexity that are central to stability theory.
You already know that an n-type over a theory T is a maximal consistent set of formulas in n free variables — a complete description of how a tuple (a₁,…,aₙ) could behave in any model of T. There are potentially very many n-types, and the set Sₙ(T) of all complete n-types is the raw material. The question is: is there any useful structure on this set, or is it just a large collection of maximal consistent sets? The Stone topology gives Sₙ(T) the structure of a compact Hausdorff topological space.
The Stone topology is defined by taking as basic open sets the sets of the form [φ] = {p ∈ Sₙ(T) : φ ∈ p} — the set of all n-types containing the formula φ. These sets are simultaneously open *and* closed (clopen), because [¬φ] is the complement of [φ]. The topology is called the Stone topology because it mirrors the Stone representation theorem for Boolean algebras: the Boolean algebra of formulas modulo T-provable equivalence is represented topologically by its ultrafilters, which are exactly the complete types. The compactness of Sₙ(T) is not a coincidence — it is a direct translation of the compactness theorem for first-order logic: any family of formulas with the finite intersection property (every finite subset is consistent) has a point in the intersection, which is exactly compactness.
The Hausdorff condition says any two distinct types can be separated by open sets, which is easy: if p ≠ q, then there is some formula φ with φ ∈ p but φ ∉ q, and [φ] and [¬φ] are disjoint open neighborhoods. More interesting is what the topology tells you about the *complexity* of a theory. A theory T is ω-categorical (has a unique countable model up to isomorphism) if and only if Sₙ(T) is finite for every n — that is, the type space is a discrete finite set. The fewer types a theory has, the more constrained its models are.
Stability theory uses the cardinality of type spaces as its central complexity measure. A theory is stable if for every cardinal κ, the number of types over a set of parameters of size κ does not exceed κ. In topological terms, stability restricts how "large" the type spaces can be as you vary parameters. An unstable theory has a formula that orders elements (or something order-like), which forces the type space to be as large as possible. The Stone topology thus turns the combinatorial question "how many types are there?" into a geometric question about the structure of a compact topological space, opening the door to the powerful geometric methods of modern stability and classification theory.