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 [Formula: see text]-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are [Formula: see text]-Prikry. We showed that given a [Formula: see text]-Prikry poset [Formula: see text] (...) and a [Formula: see text]-name for a non-reflecting stationary set [Formula: see text], there exists a corresponding [Formula: see text]-Prikry poset that projects to [Formula: see text] and kills the stationarity of [Formula: see text]. In this paper, we develop a general scheme for iterating [Formula: see text]-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. (shrink)

It is known that there is a close relation between Prikry forcing and the iteration of ultrapowers: If U is a normal ultrafilter on a measurable cardinal κ and 〈Mn, jm,n | m ≤ n ≤ ω〉 is the iteration of ultrapowers of V by U, then the sequence of critical points 〈j0,n | n ∈ ω〉 is a Prikry generic sequence over Mω. In this paper we generalize this for normal precipitous filters.

The extender based Prikry forcing notion is being generalized to super compact extenders.

In this paper, we answer a question asked in Koepke et al. regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.

The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping Reflection Principle, a consequence of PFA. While the results fall short of showing that MRP implies SCH, it will be shown that MRP implies that if SCH fails first at κ then every stationary subset of reflects. It will also be (...) demonstrated that MRP always fails in a generic extension by Prikry forcing. (shrink)

Abstract(1)We show that it is possible to add $\kappa ^+$ -Cohen subsets to $\kappa $ with a Prikry forcing over $\kappa $. This answers a question from [9].(2)A strengthening of non-Galvin property is introduced. It is shown to be consistent using a single measurable cardinal which improves a previous result by S. Garti, S. Shelah, and the first author [5].(3)A situation with Extender-based Prikry forcings is examined. This relates to a question of H. Woodin.

Let \ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in \ is subcomplete. To do this it is shown that a simplified version of generalized Prikry forcing which adds a point below each cardinal in \, called generalized diagonal Prikry forcing, is subcomplete. Moreover, the generalized diagonal Prikry forcing associated to \ is subcomplete above \, where (...) \ is any regular cardinal below the first limit point of \. (shrink)

If $U$ is a normal ultrafilter on a measurable cardinal $\kappa$, then the intersection of the $\omega$ first iterated ultrapowers of the universe by $U$ is a Prikry generic extension of the $\omega$th iterated ultrapower.

We study which [Formula: see text]-distributive forcing notions of size [Formula: see text] can be embedded into tree Prikry forcing notions with [Formula: see text]-complete ultrafilters under various large cardinal assumptions. An alternative formulation — can the filter of dense open subsets of a [Formula: see text]-distributive forcing notion of size [Formula: see text] be extended to a [Formula: see text]-complete ultrafilter.

Journal of Mathematical Logic, Volume 24, Issue 03, December 2024. We study which [math]-distributive forcing notions of size [math] can be embedded into tree Prikry forcing notions with [math]-complete ultrafilters under various large cardinal assumptions. An alternative formulation — can the filter of dense open subsets of a [math]-distributive forcing notion of size [math] be extended to a [math]-complete ultrafilter.

We study non-homogeneity of quotients of Prikry and tree Prikry forcings with non-normal ultrafilters over some natural distributive forcing notions.

We prove a Mathias-type criterion for the Magidor iteration of Prikry forcings.

We study the Mathias–Prikry and Laver–Prikry forcings associated with filters on ω. We give a combinatorial characterization of Martinʼs number for these forcing notions and present a general scheme for analyzing preservation properties for them. In particular, we give a combinatorial characterization of those filters for which the Mathias–Prikry forcing does not add a dominating real.

Recently, Gitik, Kanovei and the first author proved that for a classical Prikry forcing extension the family of the intermediate models can be parametrized by $\mathscr{P}(\omega)/\mathrm{finite}$. By modifying the standard Prikry tree forcing we define a Prikry-type forcing which also singularizes a measurable cardinal but which is minimal, i.e., there are \emph{no} intermediate models properly between the ground model and the generic extension. The proof relies on combining the rigidity of the tree structure with (...) indiscernibility arguments resulting from the normality of the associated measures. (shrink)

