English
Related papers

Related papers: Aronszajn trees and maximality

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 prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

Logic · Mathematics 2022-12-06 Dávid Uhrik

Assuming Jenson's principle diamond: Whenever B is a totally imperfect set of real numbers, there is special Aronszajn tree with no continuous order preserving map into B.

Logic · Mathematics 2010-08-30 Kenneth Kunen , Jean A. Larson , Juris Steprāns

We consider a transitive relation on the power set of $\omega_1$ and show if there is a maximal element with respect to this relation then there is a Kurepa tree with no Aronszajn subtree. We also show that if there is a maximal subset of…

Logic · Mathematics 2023-10-20 Hossein Lamei Ramandi , Stevo Todorcevic

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 consider a class of compacta X such that the maps from X onto metric compacta define an Aronszajn tree of closed subsets of X.

General Topology · Mathematics 2008-06-30 Joan E. Hart , Kenneth Kunen

We prove that for every Aronzsajn line A and every Countryman line C, there is a proper forcing extension in which A contains an isomorphic copy of either C or its converse C*. As a corollary, we obtain answers to several related questions…

Logic · Mathematics 2025-10-23 John Krueger , Justin Tatch Moore

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…

Logic · Mathematics 2024-11-26 Gunter Fuchs , Kaethe Minden

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than $\aleph_1$, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all…

Logic · Mathematics 2018-06-12 Spencer Unger

The following is consistent: There is a stationary set S such that every Aronszajn tree is S-*-special and there is an Aronszajn tree T such that for every unbounded E we have T is not E-special. This answers a question of Shelah (Proper…

Logic · Mathematics 2007-05-23 Chaz Schlindwein

We show that under certain circumstances wide Aronszajn trees can be specialized iteratively without adding reals. We then use this fact to study forcing axioms compatible with CH and list some open problems.

Logic · Mathematics 2020-05-29 Corey Bacal Switzer

Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…

Logic · Mathematics 2023-01-10 Corey Bacal Switzer

It is proved that the consistency strength of having definable tree property for successors of all regular cardinals is the consistency strength of having proper class many small large cardinals which are defined very similar to…

Logic · Mathematics 2015-11-24 Ali Sadegh Daghighi , Massoud Pourmahdian

We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of…

Logic · Mathematics 2023-07-19 Rahman Mohammadpour

We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

We construct a model of set theory in which there exists a Suslin tree and satisfies that any two normal Aronszajn trees, neither of which contains a Suslin subtree, are club isomorphic. We also show that if $S$ is a free normal Suslin…

Logic · Mathematics 2025-04-16 John Krueger

The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…

Logic · Mathematics 2023-10-10 Mohammad Golshani , Mostafa Mirabi

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with…

Combinatorics · Mathematics 2013-04-09 Clemens Heuberger , Stephan Wagner

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

Logic · Mathematics 2017-08-08 Mohammad Golshani , Rahman Mohammadpour

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of notion of saturation of Aronszajn trees considered by Koenig, Larson, Moore…

Logic · Mathematics 2016-03-02 Boban Velickovic , Giorgio Venturi