Skip to main content Accessibility help
×
Home

CLASS FORCING, THE FORCING THEOREM AND BOOLEAN COMPLETIONS

  • PETER HOLY (a1), REGULA KRAPF (a2), PHILIPP LÜCKE (a3), ANA NJEGOMIR (a4) and PHILIPP SCHLICHT (a5) (a6)...

Abstract

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.

Copyright

References

Hide All
[1] Antos, C., Class-Forcing in Class Theory, submitted, arXiv preprint, arXiv:1503.00116, 2015.
[2] Beller, A., Jensen, R., and Welch, P., Coding the Universe, London Mathematical Society Lecture Note Series, vol.47, Cambridge University Press, Cambridge, New York, 1982.
[3] Drake, F. R., Set Theory: An Introduction to Large Cardinals. Studies in logic and the foundation of mathematics. vol. 76, North-Holland, Amsterdam, 1974.
[4] Enayat, A., Models of set theory with definable ordinals . Archive for Mathematical Logic, vol. 44 (2005), no. 3, pp. 363385.
[5] Friedman, S. D., Fine Structure and Class Forcing, de Gruyter Series in Logic and its Applications, vol. 3, Walter de Gruyter & Co., Berlin, 2000.
[6] Gitman, V., Hamkins, J. D., and Johnstone, T. A., What is the theory ZFC without power set? Mathematical Logic Quarterly, to appear.
[7] Holy, P., Krapf, R., and Schlicht, P., Characterisations of Pretameness and the Ord-cc, submitted.
[8] Holy, P., Krapf, R., and Schlicht, P., Separation in Class Forcing Extensions, submitted.
[9] Hamkins, J. D., Linetsky, D., and Reitz, J., Pointwise definable models of set theory , this Journal, vol. 78 (2013), no. 1, pp. 139156.
[10] Kunen, K., Set Theory, Studies in Logic and the Foundations of Mathematics, vol. 102, North-Holland, Amsterdam, 1980.
[11] Owen, R., Outer Model Theory and the Definability of Forcing , Ph.D thesis, 2008.
[12] Stanley, M. C., Outer models and genericity , this Journal, vol. 68 (2003), no. 2, pp. 389418.
[13] Zarach, A., Forcing with proper classes . Fundamenta Mathematicae, vol. 81 (1973), no. 1, pp. 127.

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed