Morasses and finite support iterations
Bernhard Irrgang
Abstract
Open-access reader
Bernhard Irrgang
Abstract
Open-access reader
We introduce a method of constructing a forcing along a simplified $(κ,1)$-morass such that the forcing satisfies the $κ$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain condition. As an application, we construct a ccc forcing that adds an $ω_2$-Suslin tree. Related methods are Shelah's historic forcing and Todorcevic's $ρ$-functions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We introduce a method of constructing a forcing along a simplified $(κ,1)$-morass such that the forcing satisfies the $κ$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain condition. As an application, we construct a ccc forcing that adds an $ω_2$-Suslin tree. Related methods are Shelah's historic forcing and Todorcevic's $ρ$-functions.
Key concepts: Computer science, Mathematics