Computability of Polish spaces up to homeomorphism
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...
Saved in:
Main Authors: | Harrison-Trainor, Matthew, Melnikov, Alexander, Ng, Keng Meng |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/159280 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Computable torsion abelian groups
by: Melnikov, Alexander G., et al.
Published: (2020) -
Automatic and polynomial-time algebraic structures
by: Bazhenov, Nikolay, et al.
Published: (2020) -
Common fixed points of a countable family of multivalued quasi-nonexpansive mappings in uniformly convex Banach spaces
by: Bunyawat A., et al.
Published: (2015) -
Punctual categoricity and universality
by: Downey, Rod, et al.
Published: (2022) -
Computably and punctually universal spaces
by: Bagaviev, Ramil, et al.
Published: (2024)