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)

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.

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.

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

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)

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 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)

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

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 show how to construct Gitik’s short extenders gap-3 forcing using a morass, and that the forcing notion is of Prikry type.

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.

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal [Formula: see text] and a cardinal [Formula: see text], we say that [Formula: see text] has the [Formula: see text]-gluing property if every sequence of [Formula: see text]-many [Formula: see text]-complete ultrafilters on [Formula: see text] can be glued into an extender. We show that every [Formula: see text]-compact cardinal has the [Formula: see text]-gluing property, yet non-necessarily the [Formula: see text]-gluing property. Finally, we (...) compute the exact consistency strength for [Formula: see text] to have the [Formula: see text]-gluing property — this being [Formula: see text]. (shrink)

Journal of Mathematical Logic, Ahead of Print. We address the question of consistency strength of certain filters and ultrafilters which fail to satisfy the Galvin property. We answer questions [Benhamou and Gitik, Ann. Pure Appl. Logic 173 (2022) 103107; Questions 7.8, 7.9], [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Question 5] and improve theorem [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Theorem 2.3].

Journal of Mathematical Logic, Ahead of Print. We introduce a new compactness principle which we call the gluing property. For a measurable cardinal [math] and a cardinal [math], we say that [math] has the [math]-gluing property if every sequence of [math]-many [math]-complete ultrafilters on [math] can be glued into an extender. We show that every [math]-compact cardinal has the [math]-gluing property, yet non-necessarily the [math]-gluing property. Finally, we compute the exact consistency strength for [math] to have the [math]-gluing property — (...) this being [math]. (shrink)

Our aim is to show that it is impossible to find a bound for the power of the first fixed point of the aleph function.

We address the question of consistency strength of certain filters and ultrafilters which fail to satisfy the Galvin property. We answer questions [Benhamou and Gitik, Ann. Pure Appl. Logic 173 (2022) 103107; Questions 7.8, 7.9], [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Question 5] and improve theorem [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Theorem 2.3].

In the first part of the article, we show that if $\omega \le \kappa < \lambda$ are cardinals, ${\kappa ^{ < \kappa }} = \kappa$, and λ is weakly compact, then in $V\left[M {\left} \right]$ the tree property at $$\lambda = \left^{V\left[ {\left} \right]} $$ is indestructible under all ${\kappa ^ + }$-cc forcing notions which live in $V\left[ {{\rm{Add}}\left} \right]$, where ${\rm{Add}}\left$ is the Cohen forcing for adding λ-many subsets of κ and $\left$ is the standard Mitchell forcing for (...) obtaining the tree property at $\lambda = \left^{V\left[ {\left} \right]} $. This result has direct applications to Prikry-type forcing notions and generalized cardinal invariants. In the second part, we assume that λ is supercompact and generalize the construction and obtain a model ${V^{\rm{*}}}$, a generic extension of V, in which the tree property at ${\left^{{V^{\rm{*}}}}}$ is indestructible under all ${\kappa ^ + }$-cc forcing notions living in $V\left[ {{\rm{Add}}\left} \right]$, and in addition under all forcing notions living in ${V^{\rm{*}}}$ which are ${\kappa ^ + }$-closed and “liftable” in a prescribed sense. (shrink)

In [3], Shi proved that there exist incomparable Zermelo degrees at γ if there exists an ω‐sequence of measurable cardinals, whose limit is γ. He asked whether there is a size antichain of Zermelo degrees. We consider this question for the ‐degree structure. We use a kind of Prikry‐type forcing to show that if there is an ω‐sequence of measurable cardinals, then there are ‐many pairwise incomparable ‐degrees, where γ is the limit of the ω‐sequence of measurable cardinals.

A method of iteration of Prikry type forcing notions as well as a forcing for adding clubs is presented. It is applied to construct a model with a measurable cardinal containing a club of former regulars, starting with o(κ) = κ + 1. On the other hand, it is shown that the strength of above is at least o(κ) = κ.

We construct a model in which the singular cardinal hypothesis fails at ℵωℵω. We use characterizations of genericity to show the existence of a projection between different Prikry type forcings.

