English

Abstract Corrected Iterations

Logic 2024-11-14 v3

Abstract

We consider (<λ)(<\lambda)-support iterations of a version of (<λ)(<\lambda)-strategically complete λ+\lambda^+-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 (Pα,Qβ:αδ,β<δ)(\mathbb{P}_{\alpha}, \underset{\sim}{\mathbb Q_{\beta}} : \alpha \leq \delta, \beta <\delta) is a FS iteration of Suslin ccc forcing and UδU\subseteq \delta is sufficiently closed, then letting PU\mathbb{P}_U be the iteration along UU, we have PUPδ\mathbb{P}_U \lessdot \mathbb{P}_{\delta}.

Keywords

Cite

@article{arxiv.2302.08581,
  title  = {Abstract Corrected Iterations},
  author = {Haim Horowitz and Saharon Shelah},
  journal= {arXiv preprint arXiv:2302.08581},
  year   = {2024}
}