English
Related papers

Related papers: Perfect Tree Forcings for Singular Cardinals

200 papers

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

Logic · Mathematics 2021-12-21 Sittinon Jirattikansakul

This paper continues a line of investigation of the Halpern--L\"{a}uchli Theorem at uncountable cardinals. We prove in ZFC that the Halpern--L\"{a}uchli Theorem for one tree of height $\kappa$ holds whenever $\kappa$ is strongly…

Logic · Mathematics 2023-01-03 Natasha Dobrinen , Saharon Shelah

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

Phylogenetically decisive collections of taxon sets have the property that if trees are chosen for each of their elements, as long as these trees are compatible, the resulting supertree is unique. This means that as long as the trees…

Populations and Evolution · Quantitative Biology 2025-05-29 Mareike Fischer , Janne Pott

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…

Logic · Mathematics 2017-10-27 Philipp Lücke , Ralf Schindler , Philipp Schlicht

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

Logic · Mathematics 2022-03-14 Rahman Mohammadpour

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.

Logic · Mathematics 2013-01-28 Laura Fontanella

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

We investigate the notion of strong measure zero sets in the context of the higher Cantor space $2^\kappa$ for $\kappa$ at least inaccessible. Using an iteration of perfect tree forcings, we give two proofs of the relative consistency of \[…

Logic · Mathematics 2025-12-11 Nick Steven Chapman , Johannes Philipp Schürz

The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…

Logic · Mathematics 2007-05-23 Joel David Hamkins

We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…

Logic · Mathematics 2009-09-25 Jörg Brendle

The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…

Combinatorics · Mathematics 2025-03-04 Javad B. Ebrahimi , Babak Ghanbari

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

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

Given a module $X$ and a regular cardinal $\kappa$ we study various notions of $(\kappa,\mathrm{Add}(X))$-freeness and $(\kappa,\mathrm{Add}(X))$-separability. Bearing on appropriate set-theoretic assumptions, we construct a non-trivial…

Rings and Algebras · Mathematics 2024-07-31 Manuel Cortés-Izurdiaga , Alejandro Poveda

Let $(R, \sim )$ be the Rado graph, $Emb (R)$ the monoid of its self-embeddings, $\Pi (R)=\{ f[R]: f\in Emb (R)\}$ the set of copies of $R$ contained in $R$, and ${\mathcal I}_R$ the ideal of subsets of $R$ which do not contain a copy of…

Logic · Mathematics 2017-09-26 Miloš S. Kurilić , Stevo Todorčević

We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…

Logic · Mathematics 2023-01-06 Sakaé Fuchino , Hiroshi Sakai