Sufficient conditions for the forcing theorem, and turning proper classes into sets

Philipp Schlicht , Peter Holy, Regula Krapf

Research output: Contribution to journalArticle (Academic Journal)peer-review


We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself), including the three properties presented in this paper, imply yet another regularity property for class forcing notions, namely that proper classes of the ground model cannot become sets in a generic extension, that is they do not have set-sized names in the ground model. We then show that over certain models of G ̈odel-Bernays set theory without the power set axiom, there is a notion of class forcing which turns a proper class into a set, however does not satisfy the forcing theorem. Moreover, we show that the property of not turning proper classes into sets can be used to characterize pretameness over such models of G ̈odel-Bernays set theory.
Original languageEnglish
Pages (from-to)27-44
Number of pages18
JournalFundamenta Mathematicae
Publication statusPublished - 15 Feb 2019

Bibliographical note

The acceptance date for this record is provisional and based upon the month of publication for the article.


Dive into the research topics of 'Sufficient conditions for the forcing theorem, and turning proper classes into sets'. Together they form a unique fingerprint.

Cite this