Abstract

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)<dλcov(meagre) < \mathfrak{d}_λ.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.