Layered posets and Kunen's universal collapse

Abstract

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if is weakly compact then any universal Kunen iteration of -cc posets (each possibly of size ) is -cc, as long as direct limits are used sufficiently often. This iteration theorem simplifies and generalizes the various chain condition arguments for universal Kunen iterations in the literature on saturated ideals, especially in situations where finite support iterations are not possible. We also provide two applications: (1) For any n 1, a wide variety of <ωn-1-closed, ωn+1-cc posets of size ωn+1 can consistently be absorbed (as regular suborders) by quotients of saturated ideals on ωn (see Theorem 7 and Corollary 8); and (2) For any n ∈ ω, the Tree Property at ωn+3 is consistent with the Chang's Conjecture (ωn+3, ωn+1) (ωn+1, ωn) (Theorem 9).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…