Modern Forcing Techniques related to Finite Support Iteration: Ultrapowers, templates, and submodels

TL;DR

This paper provides an expository overview of advanced forcing techniques such as ultrapowers, templates, Boolean ultrapowers, and submodel restrictions, all related to finite support iterations of ccc partial orders.

Contribution

It systematically explains several sophisticated forcing methods related to finite support iterations, clarifying their connections and applications.

Findings

Ultrapowers of forcing notions are analyzed.

Iterations along templates are discussed.

Restrictions of forcing notions to elementary submodels are examined.

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.