arXiv Analytics

Sign in

arXiv:2101.11494 [math.LO]AbstractReferencesReviewsResources

Some Forcing Techniques: Ultrapowers, templates, and submodels

Joerg Brendle

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
arXiv:1007.4309 [math.LO] (Published 2010-07-25, updated 2010-12-06)
Elementary submodels in infinite combinatorics
arXiv:math/0611131 [math.LO] (Published 2006-11-06, updated 2010-07-30)
Lords of the iteration
arXiv:math/9904163 [math.LO] (Published 1999-04-29)
Towards Martin's Minimum