A generalization of Příkrý's forcing is analyzed which adjoins to a model of ZFC a set of order type at most ω below each member of a discrete set of measurable cardinals. A characterization of generalized Příkrý generic sequences reminiscent of Mathias' criterion for Příkrý genericity is provided, together with a maximality theorem which states that a generalized Příkrý sequence almost contains every other one lying in the same extension.This forcing can be used to falsify the covering lemma (...) for a higher core model if there is an inner model with infinitely many measurable cardinals – changing neither cardinalities nor cofinalities. Another application is an alternative proof of a theorem of Mitchell stating that if the core model contains a regular limit θ of measurable cardinals, then there is a model in which every set of measurable cardinals of K bounded in θ has an indiscernible sequence but there is no such sequence for the entire set of measurables of K below θ. (shrink)

We continue [4] and study sets in generic extensions by the Magidor forcing and by the Prikry forcing with non-normal ultrafilters.

We show that Gitik’s short extender gap-2 forcing is of Prikry type.

We consider of constructing normal ultrafilters in extensions are here Easton support iterations of Prikry-type forcing notions. New ways presented. It turns out that, in contrast with other supports, seemingly unrelated measures or extenders can be involved here.

Applying the seed concept to Prikry tree forcing P μ , I investigate how well P μ preserves the maximality property of ordinary Prikry forcing and prove that P μ Prikry sequences are maximal exactly when μ admits no non-canonical seeds via a finite iteration. In particular, I conclude that if μ is a strongly normal supercompactness measure, then P μ Prikry sequences are maximal, thereby proving, for a large class of measures, a conjecture (...) of W. Hugh Woodin's. (shrink)

In this paper we investigate some properties of forcing which can be considered “nice” in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular cardinal, cannot be too nice and must cause some “damage” to the structure of cardinals and stationary sets. As a consequence there is no analogue to the Prikry forcing, in terms of “nice” properties, when changing cofinalities to be uncountable.

An ℵ1-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an ℵ1-Souslin tree. In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a λ+-Souslin tree. This class includes Prikry, Magidor, and (...) Radin forcing. (shrink)

We present a version for κ-distributive ideals over a regular infinite cardinal κ of some of the combinatorial results of Mathias on happy families. We also study an associated notion of forcing, which is a generalization of Mathias forcing and of Prikry forcing.

Thought: A Journal of Philosophy, EarlyView.

We study the Magidor iteration of Prikry forcings, and the resulting normal measures on κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document}, the first measurable cardinal in a generic extension. We show that when applying the iteration to a core model below 0¶\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${0^{\P}}$$\end{document}, then there exists a natural correspondence between the normal measures on κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document} in the ground model, and (...) those of the generic extension. (shrink)

Extender-based Prikry–Magidor forcing for overlapping extenders is introduced. As an application, models with strong forms of negations of the Shelah Weak Hypothesis for various cofinalities are constructed.

Consider where κ is an uncountable regular cardinal. By a result of Shelah's we have for almost all witnessing this. Here we consider the question if there could be a similar result for. We will discuss some basic facts implying that this cannot hold in general. We will use these facts to construct an interesting example of a pseudo Prikry forcing, answering a question of Sinapova.

We show how to construct Gitik’s short extenders gap-3 forcing using a morass, and that the forcing notion is of Prikry type.

The dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle. In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics.We commence Part I by investigating the Identity Crisis phenomenon in the region (...) comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $^{\mathrm {HOD}}<\lambda ^+$, for every regular cardinal $\lambda $.” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal $\lambda $ is singular in HOD and $^{\textrm {{HOD}}}=\lambda ^+$, there may still be no agreement at all between V and HOD about successors of regular cardinals.In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics.Specifically, Part II is devoted to prove the consistency of the Tree Property at both $\kappa ^+$ and $\kappa ^{++}$, whenever $\kappa $ is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for $\kappa $ and arbitrary failures for the SCH.In the last part of the dissertation we introduce the notion of $\Sigma $ -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others.Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every $\kappa ^{++}$ -length iteration with support of size $\leq \kappa $ has the $\kappa ^{++}$ -cc, provided the iterates belong to a relevant class of $\kappa ^{++}$ -cc forcings. While there are a myriad of works on this vein for regular cardinals, this contrasts with the dearth of investigations in the parallel context of singular cardinals. Our main contribution is the proof that such a result is available whenever the class of forcings under consideration is the family of $\Sigma $ -Prikry forcings. Finally, and as an application, we prove that it is consistent—modulo large cardinals—the existence of a strong limit cardinal $\kappa $ with countable cofinality such that $\mathrm {SCH}_\kappa $ fails and every finite family of stationary subsets of $\kappa ^+$ reflects simultaneously. (shrink)

