A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Categorical Theories and Uniqueness of Models

Research Depth 93 in the knowledge graph ☐ I know this ☆ Set as goal
17topics build on this
578prerequisites beneath it
See this on the map →
Elementary Equivalence and Logical IndistinguishabilityUpward Löwenheim-Skolem Theorem+2 more→→Morley's Theorem on Uncountable Categoricity
κ-categorical categoricity spectrum uniqueness rigid theory

Core Idea

A complete theory T is κ-categorical if it has exactly one model of cardinality κ up to isomorphism. Categoricity captures that T completely determines model structure at a specific size. The spectrum of cardinalities where a theory is categorical is highly constrained: Morley proved surprising rigidity—if T is categorical in some uncountable κ, it is categorical in all uncountable cardinalities.

Explainer

From your study of elementary equivalence, you know that two structures can satisfy exactly the same first-order sentences without being isomorphic—think of (ℕ, <) and a non-standard model of arithmetic that agrees with ℕ on every first-order sentence yet contains infinite elements. κ-categoricity asks whether there is a cardinality κ at which the theory rules out any such structural variation: if T is κ-categorical, any two models of T with cardinality κ are isomorphic. The theory determines the model uniquely at that size.

The canonical example is DLO, the theory of dense linear orders without endpoints—the first-order theory of (ℚ, <). This theory is ℵ₀-categorical: every countable dense linear order without endpoints is isomorphic to ℚ. The proof uses a back-and-forth argument, building an isomorphism incrementally by alternately extending it to cover one new element from each structure. Density and the absence of endpoints ensure you can always find an appropriate match. However, DLO is not κ-categorical for any uncountable κ: uncountable dense linear orders can differ in cofinality and whether they are Dedekind complete, producing genuinely non-isomorphic models of the same size.

Morley's theorem (1965) reveals a striking rigidity for uncountable categoricity: if a complete theory T in a countable language is categorical in *any* uncountable cardinality, it is categorical in *all* uncountable cardinalities. This was unexpected because uncountable cardinals are wildly diverse in size. The explanation lies in structural properties the theory must possess: it must be totally transcendental, must have a well-behaved notion of algebraic independence (generalizing linear independence in vector spaces), and models must be characterized entirely by a single "dimension." The theory of algebraically closed fields of fixed characteristic illustrates this: it is categorical in every uncountable cardinality (and also ℵ₁-categorical, since the algebraic closure of ℚ is countable while uncountable algebraically closed fields of characteristic 0 all look alike at each uncountable size).

Categoricity is ultimately a measure of how tightly a theory pins down structure. A κ-categorical theory leaves no freedom at cardinality κ—it is, in a precise sense, complete about models of that size. Non-categorical theories have multiple non-isomorphic models of the same infinite size, meaning the theory is "weaker" and cannot distinguish between structurally different possibilities. The spectrum of theories ranging from categorical to maximally non-categorical is a central organizing theme of modern model theory, and Morley's theorem is the founding result of that classification program.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Satisfiability and Unsatisfiability → Consistency and Inconsistency of Theories → Consistency and Inconsistency → Basic Model Theory → Compactness Theorem in Model Theory → Löwenheim-Skolem Theorems: Overview and Unification → Upward Löwenheim-Skolem Theorem → Categorical Theories and Uniqueness of Models

Longest path: 94 steps · 578 total prerequisite topics

Prerequisites (4)

Leads To (1)