Coding strategies, the Choquet game, and domain representability

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.