The exact strength of the class forcing theorem

Journal of Symbolic Logic 85 (3):869-905 (2020)
  Copy   BIBTEX


The class forcing theorem, which asserts that every class forcing notion ${\mathbb {P}}$ admits a forcing relation $\Vdash _{\mathbb {P}}$, that is, a relation satisfying the forcing relation recursion—it follows that statements true in the corresponding forcing extensions are forced and forced statements are true—is equivalent over Gödel–Bernays set theory $\text {GBC}$ to the principle of elementary transfinite recursion $\text {ETR}_{\text {Ord}}$ for class recursions of length $\text {Ord}$. It is also equivalent to the existence of truth predicates for the infinitary languages $\mathcal {L}_{\text {Ord},\omega }$, allowing any class parameter A; to the existence of truth predicates for the language $\mathcal {L}_{\text {Ord},\text {Ord}}$ ; to the existence of $\text {Ord}$ -iterated truth predicates for first-order set theory $\mathcal {L}_{\omega,\omega }$ ; to the assertion that every separative class partial order ${\mathbb {P}}$ has a set-complete class Boolean completion; to a class-join separation principle; and to the principle of determinacy for clopen class games of rank at most $\text {Ord}+1$. Unlike set forcing, if every class forcing notion ${\mathbb {P}}$ has a forcing relation merely for atomic formulas, then every such ${\mathbb {P}}$ has a uniform forcing relation applicable simultaneously to all formulas. Our results situate the class forcing theorem in the rich hierarchy of theories between $\text {GBC}$ and Kelley–Morse set theory $\text {KM}$.



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Destruction or preservation as you like it.Joel David Hamkins - 1998 - Annals of Pure and Applied Logic 91 (2-3):191-229.
On a class of maximality principles.Daisuke Ikegami & Nam Trang - 2018 - Archive for Mathematical Logic 57 (5-6):713-725.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Class Forcing in Class Theory.Carolin Antos - 2018 - In Carolin Antos, Sy-David Friedman, Radek Honzik & Claudio Ternullo (eds.), The Hyperuniverse Project and Maximality. Basel, Switzerland: Birkhäuser. pp. 1-16.
Fragile measurability.Joel Hamkins - 1994 - Journal of Symbolic Logic 59 (1):262-282.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
Hechler’s theorem for the null ideal.Maxim R. Burke & Masaru Kada - 2004 - Archive for Mathematical Logic 43 (5):703-722.
Closure properties of parametric subcompleteness.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (7-8):829-852.
Forcing disabled.M. C. Stanley - 1992 - Journal of Symbolic Logic 57 (4):1153-1175.
The Consistency Strength of M P C C C.George Leibman - 2010 - Notre Dame Journal of Formal Logic 51 (2):181-193.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.


Added to PP

33 (#487,172)

6 months
12 (#220,085)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

References found in this work

Classes and truths in set theory.Kentaro Fujimoto - 2012 - Annals of Pure and Applied Logic 163 (11):1484-1523.
Characterizations of pretameness and the Ord-cc.Peter Holy, Regula Krapf & Philipp Schlicht - 2018 - Annals of Pure and Applied Logic 169 (8):775-802.
Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.

Add more references