More about lambda-support iterations of <lambda-complete forcing notions
Andrzej Roslanowski, Saharon Shelah
TL;DR
This paper introduces a new property of <lambda-strategically complete forcing notions that ensures their lambda-support iterations do not collapse lambda^+ at a strongly inaccessible cardinal.
Contribution
It presents a novel property of <lambda-strategically complete forcing notions that preserves cardinalities during lambda-support iterations.
Findings
The new property prevents collapse of lambda^+ in iterations.
It extends previous work on lambda-support iterations and forcing notions.
The results apply to strongly inaccessible cardinals.
Abstract
This article continues Ros{\l}anowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that their lambda-support iterations do not collapse lambda^+ (for a strongly inaccessible cardinal lambda).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.