Abstract
An -Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an -Souslin tree.
In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a -Souslin tree. This class includes Prikry, Magidor, and Radin forcing.
Citation
Ari Meir Brodsky. Assaf Rinot. "More Notions of Forcing Add a Souslin Tree." Notre Dame J. Formal Logic 60 (3) 437 - 455, August 2019. https://doi.org/10.1215/00294527-2019-0011
Information