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

Absolute Formulas and Model-Theoretic Absoluteness

College Depth 90 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
467prerequisites beneath it
See this on the map →
Basic Model TheoryThe Cumulative Hierarchy and Ranks→→Elementary Submodels of ZFC
absoluteness models inner-models formulas

Core Idea

A formula φ is absolute for a model M if M ⊨ φ(x) holds if and only if V ⊨ φ(x) holds, for parameters x in M. Absolute formulas preserve truth across models and meta-models. Many core set-theoretic notions (∈, ⊆, ordinal, etc.) are absolute, but others (cardinality, measurability) are not. Absoluteness is crucial for inner-model constructions.

How It's Best Learned

Verify that 'x is an ordinal' is absolute: check that L and V agree on which sets are ordinals. Show that 'κ is measurable' is NOT absolute (measurability can differ between models). Use downward absoluteness to prove properties are preserved by inner models.

Common Misconceptions

Explainer

You know from model theory basics that a formula φ is evaluated relative to a structure — given a model M, "M ⊨ φ" means φ is true in M under some assignment. A natural question arises: if M is a submodel of a larger model V (or an inner model of the set-theoretic universe), does truth of φ transfer? The answer depends on the formula. A formula φ(x) is absolute between two models M ⊆ V if for every element a ∈ M, M ⊨ φ(a) if and only if V ⊨ φ(a). Absoluteness means the formula's truth value does not depend on which model you evaluate it in, as long as the element is in both.

The simplest absolute formulas are those built only from bounded quantifiers — quantifiers of the form ∀x ∈ a or ∃x ∈ a, where the quantifier ranges only over elements of a specific set rather than over the whole model. These are called Δ₀ formulas. A Δ₀ formula can only "see" elements of a specific set, so it cannot be affected by adding or removing objects outside that set. For example, "x ∈ y" is Δ₀ and absolute: whether a is in b is a fact about a and b themselves, independent of the ambient model. Similarly, "x is an ordinal" and "x is a natural number" are absolute — these are intrinsic structural properties that inner models cannot change.

Non-absoluteness arises when quantifiers range over the whole universe, because different models may have different universes. Cardinality is the classic example. A cardinal κ might be uncountable in an inner model M (M ⊨ "κ is uncountable") but countable in a larger model V where new bijections exist that M could not see. This is precisely what happens in Cohen's forcing: you can build a model where ℵ₁ of the ground model becomes countable. Similarly, measurability is not absolute: a cardinal κ can be measurable in an inner model without being measurable in the full universe, or vice versa, depending on the structure of ultrafilters available.

Absoluteness is critical for inner model constructions. When building L (Gödel's constructible universe) or other inner models, you want certain key set-theoretic notions to mean the same thing inside L as they do in V. If "x is an ordinal" is absolute between L and V, then L and V agree on what the ordinals are — L's ordinals are exactly V's ordinals, just as seen from within L. This allows results proved in L to transfer to V and vice versa for absolute notions. The technical framework of Δ₀ → Δ₁ → Σ₁/Π₁ absoluteness is the systematic study of which formulas are absolute between which pairs of models, and it underlies virtually every theorem in inner model theory and forcing.

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 → Absolute Formulas and Model-Theoretic Absoluteness

Longest path: 91 steps · 467 total prerequisite topics

Prerequisites (2)

Leads To (1)