Related papers: On Easton support iteration of Prikry type forcing…
We continue Gitik, Kanovei and Koepke's work and study sets in generic extensions by the Magidor forcing and by the Prikry forcing with non-normal ultrafilters.
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…
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…
We work with symmetric inner models of forcing extensions based on strongly compact Prikry forcing to extend some known results.
In this paper, we answer a question asked in "A minimal Prikry type forcing for singularizing a measurable cardinal" regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For…
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 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.,…
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…
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 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 extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
In this paper, we introduce several classes of Prikry-type forcing notions, two of which are used to produce minimal generic extensions, and the third is applied in $\alpha$-recursion theory to produce minimal covers. The first forcing as a…
This paper is meant to present in a coherent way several instances of quite common phenomena that was first identified (independently) by Bukovsk\'y and Dehornoy. We present the basic result for Prikry type forcing and show how to extend it…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
We propose a uniform method of constructing ultrafilter extensions from canonical models, which is based on the similarity between ultrafilters and maximal consistent sets. This method can help us understand why the known ultrafilter…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
In this paper, we study a special type of ultrafilter which we call Shelah ultrafilter. We show that it is possible to add a Shelah ultrafilter using a special forcing notion. We also show that Shelah ultrafilters turn out to be…
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 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.
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.