Some combinatorial properties of splitting trees
Logic
2021-06-15 v1
Abstract
We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we determine the value of cardinal invariants after an -length countable support iteration of splitting forcing.
Cite
@article{arxiv.2106.07511,
title = {Some combinatorial properties of splitting trees},
author = {Jonathan Schilhan},
journal= {arXiv preprint arXiv:2106.07511},
year = {2021}
}