ConceptMathematics
Forcing
A method used in set theory to prove consistency and independence results by extending models of set theory using Boolean-valued models or generic filters.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Set theory3Continuum hypothesis2Model of set theory2Boolean algebra1Generic filter1Zermelo-Fraenkel set theory1ZFC1ZFC models1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Joel David Hamkins
A method invented by Paul Cohen to extend models of set theory to prove independence results.Mirna Džamonja
A technique used in set theory to prove consistency results by extending a model with a generic filter.
Lectures that assume it
8- Iteration, Reflection, and Singular Cardinals
- The Geology of Inner Mantles
- Forcing Axioms and Name Principles in Set Theory
- Cantor’s Continuum Hypothesis in Set Theory
- Some Set Theory of Kaufmann Models
- Ultrafilters on Omega Versus Forcing
- The Continuum Hypothesis and the Search for Ultimate Mathematical Truth
- Minimal Models and Beta-Categoricity
Connections
21The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Continuum hypothesis
- Model of set theory
- Boolean algebra
- Boolean ultra power construction
- Boolean ultrapower
- Cohen forcing
Show 2 moreShow fewer
Lectures13
- Set Theory and the Philosophy of Set Theory
- The Continuum Hypothesis as a Fundamental Axiom
- Bi-interpretation of Weak Set Theories
- The Continuum Hypothesis and Other Set-Theoretic Ideas for Non-Set-Theorists (Part 1)
- On Wide Aronszajn Trees
- Iteration, Reflection, and Singular Cardinals