\(\text{PFA}(S)[S]\) for the masses (Q1676513)

\(\text{PFA}(S)[S]\) is a method to produce models of set theory, invented by Todorčević in 2001. The models are obtained starting with a particular kind of Souslin tree \(S\), iterating partial orders that do not destroy \(S\) and then forcing with \(S\). More precisely, \(\text{PFA}(S)\) is the 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]\) refers to forcing over a model of \(\text{PFA}(S)\) with \(S\). Models of \(\text{PFA}(S)[S]\) are usually obtained using a supercompact cardinal. The author argues that: ``\dots so just as Martin's Axiom is accessible to those who do not understand iterated forcing, it would be nice to be able to apply this method without the difficult forcing''. Even assuming that, at the present moment, there is no single axiom which will be able to accomplish such task, the author presents a list of the more important consequences of the method so far (together with consequences of related methods such as \(\text{MA}_{\omega_1}(S)[S]\) and \(\text{MM}(S)[S]\)), so that they may be further applied. In Section 4, indeed, a list including a large number of statements is given, such as \(\mathbf{CW}\) (First countable normal spaces are collectionwise Hausdorff), \(\mathbf{HL}\) (First countable hereditarily Lindelöf spaces are hereditarily separable), \(\mathbf{PPI}\) (Every first countable perfect pre-image of \(\omega_1\) includes a copy of \(\omega_1\)), \(\mathbf{SAT}\) (Every Aronszajn tree is special), \(\mathbf{OCA}\) (The Open Coloring Axiom), among many others. However, the author advises researchers to employ suitable caution regarding the declared relations between such statements, since many proofs are not yet available in print or even in preprint form.