Related papers: Coherent forests
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…
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 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,…
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…
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…
We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.
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…
We propose a parameterized proxy principle from which $\kappa$-Souslin trees with various additional features can be constructed, regardless of the identity of $\kappa$. We then introduce the microscopic approach, which is a simple method…
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…
Starting from the existence of a weakly compact cardinal, we build a generic extension of the universe in which $GCH$ holds and all $\aleph_2$-Aronszajn trees are special and hence there are no $\aleph_2$-Souslin trees. This result answers…
We prove that every weakly square compact cardinal is a strong limit cardinal. We also study Aronszajn trees with no uncountable finitely branching subtrees, characterizing them in terms of being Lindel\"of with respect to a particular…
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…
We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…
An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing such a tree,…
Assuming the existence of a strong cardinal and a measurable cardinal above it, we construct a model of $ZFC$ in which for every singular cardinal $\delta$, $\delta$ is strong limit, $2^\delta=\delta^{+3}$ and the tree property at…
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.
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…
A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a…
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…
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…