2018/06/03 by Judyta Bąk, Andrzej Kucharski, Bąk, Judyta +1
Computer Science · Mathematics · #91A44 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #General Topology (math.GN) #Primary: 54G20 #Secondary: 54F99 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1806.00785
openalex publication_date 2018/06/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that a player α has a winning strategy in the Banach--Mazur game on a space X if and only if X is F-Y countably π-domain representable. We show that Choquet complete spaces are F-Y countably domain representable. We give an example of a space, which is F-Y countably domain representable, but it is not F-Y π-domain representable.