Iteration of lambda-complete forcing notions not collapsing lambda^+
classification
🧮 math.LO
keywords
forcingcollapsinglambdalambda-completenotionsdefinitioniterationiterations
read the original abstract
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
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.