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

Spectrum of a Theory and Vaught's Conjecture

Research Depth 96 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
588prerequisites beneath it
See this on the map →
Complete First-Order TheoriesLöwenheim-Skolem Theorems: Overview and Unification+1 more→→Vaught's Theorem on Number of Countable Models
spectrum model-count vaught-conjecture

Core Idea

The spectrum I(κ, T) of a theory T counts the number of non-isomorphic models of T of cardinality κ. Vaught's conjecture (still open) states that for countable theories, I(ℵ₀, T) is either countable or ℵ₁. The spectrum determines much about the theory: stable theories have controlled spectrum growing polynomially, while unstable theories can have wild spectra.

How It's Best Learned

Compute spectrum for simple theories: the theory of dense linear orders has I(ℵ₀, T) = 1. Study how spectrum changes under theory extensions.

Explainer

You know from the Löwenheim-Skolem theorems that a complete first-order theory with an infinite model has models of every infinite cardinality. This raises a finer question: how many non-isomorphic models does the theory have of each cardinality? The answer, encoded in the spectrum I(κ, T), turns out to be a remarkably sensitive invariant of the theory — a kind of fingerprint that reflects its logical complexity.

The spectrum function I(κ, T) counts non-isomorphic models of T of cardinality κ. For a given uncountable cardinal κ, the possible values of I(κ, T) are severely constrained: it must be 0 (no model of that size), 1 (exactly one up to isomorphism — categoricity), or 2^κ (the maximum). These are the only possibilities for uncountable cardinals — there is no middle ground. Morley's theorem (a landmark result in model theory) shows that if T is categorical in some uncountable cardinal, it is categorical in all uncountable cardinals. This "all or nothing" behavior at uncountable cardinals has no analogue at ℵ₀.

The countable case is far richer and more mysterious. I(ℵ₀, T) — the number of countable models up to isomorphism — can be 1, n (for small n), ℵ₀, or 2^ℵ₀. Vaught's conjecture (1961, still open) asserts it cannot be exactly ℵ₁ — the number of countable models of a complete countable theory is either at most ℵ₀ or exactly 2^ℵ₀. The conjecture has been verified for many special classes of theories (ω-stable theories, certain expansions of linear orders), but the general case remains one of the deepest open problems in mathematical logic. The conjecture is striking because ℵ₁ is the "obvious" intermediate value between ℵ₀ and 2^ℵ₀, and the conjecture says this obvious value is forbidden.

The spectrum connects to stability theory: a theory is stable if, roughly, its models do not have too many types. Stable theories have tightly controlled spectra — at uncountable cardinals the number of models is bounded by a polynomial in the cardinal's cofinality. Unstable theories can have spectrum I(κ, T) = 2^κ at many cardinals, the maximum. Stability is not just a counting statement — it reflects deep combinatorial properties of the models (order properties, definability of types, existence of prime models). The spectrum is thus the observable output of a much richer theory about how models of a theory can differ from one another.

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 → Morley's Theorem on Uncountable Categoricity → Indiscernible Sequences and Morley's Categoricity Theorem → Spectrum of a Theory and Vaught's Conjecture

Longest path: 97 steps · 588 total prerequisite topics

Prerequisites (3)

Leads To (1)