2000 character limit reached
Modern Forcing Techniques related to Finite Support Iteration: Ultrapowers, templates, and submodels
Published 27 Jan 2021 in math.LO | (2101.11494v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.