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

Relating games of Menger, countable fan tightness, and selective separability

Abstract: By adapting techniques of Arhangel'skii, Barman, and Dow, we may equate the existence of perfect-information, Markov, and tactical strategies between two interesting selection games. These results shed some light on Gruenhage's question asking whether all strategically selectively separable spaces are Markov selectively separable.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2
1

Relationship

3
0

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 7 publications
(2 reference statements)
0
8
0
Order By: Relevance
“…The equivalence (2) ⇔ (3) is similar to the following open question of Gruenhage, first shown to be true when X is countable by Barman and Dow in [5,Theorem 2.11]; see [10,Lemma 37] for a general sufficient condition which guarantees that a winning strategy may be improved to a Markov winning strategy.…”
Section: Has a Countable Dense Subset D Where Twomentioning
confidence: 70%
See 3 more Smart Citations
“…The equivalence (2) ⇔ (3) is similar to the following open question of Gruenhage, first shown to be true when X is countable by Barman and Dow in [5,Theorem 2.11]; see [10,Lemma 37] for a general sufficient condition which guarantees that a winning strategy may be improved to a Markov winning strategy.…”
Section: Has a Countable Dense Subset D Where Twomentioning
confidence: 70%
“…Proof. In [10], Φ = D was an additional assumption, but was never required in the proofs, since S * (Φ, D) implies separability for any non-empty Φ.…”
Section: Is Separable and Satisfies Smentioning
confidence: 99%
See 2 more Smart Citations
“…Classic works by Telgarksy and Galvin show that the point open game is dual to the Rothberger game [4]. Clontz, in work prior to this, established the equivalence of the existence of winning strategies for the Rothberger game and variants of the Rothberger game on X to the existence of winning strategies in games related to countable fan tightness for C p (X) [5]. Clontz did this both for strategies of perfect information and for limited information strategies.…”
mentioning
confidence: 99%