Coding strategies, the Choquet game, and domain representability

DOI10.1016/J.TOPOL.2016.02.003zbMath1348.91079OpenAlexW2299975428MaRDI QIDQ260593

Lynne Yengulalp

Publication date: 21 March 2016

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.topol.2016.02.003

zbMATH Keywords

Banach-Mazur gameChoquet gamedomain representablesubcompact

Mathematics Subject Classification ID

Complete metric spaces (54E50) Baire category, Baire spaces (54E52) Games involving topology, set theory, or logic (91A44) Base properties of topological spaces (54D70)

Related Items (4)

On the strategies for NONEMPTY in topological games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• From subcompact to domain representable
• Stationary strategies in topological games
• Topological games: on the 50th anniversary of the Banach-Mazur game
• Topological games in domain theory
• When C_p(X) is domain representable
• Stratégies gagnantes dans certains jeux topologiques
• Cartesian products of Baire spaces
• Domain-representable spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coding strategies, the Choquet game, and domain representability