Sigma-Prikry forcing. III: Down to \(\aleph_{\omega}\) (Q6147113): Difference between revisions

This is the last part of a serious of three papers. In the first two parts the authors introduced and studied \(\Sigma\)-Prikry forcing. They developed a framework for iteration of \(\Sigma\)-Prikry forcings. Here they extend the machinery developed in the first two papers, to support interleaved collapses. This new class is called \((\Sigma,\mathbb{S})\)-Prikry forcing. Iterating \((\Sigma,\mathbb{S})\)-Prikry forcing over a suitable ground model they show that Magidor's compactness and incompactness results can co-exists: Main Theorem: Assuming the consistency of infinitely many supercompact cardinals, it is consistent that all of the following hold: \begin{itemize} \item[(1)] \(2^{\aleph_n} = \aleph_{n+1}\) for all \(n<\omega\), \item[(2)] \(2^{\aleph_{\omega}} = \aleph_{\omega+2}\); \item[(3)] every stationary subset of \(\aleph_{\omega+1}\) reflects. \end{itemize}