English
Related papers

Related papers: A virtual five element basis for the uncountable l…

200 papers

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 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

Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…

Logic · Mathematics 2025-06-30 John Krueger , Šárka Stejskalová

A linear order $A$ is called strongly surjective if for every non empty suborder $B \preceq A$, there is an epimorphism from $A$ onto $B$ (denoted by $B \trianglelefteq A$). We show, answering some questions of D\'aniel T. Soukup, that…

Logic · Mathematics 2025-10-16 Lucas Polymeris , Carlos Martinez-Ranero

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

In this paper we aim to compare Kurepa trees and Aronszajn trees. Moreover, we analyze the affect of large cardinal assumptions on this comparison. Using the the method of walks on ordinals, we will show it is consistent with ZFC that there…

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

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

Logic · Mathematics 2023-06-22 Gunter Fuchs

Assuming the consistency of a weakly compact cardinal above a regular uncountable cardinal $\mu$, we prove the consistency of the existence of a wide $\mu^+$-Aronszajn tree, i.e. a tree of height and cardinality $\mu^+$ with no branches of…

Logic · Mathematics 2025-12-05 Omer Ben-Neria , Siiri Kivimäki , Menachem Magidor , Jouko Väänänen

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

Logic · Mathematics 2020-03-30 Keegan Dasilva Barbosa

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

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

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

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

Logic · Mathematics 2020-08-12 Corey Bacal Switzer

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 introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception…

Combinatorics · Mathematics 2026-03-02 Garrett Ervin , Alberto Marcone , Thilo Weinert

A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering…

Logic · Mathematics 2018-01-31 Dániel T. Soukup

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

A wide Aronszajn tree is a tree of size $\aleph_1$ with no uncountable branches. Assuming the consistency of the existence of a weakly compact cardinal, we show the consistency of the existence of a wide Aronszajn tree that is…

Logic · Mathematics 2025-11-11 Siiri Kivimäki

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

Contrary to the expectation arising from the tanglegram Kuratowski theorem of \'E. Czabarka, L.A. Sz\'ekely and S. Wagner [SIAM J. Discrete Math. 31(3): 1732--1750, (2017)], we construct an infinite antichain of planar tanglegrams with…

Combinatorics · Mathematics 2020-07-15 Éva Czabarka , Stephen J. Smith , László A. Székely
‹ Prev 1 2 3 10 Next ›