English
Related papers

Related papers: The strong Prikry property

200 papers

We show that while the length $\omega$ iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Prikry forcing, it is consistent that no iteration of length greater than $\omega$ (of the same ultrafilter…

Logic · Mathematics 2017-07-24 Gunter Fuchs , Joel David Hamkins

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…

Logic · Mathematics 2025-11-12 William Adkisson , Omer Ben Neria

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

Logic · Mathematics 2015-03-20 Joel David Hamkins , Daniel Evan Seabold

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…

Logic · Mathematics 2026-04-22 Tom Benhamou , Gabriel Goldberg

A set X which is a subset of the Cantor set has property (s) (Marczewski (Spzilrajn)) iff for every perfect set P there exists a perfect set Q contained in P such that Q is a subset of X or Q is disjoint from X. Suppose U is a nonprincipal…

Logic · Mathematics 2007-05-23 Arnold W. Miller

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.

Logic · Mathematics 2021-09-22 Tom Benhamou , Moti Gitik

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…

Logic · Mathematics 2023-08-11 Yair Hayut

We define a version of Gitik-Sharon diagonal Prikry forcing using a strongly compact cardinal, and prove its basic properties.

Logic · Mathematics 2019-12-19 Mohammad Golshani

We analyze the intermediate models of the strongly compact Prikry forcing. We exhibit a simple combinatorial property which, for a given supercompact cardinal $\kappa$, characterize the projections of all projections of the strongly compact…

Logic · Mathematics 2026-05-12 Tom Benhamou , Sebastiano Thei , Ben-Zion Weltsch

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

Logic · Mathematics 2025-03-07 Francesco Parente , Matteo Viale

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…

Logic · Mathematics 2017-03-07 David Chodounský , Osvaldo Guzmán , Michael Hrušák

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…

Logic · Mathematics 2023-01-31 Moti Gitik , Eyal Kaplan

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…

Logic · Mathematics 2017-10-31 Chris Lambie-Hanson

We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…

Logic · Mathematics 2023-07-04 Paolo Lipparini

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…

Logic · Mathematics 2022-02-11 Eyal Kaplan

We study the structure of the Rudin-Frolik order on countably complete ultrafilters under the assumption that this order is directed. This assumption, called the Ultrapower Axiom, holds in all known canonical inner models. It turns out that…

Logic · Mathematics 2018-10-11 Gabriel Goldberg

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Logic · Mathematics 2020-05-27 Alejandro Poveda , Assaf Rinot , Dima Sinapova

In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are…

Logic · Mathematics 2022-01-19 Alejandro Poveda , Assaf Rinot , Dima Sinapova

We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…

Logic · Mathematics 2021-05-13 Piotr Borodulin-Nadzieja , Katarzyna Cegiełka

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…

Logic · Mathematics 2021-05-26 Tom Benhamou
‹ Prev 1 2 3 10 Next ›