We introduce a class of forcing notions, called forcing notions of type S, which contains among other Sacks forcing, Prikry-Silver forcing and their iterations and products with countable supports. We construct and investigate some formalism suitable for this forcing notions, which allows all standard tricks for iterations or products with countable supports of Sacks forcing. On the other hand it does not involve internal combinatorial structure of conditions of iterations or products. We prove (...) that the class of forcing notions of type S is closed under products and certain iterations with countable supports. (shrink)

We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a κ+-supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into ℵω and make the principle □ℵω,<ω fail in the generic extension. We (...) also show that by using Lévy collapse followed by standard iterated club shooting it is possible to turn a subcompact cardinal into ℵ2 and arrange in the generic extension that simultaneous reflection holds at ℵ2, and at the same time, every stationary subset of ℵ3 concentrating on points of cofinality ω has a reflection point of cofinality ω1. (shrink)

It is shown that cardinals below a real-valued measurable cardinal can be split into finitely many intervals so that the powers of cardinals from the same interval are the same. This generalizes a theorem of Prikry [9]. Suppose that the forcing with a κ-complete ideal over κ is isomorphic to the forcing of λ-Cohen or random reals. Then for some τ<κ, λτ2κ and λ2<κ implies that 2κ=2τ= cov. In particular, if 2κ<κ+ω, then λ=2κ. This answers a question (...) from [3]. If A0, A1,..., An,… are sets of reals, then there are disjoint sets B0, B1,..., Bn,… such that BnAn and μ*=μ* for every n<ω, where μ* is the Lebes gue outer measure. For finitely many sets the result is due to N. Lusin. Let be a σ-centered forcing notion and An ¦n<ω subsets of P witnessing this. If P, An's and the relation of compatibility are Borel, then P adds a Cohen real. The forcing with a κ-complete ideal over a set X, ¦X¦κ cannot be isomorphic to a Hechler real forcing. This result was claimed in [3], but the proof given there works only for X of cardinality κ. (shrink)

We determine exact consistency strengths for various failures of the Singular Cardinals Hypothesis (SCH) in the setting of the Zermelo-Fraenkel axiom system ZF without the Axiom of Choice (AC). By the new notion of parallel Prikry forcing that we introduce, we obtain surjective failures of SCH using only one measurable cardinal, including a surjective failure of Shelah's pcf theorem about the size of the power set of $\aleph _{\omega}$ . Using symmetric collapses to $\aleph _{\omega}$ , $\aleph _{\omega (...) _{1}}$ , or $\aleph _{\omega _{2}}$ , we show that injective failures at $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ , or $\aleph _{\omega _{2}}$ can have relatively mild consistency strengths in terms of Mitchell orders of measurable cardinals. Injective failures of both the aforementioned theorem of Shelah and Silver's theorem that GCH cannot first fail at a singular strong limit cardinal of uncountable cofinality are also obtained. Lower bounds are shown by core model techniques and methods due to Gitik and Mitchell. (shrink)

Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing that any of their eight Boolean combinations can be forced to hold at${\kappa ^{ + + }}$, assuming that$\kappa = {\kappa ^{ < \kappa }}$and there is a weakly compact cardinal aboveκ.If in additionκis supercompact then we can forceκto be${\aleph _\omega }$in the extension. The proofs combine the techniques of adding and then destroying (...) a nonreflecting stationary set or a${\kappa ^{ + + }}$-Souslin tree, variants of Mitchell’s forcing to obtain the tree property, together with the Prikry-collapse poset for turning a large cardinal into${\aleph _\omega }$. (shrink)

In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for (...) $\operatorname {\mathrm {cf}}(\nu ) = \omega $ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon. (shrink)

