PFA(S)[S] for the masses
classification
🧮 math.GN
keywords
accessavoidaxiomsblackcoherentcomplexitiesforcingiteration
read the original abstract
We present S. Todorcevic's method of forcing with a coherent Souslin tree over restricted iteration axioms as a black box usable by those who wish to avoid its complexities but still access its power.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.