English
Related papers

Related papers: Diagonal supercompact Radin forcing

200 papers

A club consisting of former regulars is added to an inaccessible cardinal, without changing cofinalities outside it. The initial assumption is optimal. A variation of the Radin forcing without a top measurable cardinal is introduced for…

Logic · Mathematics 2022-06-14 Moti Gitik , Sittinon Jirattikansakul

We consider compactness characterizations of large cardinals. Based on results of Benda \cite{b-sccomp}, we study compactness for omitting types in various logics. In $\bL_{\kappa, \kappa}$, this allows us to characterize any large cardinal…

Logic · Mathematics 2019-03-19 Will Boney

Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal $\kappa$ becomes superdestructible---any further ${<}\kappa$-closed forcing which adds a subset to…

Logic · Mathematics 2016-07-05 Joel David Hamkins

We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_\theta,\mathfrak{p}_\theta,\mathfrak{g}_\theta,\mathfrak{r}_\theta,\mathfrak{t}_\theta$ at uncountable regular…

Logic · Mathematics 2021-02-02 Omer Ben-Neria , Shimon Garti

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 present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…

Logic · Mathematics 2025-10-29 Ben De Bondt , Boban Velickovic

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

Logic · Mathematics 2017-06-27 Yoav Ben Shalom

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

Logic · Mathematics 2024-01-30 Chris Lambie-Hanson , Assaf Rinot , Jing Zhang

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

Logic · Mathematics 2016-05-03 Jacob Davis

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

Logic · Mathematics 2013-07-24 Moti Gitik , Saharon Shelah

Starting from a model with a Laver-indestructible supercompact cardinal $\kappa$, we construct a model of $ZF+DC_{\kappa}$ where there are no $\kappa$-mad families.

Logic · Mathematics 2019-06-25 Haim Horowitz , Saharon Shelah

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

Logic · Mathematics 2021-11-17 Tom Benhamou , Moti Gitik , Yair Hayut

The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa$ is…

Logic · Mathematics 2023-12-19 William Adkisson

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

Logic · Mathematics 2023-06-22 Gunter Fuchs

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

Logic · Mathematics 2026-04-02 Tom Benhamou , James Cummings , Gabriel Goldberg , Yair Hayut , Alejandro Poveda

We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of…

Logic · Mathematics 2016-09-06 Arthur Apter , Saharon Shelah

Suppose that there is a measurable cardinal. If \aleph_\omega is a strong limit cardinal, but the power of \aleph_\omega is bigger than \aleph_{\omega_1}, then there is an inner model with a Woodin cardinal. Modulo the need of the…

Logic · Mathematics 2007-05-23 Ralf Schindler

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…

Combinatorics · Mathematics 2019-03-20 Roman Glebov , Daniel Kral , Jan Volec