2015
DOI: 10.1016/j.topol.2015.09.035
|View full text |Cite
|
Sign up to set email alerts
|

Forcing with a coherent Souslin tree and locally countable subspaces of countably tight compact spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
8
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…The results established here were actually proved around 2004, modulo results of Todorcevic announced in 2002 (which now appear in [7] and [19]) and of the second author [16]. We delayed submission until a correct version of [16] existed.…”
mentioning
confidence: 70%
See 2 more Smart Citations
“…The results established here were actually proved around 2004, modulo results of Todorcevic announced in 2002 (which now appear in [7] and [19]) and of the second author [16]. We delayed submission until a correct version of [16] existed.…”
mentioning
confidence: 70%
“…Our plan is to find a model in which these two consequences and Axiom R hold, as well as normality implying (strongly) ℵ 1 -collectionwise Hausdorffness for the spaces under consideration. The model we will consider is of the same genre as those in [12], [19], [7], [11], and [16]. One starts with a particular kind of Souslin tree S, a coherent one, which is obtainable from ♦ or by adding a Cohen real.…”
Section: Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…A modification of such a proof produces a model in which the following proposition (see [15]) holds:…”
Section: Large Cardinals and The Mopmentioning
confidence: 99%
“…The only new point to observe is that each stage of the iteration producing − for compact sequential spaces is proper and S-preserving, and has cardinality ℵ 1 , by CH. "Proper and S-preserving" was shown in [8]. As in the PPI without large cardinals proof in [5], we can code up the necessary information about locally countable sets of size ℵ 1 so as to get a poset of size ℵ 1 for establishing an instance of − .…”
Section: Introductionmentioning
confidence: 99%