More about lambda-support iterations of <lambda-complete forcing notions
classification
🧮 math.LO
keywords
mathforcingiterationslambdalambda-supportnotionsanowskiarticle
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.