English
Related papers

Related papers: The Tree Property up to $\aleph_{\omega^2}$

200 papers

Assuming the consistency of ZFC with appropriate large cardinal axioms we produce a model of ZFC where $\aleph_\omega$ is a strong limit cardinal and the inner model $L(\mathcal{P}(\aleph_\omega))$ satisfies the following properties: (1)…

Logic · Mathematics 2026-05-08 Alejandro Poveda , Sebastiano Thei

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

If $\kappa$ is regular and $2^{<\kappa}\leq\kappa^+$, then the existence of a weakly presaturated ideal on $\kappa^+$ implies $\square^*_\kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on…

Logic · Mathematics 2020-10-01 Sean Cox , Monroe Eskew

Assuming an inaccessible cardinal kappa, there is a generic extension in which MA + 2^{aleph_0} = kappa holds and the reals have a Delta^2_1 well-ordering.

Logic · Mathematics 2008-02-03 Uri Abraham , Saharon Shelah

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

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

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

Combinatorics · Mathematics 2015-06-24 Art M. Duval , Caroline J. Klivans , Jeremy L. Martin

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

Logic · Mathematics 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

We show that if we add any number of Cohen reals to the ground model then, in the generic extension, a locally compact scattered space has at most (2^{aleph_0})^V many levels of size omega. We also give a complete ZFC characterization of…

Logic · Mathematics 2007-05-23 István Juhász , Saharon Shelah , Lajos Soukup , Zoltán Szentmiklóssy

For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

We show that for any regular cardinal $\kappa$, $\square_{\kappa, 2}$ is consistent with "all $\kappa^+$-Aronszajn trees are special." By a result of Shelah and Stanley this is optimal in the sense that $\square_{\kappa, 2}$ may not be…

Logic · Mathematics 2019-04-01 John Susice

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…

Computer Science and Game Theory · Computer Science 2014-10-10 Adam Clearwater , Clemens Puppe , Arkadii Slinko

Assuming $\kappa$ is a supercompact cardinal and $\lambda$ is an inaccessible cardinal above it, we present an idea due to Magidor, to find a generic extension in which $\kappa=\aleph_\omega$ and $\lambda=\aleph_{\omega+1}.$

Logic · Mathematics 2017-11-15 Mohammad Golshani

Suppose that kappa is a singular cardinal of cofinality omega and GCH holds. Assume that for every n<omega the set of alphas with o(alpha)>= alpha^{+n} is unbounded in kappa.Then there is a cardinal preserving extension satisfying…

Logic · Mathematics 2016-09-06 Moti Gitik

We show that if $\kappa < \aleph_\omega$ Cohen reals are added to a model of $\mathsf{CH}$, then there are nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$ in the extension. Under some further hypotheses on the ground model,…

Logic · Mathematics 2026-03-10 Will Brian , Alan Dow

A ccc-generically supercompact cardinal $\kappa$ can be smaller than or equal to the continuum. On the other hand, such a cardinal $\kappa$ still satisfies diverse largeness properties, like that it is a stationary limit of ccc-generically…

Logic · Mathematics 2022-02-17 Sakaé Fuchino , Hiroshi Sakai

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…

Combinatorics · Mathematics 2023-05-24 Thilo Krill , Max Pitz

We investigate the generalized tree properties and guessing model properties introduced by Wei\ss\ and Viale, as well as natural weakenings thereof, studying the relationships among these properties and between these properties and other…

Logic · Mathematics 2023-12-12 Chris Lambie-Hanson , Šárka Stejskalová

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

Probability · Mathematics 2007-05-23 Thomas Duquesne