The exact strength of the class forcing theorem

DOI10.1017/JSL.2019.89MaRDI QIDQ5855740zbMATH OpenOpenAlexFDO

Authors Victoria Gitman, Joel David Hamkins, Peter Holy, Philipp Schlicht, Kameryn J. Williams

Publication date 19 March 2021

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.03700

zbMATH Keywords

class forcingforcing theoreminfinitary logictruth predicates

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Nonclassical and second-order set theories (03E70)

Abstract: The class forcing theorem, which asserts that every class forcing notion $mathbbP$ admits a forcing relation $Vdas{h}_{mathbbP}$, 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"odel-Bernays set theory GBC to the principle of elementary transfinite recursion $ext{ETR}_{extOrd}$ for class recursions of length $extOrd$. It is also equivalent to the existence of truth predicates for the infinitary languages $mathcal{L}_{extOrd,omega}(in,A)$, allowing any class parameter $A$; to the existence of truth predicates for the language $mathcal{L}_{extOrd,extOrd}(in,A)$; to the existence of $extOrd$-iterated truth predicates for first-order set theory $mathcal{L}_{omega,omega}(in,A)$; to the assertion that every separative class partial order $mathbbP$ 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 $extOrd+1$. Unlike set forcing, if every class forcing notion $mathbbP$ has a forcing relation merely for atomic formulas, then every such $mathbbP$ has a uniform forcing relation applicable simultaneously to all formulas. Our results situate the class forcing theorem in the rich hierarchy of theories between GBC and Kelley-Morse set theory KM.

Recommendations

• Class forcing, the forcing theorem and Boolean completions
• Class forcing in class theory
• Sufficient conditions for the forcing theorem, and turning proper classes into sets
• On the Mathematical Content of the Theory of Classes KM

Cites work

• Algebraicity and implicit definability in set theory
• Characterizations of pretameness and the Ord-cc
• Class forcing, the forcing theorem and Boolean completions
• Classes and truths in set theory
• scientific article; zbMATH DE number 3467095 (Why is no real title available?)
• Minimum models of second-order set theories
• Open determinacy for class games
• Relative predicativity and dependent recursion in second-order set theory and higher-order theories

Cited in

(14)

• Inner-model reflection principles
• Class forcing, the forcing theorem and Boolean completions
• Class forcing in class theory
• Boolean-valued class forcing
• AN AXIOMATIC APPROACH TO FORCING IN A GENERAL SETTING
• Kelley–Morse set theory does not prove the class Fodor principle
• Minimum models of second-order set theories
• Sufficient conditions for the forcing theorem, and turning proper classes into sets
• First‐order undefinability of the notion of transfinitely uplifting cardinals
• Choiceless large cardinals and set‐theoretic potentialism
• VARIETIES OF CLASS-THEORETIC POTENTIALISM
• Modal model theory
• Reflection in second-order set theory with abundant urelements bi-interprets a supercompact cardinal
• Non-tightness in class theory and second-order arithmetic

This page was built for publication: The exact strength of the class forcing theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855740)