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 more→→Inner 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 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 → Complete First-Order Theories → First-Order Types and Partial Descriptions → Ultrafilters in Logic and Model Theory → Measurable Cardinals and Ultrafilters → Consistency Strength and the Large-Cardinal Hierarchy

Longest path: 94 steps · 585 total prerequisite topics

Prerequisites (4)

Leads To (1)