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 , a wide variety of -closed, -cc posets of size can consistently be absorbed (as regular suborders) by quotients of saturated ideals on (see Theorem 7 and Corollary 8).
2 For any , the tree property at is consistent with Chang’s conjecture (Theorem 9).
"Layered Posets and Kunen’s Universal Collapse." Notre Dame J. Formal Logic 60 (1) 27 - 60, 2019. https://doi.org/10.1215/00294527-2018-0022