arXiv:2101.11494 [math.LO]AbstractReferencesReviewsResources
Some Forcing Techniques: Ultrapowers, templates, and submodels
Published 2021-01-27Version 1
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along templates, Boolean ultrapowers of forcing notions, and restrictions of forcing notions to elementary submodels.
Related articles: Most relevant | Search more
Elementary submodels in infinite combinatorics
Lords of the iteration
arXiv:math/9904163 [math.LO] (Published 1999-04-29)
Towards Martin's Minimum