I argue that imperatives express contents that are both cognitively and semantically related to, but nevertheless distinct from, modal propositions. Imperatives, on this analysis, semantically encode features of planning that are modally specified. Uttering an imperative amounts to tokening this feature in discourse, and thereby proffering it for adoption by the audience. This analysis deals smoothly with the problems afflicting Portner's Dynamic Pragmatic account and Kaufmann's Modal account. It also suggests an appealing reorientation of clause-type theorizing, in which the (...) cognitive act of updating on a typed sentence plays a central role in theorizing about both its semantics and role in discourse. (shrink)

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

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.

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.

We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than $\aleph_{1}$, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is (...) important since a proof using finite supports is more amenable to generalizations to cardinals greater than $\aleph_{1}$. (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.

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)

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.

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)

In the context of proliferation of many logical systems in the area of mathematical logic and computer science, we present a generalization of forcing in institution-independent model theory which is used to prove two abstract results: Downward Löwenheim-Skolem Theorem and Omitting Types Theorem . We instantiate these general results to many first-order logics, which are, roughly speaking, logics whose sentences can be constructed from atomic formulas by means of Boolean connectives and classical first-order quantifiers. These include first-order logic , logic (...) of order-sorted algebras , preorder algebras , as well as their infinitary variants \ , \ , \ . In addition to the first technique for proving OTT, we develop another one, in the spirit of institution-independent model theory, which consists of borrowing the Omitting Types Property from a simpler institution across an institution comorphism. As a result we export the OTP from FOL to partial algebras and higher-order logic with Henkin semantics , and from the institution of \ to \ and \ . The second technique successfully extends the domain of application of OTT to non conventional logical systems for which the standard methods may fail. (shrink)

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.

Pinch force sense plays an important role in the performance of daily finger movements, including tip, key, palmar pinch. The present study investigated the roles of pinch type in the sensation of pinch force among healthy participants in the ipsilateral force reproduction trial. This study instructed forty healthy adult subjects (20 women and 20 men) in producing reference forces at different levels [10, 30, 50% maximal voluntary isometric contraction (MVIC)] by adopting 3 pinch types (tip, key, and palmar pinches) (...) and in reproducing the above force levels with the identical hand. Our study revealed that subjects are significantly more sensitive detecting alterations of pinching forces with tip pinch but not key or palmar pinch under high forces (30 and 50% MVIC) but not at lower force levels (10% MVIC). (shrink)

Slurs are derogatory, and theories of slurs aim at explaining their “derogatory force”. This paper draws a distinction between the type derogatory force and the token derogatory force of slurs. To explain the type derogatory force is to explain why a slur is a derogatory word. By contrast, to explain the token derogatory force is to explain why an utterance of a slur is derogatory. This distinction will be defended by examples in which the type and the (...) token derogatory force come apart. Because of the distinction, an adequate theory of slurs must be plausible for both the type and the token derogatory force. However, I will argue that many theories fail to be plausible for both. In particular, Hom’s combinatorial externalism and the conventional implicature theory offer implausible accounts of the token derogatory force, whereas the prohibitionist theory is insufficient to explain the type derogatory force. (shrink)

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)

We use the spaces T n and E n of complete types and of existential types to investigate various notions which appear in the theory of the algebraic structure of models.

We give characterizations for the sentences "Every $\Sigma^1_2$-set is measurable" and "Every $\Delta^1_2$-set is measurable" for various notions of measurability derived from well-known forcing partial orderings.

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

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

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.

Commitments of “getting to zero” or becoming a regenerative company are raising investor, customer, and employee expectations at a time when businesses are struggling just to reduce negative impacts. Executives are increasingly caught between wanting to build a better world and the reality of managing value‐add activities that continue to harm people and the environment.Businesses need to distinguish between three types of innovation impacts to maintain their credibility and legitimacy. The first is doing less harm, where the goal is to (...) minimize social wrongs and reduce ecological footprints. The second is incremental positive impact, where the goal is to increase prosperity, regenerate nature, and improve wellbeing through initiatives that are typically of limited scope. The third is system‐wide positive impact, where scalable business innovations have a discernible capacity to “move the needle” on social and global challenges such as climate change and social equity.This conceptual paper provides a framework for assessing business innovations by type of impact and the high‐leverage points needed to create desired change at the scale of the whole. (shrink)