On a game of Sierpiński
Grzegorz Kubicki (1987)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Compact covering mappings between Borel ѕpaces”
On a game of Sierpiński
Compact covering mappings and cofinal families of compact subsets of a Borel set
G. Debs, J. Saint Raymond (2001)
Fundamenta Mathematicae
Similarity:
Among other results we prove that the topological statement “Any compact covering mapping between two Π⁰₃ spaces is inductively perfect” is equivalent to the set-theoretical statement ""; and that the statement “Any compact covering mapping between two coanalytic spaces is inductively perfect” is equivalent to “Analytic Determinacy”. We also prove that these statements are connected to some regularity properties of coanalytic cofinal sets in (X), the hyperspace of all compact subsets...
Some applications of game determinacy
G. Debs, J. Saint Raymond (1996)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
On the axiom of determinateness (II)
Jan Mycielski (1966)
Fundamenta Mathematicae
Similarity:
On game-theoretic methods in the theory of Souslin sets
Ashok Maitra (1971)
Fundamenta Mathematicae
Similarity:
On some topological games
Telgársky, R.
Similarity:
A universal metacompact developable -space of weight m
Józef Chaber (1984)
Fundamenta Mathematicae
Similarity:
A Cantor-Bendixson theorem for the space
Jouko Väänänen (1991)
Fundamenta Mathematicae
Similarity:
A game and its relation to netweight and D-spaces
Gary Gruenhage, Paul Szeptycki (2011)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We introduce a two player topological game and study the relationship of the existence of winning strategies to base properties and covering properties of the underlying space. The existence of a winning strategy for one of the players is conjectured to be equivalent to the space have countable network weight. In addition, connections to the class of D-spaces and the class of hereditarily Lindelöf spaces are shown.