Rado's conjecture implies that all stationary set preserving forcings are semiproper (Q2853979)

The author's main result is: RC implies \(\text{CC}^{**}\).NEWLINENEWLINEHere, RC (Rado's conjecture) is: If \(T\) is a tree such that all subtrees of \(T\) of cardinality \(\aleph_1\) are special, then \(T\) is special; and \(\text{CC}^{**}\) is the following generalization of a conjecture of Chang: For all \(\lambda\geq\omega_2\), there are arbitrarily large regular cardinals \(\theta > \lambda\) such that for all well-orderings \(< \) of \(H_\theta\) and for all \(a\in [\lambda]^{\omega_1}\) and for all countable \(X\prec \langle H_\theta; \in, <\rangle\) there is a countable \(Y\prec \langle H_\theta; \in, <\rangle\) such that \(X\subset Y\) and \(X\cap\omega_1= Y\cap\omega_1\) and there is some \(b\in Y\cap [\lambda]^{\omega_1}\) such that \(a\subset b\).NEWLINENEWLINEA previous theorem of Doebler and Schindler established that \(\text{CC}^{**}\), Semistationary Reflection (SSR) and the statement \((\dagger)\) ``every stationary set-preserving forcing is semiproper'' are equivalent. So as a corollaries to his main result, the author has: RC implies \((\dagger)\) and RC implies SSR. In the course of his proof, the author shows that RC entails winning strategies in cut and choose games.