Coding Strategies, the Choquet Game and Domain RepresentabilityTopology and its Applications
AbstractWe prove that if the NONEMPTY player has a winning strategy in the strong Choquet game on a regular space X then NONEMPTY has a winning coding strategy in that game (a strategy that only depends on the previous 2 moves). We also prove that any regular domain representable space is generalized subcompact.
CopyrightCopyright © 2016, Elsevier
Citation InformationLynne Yengulalp. "Coding Strategies, the Choquet Game and Domain Representability" Topology and its Applications Vol. 202 Iss. 1 (2016)
Available at: http://works.bepress.com/lynne_yengulalp/1/