English

Specializing trees and answer to a question of Williams

Logic 2020-03-11 v5

Abstract

We show that if cf(20)=1,cf(2^{\aleph_0})=\aleph_1, then any non-trivial 1\aleph_1-closed forcing notion of size 20\leq 2^{\aleph_0} is forcing equivalent to Add(1,1),Add(\aleph_1, 1), the Cohen forcing for adding a new Cohen subset of ω1.\omega_1. We also produce, relative to the existence of suitable large cardinals, a model of ZFCZFC in which 20=22^{\aleph_0}=\aleph_2 and all 1\aleph_1-closed forcing notion of size 20\leq 2^{\aleph_0} collapse 2,\aleph_2, and hence are forcing equivalent to Add(1,1).Add(\aleph_1, 1). These results answer a question of Scott Williams from 1978. We also extend a result of Todorcevic and Foreman-Magidor-Shelah by showing that it is consistent that every partial order which adds a new subset of 2,\aleph_2, collapses 2\aleph_2 or 3.\aleph_3.

Keywords

Cite

@article{arxiv.1708.02719,
  title  = {Specializing trees and answer to a question of Williams},
  author = {Mohammad Golshani and Saharon Shelah},
  journal= {arXiv preprint arXiv:1708.02719},
  year   = {2020}
}
R2 v1 2026-06-22T21:10:09.462Z