Computability of Polish spaces up to homeomorphism

• المؤلفون الرئيسيون: Harrison-Trainor, Matthew, Melnikov, Alexander, Ng, Keng Meng
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2022
• الموضوعات: Science::Mathematics; Computer Analysis; Applications of Computable Structure Theory
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/159280

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 compu...