The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability (and, in fact, even the amenability) of the forcing relation and the truth lemma can fail for class forcing.In addition to these negative results, we show that the forcing theorem is equivalent to the existence of a (certain kind of) Boolean completion, and we introduce a weak combinatorial property (approachability by projections) that implies the forcing theorem to hold. Finally, we show that unlike for set forcing, Boolean completions need not be unique for class forcing.2010 Mathematics Subject Classification. 03E40, 03E70, 03E99. Key words and phrases. Class forcing, Forcing theorem, Boolean completions. The first, third and fifth author were partially supported by DFG-grant LU2020/1-1. The authors would like to thank Joel David Hamkins for the careful reading of the paper and numerous useful comments.1 Note that in the absence of the power set axiom, Collection does not follow from Replacement and many important set-theoretical results can consistently fail in the weaker theory. For further details, consult [GHJ11]. 2 A partial order (or, more generally, a preorder) P is separative if for all p, q ∈ P , if p ≤ q then there exists r ≤ p such that r ⊥ q.
We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In particular, we provide such embedding characterizations also for several large cardinal notions for which no embedding characterizations have been known so far, namely for subtle, for ineffable, and for λ-ineffable cardinals. As an application, which we will study in detail in a subsequent paper, we present the basic idea of our concept of internal large cardinals. We provide the definition of certain kinds of internally subtle, internally λ-ineffable and internally supercompact cardinals, and show that these correspond to generalized tree properties, that were investigated by Weiß in his [16] and [17], and by Viale and Weiß in [15]. In particular, this yields new proofs of Weiß's results from [16] and [17], eliminating problems contained in the original proofs.2010 Mathematics Subject Classification. 03E55, 03E05, 03E35.
It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of ZF − , that is ZF without the power set axiom, or equivalently, by the preservation of the axiom scheme of replacement, for class forcing over models of ZF. We show that pretameness in fact has various other characterizations, for instance in terms of the forcing theorem, the preservation of the axiom scheme of separation, the forcing equivalence of partial orders and their dense suborders, and the existence of nice names for sets of ordinals. These results show that pretameness is a strong dividing line between well and badly behaved notions of class forcing, and that it is exactly the right notion to consider in applications of class forcing. Furthermore, for most properties under consideration, we also present a corresponding characterization of the Ord-chain condition. We would like to thank Maurice Stanley and Sy Friedman for providing us with information regarding the definability of the forcing relation in class forcing, and we would like to thank Victoria Gitman for helpful comments and discussions on some of the topics of this paper. We would also like to thank the referee for thoroughly reading through our paper, and for making many useful comments, that enabled us to very much improve this paper. The first and third author were partially supported by DFG-grant LU2020/1-1.1 Arguing in the ambient universe V, we will sometimes refer to classes of such a model M as sets, without meaning to indicate that they are sets of M. In particular this will be the case when we talk about subsets of M . 2 For more details, see [HKL + 16]. For a detailed axiomatization of KM, see [Ant15].
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.