Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 2 of 2
Full-Text Articles in Mathematics
Coding Strategies, The Choquet Game And Domain Representability, Lynne Yengulalp
Coding Strategies, The Choquet Game And Domain Representability, Lynne Yengulalp
Mathematics Faculty Publications
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.
Domain Representability And Topological Completeness, Matthew D. Devilbiss
Domain Representability And Topological Completeness, Matthew D. Devilbiss
Honors Theses
Topological completeness properties seek to generalize the definition of complete metric space to the context of topologies. Chapter 1 gives an overview of some of these properties. Chapter 2 introduces domain theory, a field originally intended for use in theoretical computer science. Finally, Chapter 3 examines how this computer-scientific notion can be employed in the study of topological completeness in the form of domain representability. The connections between domain representability and other topological completeness properties are subsequently examined.