English

Corrected Iteration

Logic 2022-09-07 v2

Abstract

For λ\lambda inaccessible, we may consider (<λ)(< \lambda)-support iteration of some specific (<λ)(<\lambda)-complete λ+\lambda^+-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct" the iteration to regain it. This is used in another paper in the consistency of cov(meagre)<dλcov(meagre) < \mathfrak{d}_\lambda.

Keywords

Cite

@article{arxiv.2108.03672,
  title  = {Corrected Iteration},
  author = {Saharon Shelah},
  journal= {arXiv preprint arXiv:2108.03672},
  year   = {2022}
}

Comments

arXiv admin note: substantial text overlap with arXiv:0904.0817, arXiv:1302.3449