\(\mathrm{PFA}(S)[S]\) and countably compact spaces (Q2405088)

The paper under review investigates the status of undecidable assertions concerning countably compact spaces within models of set theory obtained by starting with a particular kind of Souslin tree \(S\), iterating partial orders that do not destroy \(S\) and then forcing with \(S\). More precisely, the set theoretical machinery is given by \(\text{PFA}(S)\) (a forcing axiom which restricts \(\text{PFA}\) to the class of posets that are proper and preserve the Souslinity of a fixed coherent Souslin tree \(S\)) and \(\text{PFA}(S)[S]\), which refers to forcing over a model of \(\text{PFA}(S)\) with \(S\). It is remarked by the authors that models of \(\text{PFA}(S)[S]\) are usually obtained using a supercompact cardinal. The main results of the paper under review are: (i) a proof that \(\text{PFA}(S)[S]\) implies countably tight perfect pre-images of \(\omega_1\) include copies of \(\omega_1\); and (ii) a demonstration that a previously known consequence of \(\text{PFA}(S)[S]\) (``locally compact, perfectly normal spaces are paracompact'', [\textit{P. Larson} and \textit{F. Tall}, Fundam. Math. 210, No. 3, 285--300 (2010; Zbl 1211.54034)]) can be obtained without the use of large cardinals.