The Banach--Mazur game and the strong Choquet game in domain theory
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.