Related papers: An almost Kurepa Suslin tree with strongly non-sat…

We introduce an abstract framework for forcing over a free Suslin tree with suborders of products of forcings which add some structure to the tree using countable approximations. The main ideas of this framework are consistency, separation,…

It is consistent that there exists a Souslin tree $T$ such that after forcing with it, $T$ becomes an almost Souslin Kurepa tree. This answers a question of Zakrzewski.

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…

We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any…

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$.…

We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…

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…

Building on recent work of Krueger and the second author, we prove the consistency of the Guessing Model Principle at $\omega_2$ together with the existence of an almost Kurepa Suslin tree. In particular, it is consistent that the Guessing…

We introduce the idea of a weakly entangled linear order, and show that it is consistent for a Suslin line to be weakly entangled. We generalize the notion of entangled linear orders to $\omega_1$-trees, and prove that an $\omega_1$-tree is…

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…

We introduce a variant of the Kurepa family. We then use one such family to construct a ccc indestructible property associated with a complete coherent Suslin tree $S$. Moreover, in every ccc forcing extension that preserves Suslin of $S$,…

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…

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…

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…

We show that the existence of an almost Souslin Kurepa tree is consistent with $ZFC$. We also prove their existence in $L$. These results answer two questions from Zakrzewski.

We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…

We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…

The strong thin tree conjecture states that every $k$-edge-connected graph $G$ contains an $O(1/k)$-thin spanning tree, meaning a spanning tree which contains at most an $O(1/k)$ fraction of the edges across each cut in $G$. This conjecture…

The collection of branches (maximal linearly ordered sets of nodes) of the tree ${}^{<\omega}\omega$ (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal -- for example, any level of the tree…

Let $T$ be a tree rooted at $r$. Two vertices of $T$ are related if one is a descendant of the other; otherwise, they are unrelated. Two subsets $A$ and $B$ of $V(T)$ are unrelated if, for any $a\in A$ and $b\in B$, $a$ and $b$ are…