Computability of Polish spaces up to homeomorphism

• Main Authors: Harrison-Trainor, Matthew, Melnikov, Alexander, Ng, Keng Meng
• 其他作者: School of Physical and Mathematical Sciences
• 格式: Article
• 語言: English
• 出版: 2022
• 主題: Science::Mathematics; Computer Analysis; Applications of Computable Structure Theory
• 在線閱讀: https://hdl.handle.net/10356/159280
• 機構: Nanyang Technological University

We study computable Polish spaces and Polish groups up to homeomorphism. We prove a natural effective analogy of Stone duality, and we also develop an effective definability technique which works up to homeomorphism. As an application, we show that there is a Polish space not homeomorphic to a computable one. We apply our techniques to build, for any computable ordinal, an effectively closed set not homeomorphic to any -computable Polish space; this answers a question of Nies. We also prove analogous results for compact Polish groups and locally path-connected spaces.