Some models produced by 3D iterations
英文摘要：
We construct models, by three-dimensional arrays of ccc posets, where many classical cardinal characteristics of the continuum are pairwise different.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
How to win some simple iteration games
We introduce two new iteration games: the game G, which is a strengthening of the weak iteration game, and the game G+, which is somewhat stronger than G but weaker than the full iteration game of length omega_1. For a countable M elementarily embeddable in some V_{eta}, we can show that II wins G(M,omega_1) and that I does not win the G+(M).
math.LO
Iteration of strongly $κ^+$-cc forcing posets
We prove some iteration theorems for a certain class of $κ^+$-cc forcing posets.
math.LO
Preservation properties for iterations with finite support
We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real numbers, typically associated with some classical cardinal invariant. We also prove that, under some conditions, these preservation properties can be preserved in direct limits of an iteration, so applications are extended beyond the context of finite support iterations. Also, we make a breve exposition of Shelah's theory of forcing with an ultrapower of a poset by a measurable cardinal.
math.LO
Iterations of V and the core model
Answering a question which was around for some while we prove that if π: V -> M is such that M is transitive and closed under ω-sequences then the core model of M is an iterate of the core model of V.
math.LO
Corrected Iteration
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) < \mathfrak{d}_λ$.
math.LO
