The exact strength of the class forcing theorem

Journal article

The class forcing theorem, which asserts that every class forcing notion P admits a forcing relation 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¨odel-Bernays set theory GBC to the principle of elementary transfinite recursion ETROrd for class recursions of length Ord. It is also equivalent to the existence of truth predicates for the infinitary languages LOrd,ω(∈, A), allowing any class parameter A; to the existence of truth predicates for the language LOrd,Ord(∈, A); to the existence of Ord-iterated truth predicates for first-order set theory Lω,ω(∈, A); to the assertion that every separative class partial order 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 Ord + 1. Unlike set forcing, if every class forcing notion P has a forcing relation merely for atomic formulas, then every such 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 GBC and Kelley-Morse set theory KM.

Authors: Gitman, V; Hamkins, JD; Holy, P; Schlicht, P; Williams, KJ

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Cambridge University Press
• Journal: Journal of Symbolic Logic
• Volume: 85
• Issue: 3
• Pages: 869-905
• Publication date: 2020-07-29
• Acceptance date: 2019-12-06
• DOI: 10.1017/jsl.2019.89
• EISSN: 1943-5886
• ISSN: 0022-4812
• Language: English
• Keywords: FFR