PFA(S) and countable tightness (Q1731332)

From MaRDI portal
scientific article
Language Label Description Also known as
English
PFA(S) and countable tightness
scientific article

    Statements

    PFA(S) and countable tightness (English)
    0 references
    0 references
    13 March 2019
    0 references
    The paper deals with models of set theory obtained by starting with a particular kind of Souslin tree $S$, assuming a Martin's Axiom-like forcing axiom which applies to 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$. \par Models of $\text{PFA}(S)$ and $\text{PFA}(S)[S]$ are usually investigated in the context of the status of many of the consequences of $\text{PFA}$ in these new $\text{PFA}$-like models. In the paper under review, the author is interested in the following three consequences of $\text{PFA}$: \begin{itemize} \item[(1)] the non-existence of (compact) $S$-spaces (i.e., hereditarily separable but not hereditarily Lindelöf spaces); \item[(2)] the Moore-Mrówka-Problem: every compact space of countable tightness is sequential; and \item[(3)] every countably tight perfect pre-image of $\omega_1$ contains a copy of $\omega_1$. \end{itemize} In models of $\text{PFA}(S)[S]$ it remains an open problem if there are any $S$-spaces, but it was shown by Todorčevic that there are no compact $S$-spaces and that (2) holds. \textit{A. Dow} and \textit{F. D. Tall} [Topology Appl. 230, 393--416 (2017; Zbl 1380.54004)] have shown that (3) holds in models of $\text{PFA}(S)[S]$. In the paper under review, the author shows that (2) holds and (3) fails in models of $\text{PFA}(S)$.
    0 references
    forcing with Souslin tree
    0 references
    PFA
    0 references
    Moore-Mrówka
    0 references

    Identifiers