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

Strongly sequentially separable function spaces, via selection principles

Abstract: A separable space is strongly sequentially separable if, for each countable dense set, every point in the space is a limit of a sequence from the dense set. We consider this and related properties, for the spaces of continous and Borel real-valued functions on Tychonoff spaces, with the topology of pointwise convergence. Our results solve a problem stated by Gartside, Lo, and Marsh.2010 Mathematics Subject Classification. 37F20, 26A03, 03E75, 54C35.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 19 publications
0
5
0
Order By: Relevance
“…The equivalence was proved by Gerlitz and Nagy [13] for open covers i.e., for S 1 (Ω, Γ), but the proof works also for Borel covers as was noted in Scheepers and Tsaban [35]. In [28], authors was proved Corollary 4.22. For a Tychonoff space X the following statements are equivalent:…”
Section: Continuous Functionsmentioning
confidence: 83%
See 1 more Smart Citation
“…The equivalence was proved by Gerlitz and Nagy [13] for open covers i.e., for S 1 (Ω, Γ), but the proof works also for Borel covers as was noted in Scheepers and Tsaban [35]. In [28], authors was proved Corollary 4.22. For a Tychonoff space X the following statements are equivalent:…”
Section: Continuous Functionsmentioning
confidence: 83%
“…In [28], authors was proved Theorem 3.2. For a Tychonoff space X the following statements are equivalent:…”
Section: Continuous Functionsmentioning
confidence: 99%
“…We also weaken a set-theoretic assumption in the result of Bartoszyński and Recław. In both the cases we use combinatorial methods of construction of subsets of with the property invented by Tsaban ([7, Theorem 3.6], [8, Theorem 6]) and developed by Włudecka and the first named author [13]. We also use a combinatorial covering characterization of null-additive subsets of given by Zindulka [17].…”
Section: Introductionmentioning
confidence: 99%
“…We also weaken a set-theoretic assumption in the result of Bartoszyński and Rec law. In the both cases we use combinatorial methods of construction of subsets of P(N) with the property γ invented by Tsaban ([10, Theorem 3.6], [11,Theorem 6]) and developed by W ludecka and the first named author [16]. We also use a combinatorial covering characterization of null-additive subsets of P(N) given by Zindulka [20].…”
Section: Introductionmentioning
confidence: 99%