English
Related papers

Related papers: Aronszajn trees, square principles, and stationary…

200 papers

For any $2 \le n < \omega$, we introduce a forcing poset using generalized promises which adds a normal $n$-splitting subtree to a $(\ge \! n)$-splitting normal Aronszajn tree. Using this forcing poset, we prove several consistency results…

Logic · Mathematics 2025-09-17 John Krueger

We generalise Jensen's result on the incompatibility of subcompactness with square. We show that alpha^+-subcompactness of some cardinal less than or equal to alpha precludes square_alpha, but also that square may be forced to hold…

Logic · Mathematics 2014-10-01 Andrew D. Brooke-Taylor , Sy-David Friedman

We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $\omega_1^{\omega_1}$. First, we will show that none of these classes have the Baire property…

Logic · Mathematics 2019-06-04 Sy-David Friedman , Dániel T. Soukup

We show that $\mathsf{PFA}$ (Proper Forcing Axiom) implies that adding any number of Cohen subsets of $\omega$ will not add an $\omega_2$-Aronszajn tree or a weak $\omega_1$-Kurepa tree, and moreover no $\sigma$-centered forcing can add a…

Logic · Mathematics 2022-08-05 Radek Honzik , Chris Lambie-Hanson , Šárka Stejskalová

We improve previous work on the consistency strength of mutually stationary sequences of sets concentrating on points with divergent cofinality building on previous work by Adolf, Cox and Welch. Specifically, we have greatly reduced our…

Logic · Mathematics 2019-08-06 Dominik Adolf

We prove that $\mu=\mu^{<\mu}$, $2^\mu=\mu^+$ and ``there is a non reflecting stationary subset of $\mu^+$ composed of ordinals of cofinality $<\mu$'' imply that there is a $\mu$-complete Souslin tree on $\mu^+$.

Logic · Mathematics 2008-02-03 Menachem Kojman

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

Logic · Mathematics 2015-07-22 Ari Meir Brodsky

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

Logic · Mathematics 2024-11-20 James Holland

It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with his Basis Theorem for linear orders of…

Logic · Mathematics 2024-10-14 Tanmay Inamdar , Assaf Rinot

Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.

Logic · Mathematics 2009-09-25 Menachem Magidor , Saharon Shelah

A forest is a generalization of a tree, and here we consider the Aronszajn and Suslin properties for forests. We focus on those forests satisfying coherence, a local smallness property. We show that coherent Aronszajn forests can be…

Logic · Mathematics 2019-01-07 Monroe Eskew

Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…

Logic · Mathematics 2021-04-20 Assaf Rinot

For $n<\omega$, we say that the $\Pi^1_n$-reflection principle holds at $\kappa$ and write $\text{Refl}_n(\kappa)$ if and only if $\kappa$ is a $\Pi^1_n$-indescribable cardinal and every $\Pi^1_n$-indescribable subset of $\kappa$ has a…

Logic · Mathematics 2021-04-29 Brent Cody

The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not depend on the nature of the (regular uncountable)…

Logic · Mathematics 2025-09-09 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

Suppose that $T^*$ is an $\omega_1$-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA($T^*$) for proper forcings which preserve these properties of $T^*$. We prove that PFA($T^*$) implies many of the strong…

Logic · Mathematics 2020-04-28 John Krueger

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

Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $< C_\alpha | \alpha < \lambda^+ >$ with the following remarkable guessing property:…

Logic · Mathematics 2011-05-17 Assaf Rinot

We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…

Logic · Mathematics 2025-04-10 Assaf Rinot , Zhixing You , Jiachen Yuan

We prove a variety of theorems about stationary set reflection and concepts related to internal approachability. We prove that an implication of Fuchino-Usuba relating stationary reflection to a version of Strong Chang's Conjecture cannot…

Logic · Mathematics 2023-06-22 Sean D. Cox