Related papers: Sets in Prikry and Magidor Generic Extensions
We consider here Easton support iterations of Prikry type forcing notions. New ways of constructing normal ultrafilters in extensions are presented. It turns out that, in contrast with other supports, seemingly unrelated measures or…
We develop the non-normal variations of two classical Prikry-type forcings; namely, Magidor and Radin forcings. We generalize the fact that the non-normal Prikry forcing is a projection of the extender-based to a coordinate of the extender…
We generalize results of Gitik, Dzamonja-Shelah, and Magidor-Sinapova on the existence of pseudo-Prikry sequences, which are sequences that approximate the behavior of the generic objects introduced by Prikry-type forcings, in outer models…
We continue the work done by the authors and before that by the second author, Kanovei and koepke. We prove that for every set of ordinals $A$ in a Magidor-Radin generic extension using a coherent sequence such that…
We characterize sums of normal ultrafilters after the Magidor iteration (product) of Prikry forcings over a discrete set of measurable cardinals. We apply this to show that the weak Ultrapower Axiom is not equivalent to the Ultrapower…
We study the Magidor iteration of Prikry forcings below a measurable limit of measurables $ \kappa $. We first characterize all the normal measures $ \kappa $ carries in the generic extension, building on and extending the main result of…
We examine the existence (and mostly non-existence) of fresh sets in commonly used iterations of Prikry type forcing notions. Results of [4] are generalized. As an application, a question of a referee of [9] is answered. In addition…
We define extender sequences, generelizing measure sequences from Radin Forcing. Using the extender sequences we combine Gitik-Magidor forcing for adding many Prikry sequences with Radin forcing. This forcing satisfies Prikry like…
We work with symmetric inner models of forcing extensions based on strongly compact Prikry forcing to extend some known results.
I isolate a combinatorial property of a poset $\mathbb{P}$ that I call the strong Prikry property, which implies the existence of an ultrafilter on the complete Boolean algebra $\mathbb{B}$ of $\mathbb{P}$ such that one inclusion of the…
We present a modification to the Prikry on Extenders forcing notion allowing the blow up of the power set of a large cardinal, change its cofinality to omega without adding bounded subsets, working directly from arbitrary extender (e.g.,…
The extender based Magidor-Radin forcing is being generalized to supercompact type extenders.
In this paper we continue the study of equivalence of generics filters started by Smythe in [Smy22]. We fully characterize those forcing posets for which the corresponding equivalence of generics is smooth using the purely topological…
We continue the work done by Gitik, Kanovei, Koepke, and later by the authors. We prove that for every set $A$ in a Magidor-Radin generic extension using a coherent sequence such that $o^{\vec{U}}(\kappa)<\kappa$, there is a subset $C'$ of…
We study which $\kappa$-distributive forcing notions of size $\kappa$ can be embedded into tree Prikry forcing notions with $\kappa$-complete ultrafilters under various large cardinal assumptions. An alternative formulation -- can the…
We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias--Prikry forcings with summable ideals are all mutually…
We study the nonstationary-support iteration of Prikry forcings below a measurable cardinal \kappa, characterizing all the normal measures it carries in the generic extension. We then analyze the restriction of ultrapower embeddings, taken…
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers. We show that similar methods can be used to characterize the…
We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.