Coding strategies, the Choquet game, and domain representability (Q260593): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.topol.2016.02.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2299975428 / rank | |||
Normal rank | |||
Revision as of 00:00, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coding strategies, the Choquet game, and domain representability |
scientific article |
Statements
Coding strategies, the Choquet game, and domain representability (English)
0 references
21 March 2016
0 references
Let \(X\) be a regular space. In the paper under review, the author proves that if the NONEMPTY player has a winning strategy in the strong Choquet game \(\mathrm{Ch}(X)\) then NONEMPTY has a winning coding strategy in \(\mathrm{Ch}(X)\) (a strategy that depends only on the opponent's previous move and the NONEMPTY's own previous move). She proves also that any regular domain representable space is generalized subcompact.
0 references
domain representable
0 references
subcompact
0 references
Choquet game
0 references
Banach-Mazur game
0 references
