Sigma-Prikry forcing II: Iteration Scheme

In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are Sigma-Prikry. We showed that given a Sigma-Prikry poset P and a P-name for a non-reflecting stationary set T, there exists a corresponding Sigma-Prikry poset that projects to P and kills the stationarity of T. In this paper, we develop a general scheme for iterating Sigma-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.

No reviews yet.

No comments yet.