Coding strategies, the Choquet game, and domain representability

详细信息    查看全文

• 作者：Lynne Yengulalp ^{lyengulalp1@udayton.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：primary ; 54E52 ; 91A44 ; secondary ; 54E50 ; 54D70
• 刊名：Topology and its Applications
• 出版年：2016
• 出版时间：1 April 2016
• 年：2016
• 卷：202
• 期：Complete
• 页码：384-396
• 全文大小：377 K

文摘

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.