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

Consistency Strength and the Large-Cardinal Hierarchy

Graduate Depth 93 in the knowledge graph I know this Set as goal
2topics build on this
585prerequisites beneath it
See this on the map →
Introduction to Large CardinalsMeasurable Cardinals and Ultrafilters+2 moreInner Models and Relative Consistency Proofs
consistency-strength large-cardinals hierarchy provability

Core Idea

Large cardinals are ordered by consistency strength: the existence of an inaccessible is consistent with ZFC but strictly stronger than ZFC; the existence of a measurable is strictly stronger than inaccessible; supercompacts are stronger still. This hierarchy is studied via inner models and reflection principles. Consistency strength provides a refined notion of 'how much you add' when extending ZFC.

How It's Best Learned

Introduce the Veblen hierarchy of inaccessible, measurable, supercompact, and extendible cardinals. Show consistency of large-cardinal axioms is unprovable in ZFC by Gödel's incompleteness. Use inner-model theory (L, HOD, V) to compare consistency strengths.

Common Misconceptions

Explainer

You know from studying large cardinals that certain cardinals — inaccessible, measurable, supercompact — are so large that their existence cannot be proved from ZFC alone. Each such axiom extends the standard axioms of set theory. Consistency strength is the tool for comparing how much is added by each extension. One theory T₁ has lower consistency strength than T₂ if: whenever T₂ is consistent, so is T₁ — but not necessarily conversely. Equivalently, T₂ proves that T₁ is consistent, but T₁ cannot prove T₂ is consistent. This defines a preorder (actually a linear order, empirically) on large-cardinal axioms: each stronger axiom implies the consistency of all weaker ones.

The hierarchy begins just above ZFC. An inaccessible cardinal κ is a regular strong limit cardinal — no smaller set of sets of size less than κ can reach κ by taking power sets or unions. If κ is inaccessible, then V_κ (the universe of all sets of rank below κ) is a model of ZFC. So the existence of an inaccessible implies ZFC is consistent — which by Gödel's incompleteness theorem means this assumption cannot be proved within ZFC itself. A measurable cardinal is strictly stronger: its existence implies not only that inaccessibles exist but that there are inaccessibly many inaccessibles, and far beyond. Above measurables lie Woodin cardinals, supercompact cardinals, and extendible cardinals, each implying the consistency of all smaller large-cardinal axioms.

Gödel's incompleteness theorems are what give the consistency hierarchy its teeth. No consistent theory extending PA (and therefore ZFC) can prove its own consistency. So if ZFC + "a measurable cardinal exists" is consistent, ZFC alone cannot prove this. The existence of any large cardinal is a genuine new assumption — not a theorem. Set theorists therefore calibrate the strength of mathematical claims by asking: "over which large-cardinal axiom is this provable?" A statement that requires measurables to prove is intrinsically stronger than one requiring only inaccessibles. This gives a precise meaning to the informal notion that some mathematical claims are "bolder" than others.

Inner model theory is the primary technical instrument for comparing consistency strengths. For each large-cardinal level, set theorists construct canonical inner models — structures like L[μ] for one measurable or L[E] for extenders — that contain exactly the large cardinals needed and no more. Two theories have the same consistency strength if and only if their canonical inner models are the same. The remarkable empirical fact is that virtually all natural mathematical theories fall into this linear hierarchy: every "natural" set-theoretic statement is equiconsistent with some large-cardinal axiom. This linearity was not logically inevitable, but it has held without exception, suggesting a deep structural order underlying the universe of sets.

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 InconsistencyComplete First-Order TheoriesFirst-Order Types and Partial DescriptionsUltrafilters in Logic and Model TheoryMeasurable Cardinals and UltrafiltersConsistency Strength and the Large-Cardinal Hierarchy

Longest path: 94 steps · 585 total prerequisite topics

Prerequisites (4)

Leads To (1)