The length of some diagonalization games
DOI10.1007/S001530050117zbMATH Open0924.03091OpenAlexW2051674928MaRDI QIDQ1283129FDOQ1283129
Authors: Marion Scheepers
Publication date: 8 November 1999
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001530050117
Recommendations
\(\omega\)-coverinfinite gameordinals\(\omega\)-type of a topological spaceinfinite separable metric space
Metric spaces, metrizability (54E35) Games involving topology, set theory, or logic (91A44) Other combinatorial set theory (03E05)
Cited In (10)
- Transfinite open-point games
- Title not available (Why is that?)
- Products of Luzin-type sets with combinatorial properties
- Selective separability of Pixley-Roy hyperspaces
- On some questions about selective separability
- Additivity properties of topological diagonalizations
- Topological games and covering dimension
- Remarks on countable tightness
- Weak covering properties and selection principles
- A generalization of M-separability by networks
This page was built for publication: The length of some diagonalization games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283129)