2016
DOI: 10.4064/fm232-3-2016
|View full text |Cite
|
Sign up to set email alerts
|

Infinite games and chain conditions

Abstract: Abstract. We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on G δ covers of compact spaces. More specifically, we prove results of which the following two are special cases: 1) every linearly ordered topological space satisfying the game-theoretic version of the countable chain condition is separable and 2) in every compact space satisfying the game-theoretic version of the weak Lindelöf property, every cover by G δ sets has a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…For example, Juhász proved in [15] that wL(X δ ) ≤ 2 ℵ 0 for every compact ccc space X, using the Erdös-Rado theorem. The first-named author generalized this in [25] to prove that wL(X δ ) ≤ 2 ℵ 0 for all spaces X such that player II has a winning strategy in G ω 1 (O, O D ), that is the two-player game in ω 1 many innings where at inning α < ω 1 , player one chooses a maximal family of non-empty pairwise disjoint open sets U α and player two chooses U α ∈ U α and player two wins if {U α : α < ω 1 } is dense in X. In [11], Fleischmann and Williams proved that L(X δ ) ≤ 2 ℵ 0 for every compact linearly ordered space X and Pytkeev proved in [23] that L(X δ ) ≤ 2 ℵ 0 for every compact countably tight space X. Carlson, Porter and Ridderbos generalized the latter result in [7] by proving that L(X δ ) ≤ 2 F (X)t(X)L(X) , where F (X) is the supremum of the cardinalities of the free sequences in X.…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation
“…For example, Juhász proved in [15] that wL(X δ ) ≤ 2 ℵ 0 for every compact ccc space X, using the Erdös-Rado theorem. The first-named author generalized this in [25] to prove that wL(X δ ) ≤ 2 ℵ 0 for all spaces X such that player II has a winning strategy in G ω 1 (O, O D ), that is the two-player game in ω 1 many innings where at inning α < ω 1 , player one chooses a maximal family of non-empty pairwise disjoint open sets U α and player two chooses U α ∈ U α and player two wins if {U α : α < ω 1 } is dense in X. In [11], Fleischmann and Williams proved that L(X δ ) ≤ 2 ℵ 0 for every compact linearly ordered space X and Pytkeev proved in [23] that L(X δ ) ≤ 2 ℵ 0 for every compact countably tight space X. Carlson, Porter and Ridderbos generalized the latter result in [7] by proving that L(X δ ) ≤ 2 F (X)t(X)L(X) , where F (X) is the supremum of the cardinalities of the free sequences in X.…”
Section: Introductionmentioning
confidence: 94%
“…It is natural to ask what properties are preserved when passing from X to X κ and whether cardinal invariants of X κ can be bound in terms of cardinal invariants of X. There has been a fair amount of work in the past on this general question, especially for chain conditions and covering properties (see for example [20], [17], [15], [11], [12], [25]). The aim of this section is to present some preservation results that are related to Arhangel'skii's problems mentioned in the introduction.…”
Section: Bounds For the G κ Modificationmentioning
confidence: 99%
“…We call X κ , the G κ -modification of X; in case κ = ω we speak of the G δ -modification of X and we often use the symbol X δ instead. This construction has been extensively studied in the literature; various authors have tried to bound the cardinal functions of X κ in terms of their values on X (see, for example [8], [12], [16], [17], [18]) and results of this kind have found applications to other topics in topology, like the estimation of the cardinality of compact homogeneous spaces (see [5], [8], [9] and [18]).…”
Section: A Cardinal Bound For the G δ -Modificationmentioning
confidence: 99%