Document Type
Article
Publication Date
4-2016
Publication Source
Topology and its Applications
Abstract
We 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.
Inclusive pages
384–396
ISBN/ISSN
0166-8641
Document Version
Preprint
Copyright
Copyright © 2016, Elsevier
Publisher
Elsevier
Volume
202
Issue
1
Peer Reviewed
yes
eCommons Citation
Yengulalp, Lynne, "Coding Strategies, the Choquet Game and Domain Representability" (2016). Mathematics Faculty Publications. 34.
https://ecommons.udayton.edu/mth_fac_pub/34
Comments
The document available for download is the author's submitted manuscript, provided in compliance with the publisher's policy on self-archiving. Differences may exist between this document and the published version, which is available using the link provided. Permission documentation is on file.