English
Related papers

Related papers: A ccc indestructible construction with CH

200 papers

Despite being an established notion in the large cardinal hierarchy, results about Woodin cardinals are sparse in the literature. Here we gather known results about the preservation of Woodin cardinals under certain forcing extensions, as…

Logic · Mathematics 2017-11-09 Stamatis Dimopoulos

We construct an indecomposable continuum with exactly one strong non-cut point. The method is an adaptation of Bellamy $[1]$. We start with an $\omega_1$-chain of indecomposable metric continua and retractions. The inverse limit is an…

General Topology · Mathematics 2020-07-21 Daron Anderson

Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one…

Logic · Mathematics 2018-03-06 Natasha Dobrinen , Dan Hathaway

Under $\text{CH}$ we construct a partition of Baire space into compact sets, which is indestructible by countably supported iteration and product of Sacks forcing of any length, answering a question of Newelski. Further, we present an…

Logic · Mathematics 2025-05-08 Vera Fischer , Lukas Schembecker

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor

Answering a question of Usuba, we show that an extendible cardinal can be preserved by a set forcing that is not a small forcing.

Logic · Mathematics 2021-08-17 Gabriel Goldberg

We present a detailed introduction of the theory of constructible sheaf complexes in the complex algebraic and analytic setting. All concepts are illustrated by many interesting examples and relevant applications, while some important…

Algebraic Geometry · Mathematics 2021-06-03 Laurenţiu G. Maxim , Jörg Schürmann

Let $T^*$ be an almost Suslin tree, that is, an Aronszajn tree with no stationary antichains. Krueger introduced a forcing axiom, $\mathrm{PFA}(T^*)$, for the class of proper forcings that preserve that $T^*$ is almost Suslin. He showed…

Logic · Mathematics 2025-11-05 Carlos Martínez-Ranero , Lucas Polymeris

We define a countable antichain condition (ccc) property for partial orderings, weaker than precalibre-$\aleph_1$, and show that Martin's axiom restricted to the class of partial orderings that have the property does not imply Martin's…

Logic · Mathematics 2015-02-20 Joan Bagaria , Saharon Shelah

We answer a question from Raghavan and Stepr{\=a}ns' paper on weakly tight families by showing that $\mathfrak{s} = {\mathfrak{s}}_{\omega, \omega}$. Then we use this to construct a completely separable maximal almost disjoint family under…

Logic · Mathematics 2019-08-15 Heike Mildenberger , Dilip Raghavan , Juris Steprāns

We investigate the consistency strength of the statement: $\kappa$ is weakly compact and there is no tree on $\kappa$ with exactly $\kappa^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed…

Logic · Mathematics 2021-09-22 Yair Hayut , Sandra Müller

Suppose $\kappa$ is a singular strong limit cardinal of countable cofinality and let $\langle \kappa_{n}: n<\omega \rangle$ be an incrasing sequence of regular cardinals cofinal in $\kappa$. We show that if $cf(2^\kappa)= \kappa^+$, then…

Logic · Mathematics 2021-07-12 Mohammad Golshani , Rahman Mohammadpour

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…

Logic · Mathematics 2025-03-24 Maxwell Levine

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

Logic · Mathematics 2018-11-14 James Cummings , Mirna Džamonja , Itay Neeman

In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

We study ultrafilters on countable sets and reaping families which are indestructible by Sacks forcing. We deal with the combinatorial characterization of such families and we prove that every reaping family of size smaller than the…

Logic · Mathematics 2021-10-18 David Chodounský , Osvaldo Guzmán , Michael Hrušák

We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…

Combinatorics · Mathematics 2025-04-22 Jun-Ting Hsieh , Alexander Lubotzky , Sidhanth Mohanty , Assaf Reiner , Rachel Yun Zhang

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Logic · Mathematics 2022-02-18 Rahman Mohammadpour

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 show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins
‹ Prev 1 4 5 6 7 8 10 Next ›