English
Related papers

Related papers: The subcompleteness of diagonal Prikry forcing

200 papers

An optimal extension of the Jensen covering lemma, within the limits imposed by Prikry forcing, is proved. If L[E] is an "iterable" weasel with no measurable cardinals, then either L[E] has "indiscernibles", or every uncountable set of…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , W. Hugh Woodin

We present a new version of the Friedman-Magidor theorem: for every measurable cardinal $\kappa$ and $\tau\leq\kappa^{++}$, there exists a forcing extension $V\subseteq V[G]$ such that any normal measure $U\in V$ on $\kappa$ has exactly…

Logic · Mathematics 2025-09-11 Eyal Kaplan

We investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of…

Logic · Mathematics 2007-05-23 Pavel Hrubes

In the context of large cardinals, the classical diamond principle Diamond_kappa is easily strengthened in natural ways. When kappa is a measurable cardinal, for example, one might ask that a Diamond_kappa sequence anticipate every subset…

Logic · Mathematics 2007-05-23 Joel David Hamkins

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Logic · Mathematics 2020-03-23 Matteo Viale

If kappa is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which Diamond_kappa(REG) fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin,…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Mirna Džamonja

In this paper we extend the works of Tancer and of Malgouyres and Franc\'es, showing that $(d,k)$-collapsibility is NP-complete for $d\geq k+2$ except $(2,0)$. By $(d,k)$-collapsibility we mean the following problem: determine whether a…

Computational Geometry · Computer Science 2019-04-08 Giovanni Paolini

In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special…

Logic · Mathematics 2016-07-07 Peter A. Cholak , Damir D. Dzhafarov , Mariya I. Soskova

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

Logic · Mathematics 2007-05-23 Itay Neeman , Jindrich Zapletal

We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…

Logic · Mathematics 2020-05-07 Yair Hayut , Asaf Karagila

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

Logic · Mathematics 2011-10-18 Bernhard Irrgang

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

A subset $S$ of initially infected vertices of a graph $G$ is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects…

Combinatorics · Mathematics 2017-06-06 Thomas Kalinowski , Nina Kamčev , Benny Sudakov

The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…

Logic · Mathematics 2024-05-29 Rodrigo Carvalho , Tanmay Inamdar , Assaf Rinot

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

Logic · Mathematics 2015-03-27 Su Gao , Steve Jackson , Edward Krohne , Brandon Seward

We unveil new patterns of Structural Reflection in the large-cardinal hierarchy below the first measurable cardinal. Namely, we give two different characterizations of strongly unfoldable and subtle cardinals in terms of a weak form of the…

Logic · Mathematics 2023-11-07 Joan Bagaria , Philipp Lücke

Motivated by the goal of constructing a model in which there are no $\kappa$-Aronszajn trees for any regular $\kappa>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square…

Logic · Mathematics 2020-05-22 Omer Ben-Neria , Chris Lambie-Hanson , Spencer Unger

We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…

Logic · Mathematics 2007-05-23 Ralf Schindler

The Necessary Maximality Principle for c.c.c. forcing asserts that any statement about a real in a c.c.c. extension that could become true in a further c.c.c. extension and remain true in all subsequent c.c.c. extensions, is already true in…

Logic · Mathematics 2007-05-23 Joel David Hamkins , W. Hugh Woodin

Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…

Logic · Mathematics 2009-09-25 Sy D. Friedman