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 moreVaught'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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSatisfiability and UnsatisfiabilityConsistency and Inconsistency of TheoriesConsistency and InconsistencyBasic Model TheoryCompactness Theorem in Model TheoryLöwenheim-Skolem Theorems: Overview and UnificationUpward Löwenheim-Skolem TheoremCategorical Theories and Uniqueness of ModelsMorley's Theorem on Uncountable CategoricityIndiscernible Sequences and Morley's Categoricity TheoremSpectrum of a Theory and Vaught's Conjecture

Longest path: 97 steps · 588 total prerequisite topics

Prerequisites (3)

Leads To (1)