加载中…
We consider -support iterations of a version of -strategically complete -c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by Judah and Shelah for finite support iterations of Suslin ccc forcing, namely that if is a FS iteration of Suslin ccc forcing and is sufficiently closed, then letting be the iteration along , we have .

生成讲解博客的中文版本

生成AI智能校验的中文版本