We study the following natural strong variant of destroying Borel ideals: $\mathbb {P}$ $+$ -destroys $\mathcal {I}$ if $\mathbb {P}$ adds an $\mathcal {I}$ -positive set which has finite intersection with every $A\in \mathcal {I}\cap V$. Also, we discuss the associated variants $$ \begin{align*} \mathrm{non}^*(\mathcal{I},+)=&\min\big\{|\mathcal{Y}|:\mathcal{Y}\subseteq\mathcal{I}^+,\; \forall\;A\in\mathcal{I}\;\exists\;Y\in\mathcal{Y}\;|A\cap Y| \omega $ ; (4) we characterise when the Laver–Prikry, $\mathbb {L}(\mathcal {I}^*)$ -generic real $+$ -destroys $\mathcal {I}$, and in the case of P-ideals, when exactly $\mathbb {L}(\mathcal {I}^*)$ $+$ -destroys $\mathcal {I}$ (...) ; and (5) we briefly discuss an even stronger form of destroying ideals closely related to the additivity of the null ideal. (shrink)

We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ many colours has a g-colour class on which c takes every value. The paper also contains some generalisations of the above statement in which $\mu^{+}$ is replaced (...) by other cardinals < $\mu$. (shrink)

We prove a number of consistency results complementary to the ZFC results from our paper [J. Cummings, M. Foreman, M. Magidor, Canonical structure in the universe of set theory: part one, Annals of Pure and Applied Logic 129 211–243]. We produce examples of non-tightly stationary mutually stationary sequences, sequences of cardinals on which every sequence of sets is mutually stationary, and mutually stationary sequences not concentrating on a fixed cofinality. We also give an alternative proof for the consistency of the (...) existence of stationarily many non-good points, show that diagonal Prikry forcing preserves certain stationary reflection properties, and study the relationship between some simultaneous reflection principles. Finally we show that the least cardinal where square fails can be the least inaccessible, and show that weak square is incompatible in a strong sense with generic supercompactness. (shrink)

For any ordinal δ, let λδ be the least inaccessible cardinal above δ. We force and construct a model in which the least supercompact cardinal κ is indestructible under κ-directed closed forcing and in which every measurable cardinal δ < κ is < λδ strongly compact and has its < λδ strong compactness indestructible under δ-directed closed forcing of rank less than λδ. In this model, κ is also the least strongly compact cardinal. We also establish versions of (...) this result in which κ is the least strongly compact cardinal but is not supercompact. (shrink)

Gitik and Rinot (Trans Am Math Soc 364(4):1771–1795, 2012) proved assuming the existence of a supercompact that it is consistent to have a strong limit cardinal $$\kappa $$ of countable cofinality such that $$2^\kappa =\kappa ^+$$, there is a very good scale at $$\kappa $$, and $$\diamond $$ fails along some reflecting stationary subset of $$\kappa ^+\cap \text {cof}(\omega )$$. In this paper, we force over Gitik and Rinot’s model but with a modification of Gitik–Sharon (Proc Am Math Soc 136(1):311, (...) 2008) diagonal Prikry forcing to get this result for $$\kappa =\aleph _{\omega ^2}$$. (shrink)

We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in [8]. We obtain two consistency results showing that certain sequences of regular cardinals${\langle {\kappa _n}\rangle _{n < \omega }}$can have the property that in some generic extension, every ground-model sequence of fixed-cofinality stationary sets${S_n} \subseteq {\kappa _n}$is tightly stationary. The results are obtained using variations of the short-extenders forcing method.

We give a new proof using iterated Prikry forcing of Magidor's theorem that it is consistent to assume that the least strongly compact cardinal is the least supercompact cardinal.

Using work of Devlin and Schindler in conjunction with work on Prikry forcing in a choiceless context done by the author, we show that two choiceless cardinal patterns have consistency strength of at least one Woodin cardinal.

We construct a model where every increasing ω-sequence of regular cardinals carries a mutually stationary sequence which is not tightly stationary, and show that this property is preserved under a class of Prikry-type forcings. Along the way, we give examples in the Cohen and Prikry models of ω-sequences of regular cardinals for which there is a non-tightly stationary sequence of stationary subsets consisting of cofinality ω_1 ordinals, and show that such stationary sequences are mutually stationary in the presence (...) of interleaved supercompact cardinals. (shrink)

It is known that if $\kappa < \lambda$ are such that κ is indestructibly supercompact and λ is 2λ supercompact, then level by level equivalence between strong compactness and supercompactness fails. We prove a theorem which points towards this result being best possible. Specifically, we show that relative to the existence of a supercompact cardinal, there is a model for level by level equivalence between strong compactness and supercompactness containing a supercompact cardinal κ in which κ’s strong compactness is indestructible (...) under κ-directed closed forcing. (shrink)

We show that it is consistent, relative to a supercompact limit of supercompact cardinals, for the least strongly compact cardinal k to be both the least measurable cardinal and to be > 2k supercompact.