2021/08/08 by Shelah, Saharon
#03E35 #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.2108.03672
For λ inaccessible, we may consider (< λ)-support iteration of some specific (<λ)-complete λ+-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) < \mathfrakdλ.