Journal of Mathematical Logic ( IF 0.9 ) Pub Date : 2022-09-12 , DOI: 10.1142/s0219061321500197 Alejandro Poveda 1, 2 , Assaf Rinot 3 , Dima Sinapova 4
In Part I of this series [A. Poveda, A. Rinot and D. Sinapova, Sigma-Prikry forcing I: The axioms, Canad. J. Math. 73(5) (2021) 1205–1238], we introduced a class of notions of forcing which we call -Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are -Prikry. We showed that given a -Prikry poset and a -name for a non-reflecting stationary set , there exists a corresponding -Prikry poset that projects to and kills the stationarity of . In this paper, we develop a general scheme for iterating -Prikry posets and, as an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds.
中文翻译:
Sigma-Prikry 强迫 II:迭代方案
在本系列的第一部分 [5] 中,我们介绍了一类我们称之为 [公式:见正文]-Prikry 的强制概念,并展示了许多已知的 Prikry 类型的强制概念,它们以可数的奇异基数为中心共定性是[公式:见正文]-Prikry。我们证明了给定一个[公式:见文本]-Prikry poset [公式:见文本]和一个非反射固定集[公式:见文本]的名称[公式:见文本],存在一个对应的[公式:见文本] text]-投影到 [Formula: see text] 并消除 [Formula: see text] 的平稳性的 Prikry poset。在本文中,我们开发了一种用于迭代 [Formula: see text]-Prikry 偏集的通用方案,并验证了基于 Extender 的 Prikry 强制是 [Formula: see text]-Prikry。作为应用程序,我们炸毁了 Laver 坚不可摧的超紧致红雀的可数极限的力量,然后迭代地杀死其继任者的所有非反射静止子集。这产生了一个模型,其中奇异基数假设失败,同时对固定集的有限族的反映成立。