Comparing notions of presentability in Polish spaces and Polish groups
A recent area of interest in computable topology compares different notions of effective presentability for topological spaces. In this paper, we show that up to isometry, there is a compact connected Polish space that has both left-c.e. and right-c.e. Polish presentations, but has no computable Polish presentation. We also construct a Polish group that has both left-c.e. and right-c.e. Polish group presentations, but lacks a computable Polish presentation, up to topological isomorphism.
Authors
- Heer Tern Koh (ORCID: https://orcid.org/0009-0002-6268-5220)
- Sapir Ben-Shahar (ORCID: https://orcid.org/0009-0005-1331-0141)
Publication Details
- Journal
- Annals of Pure and Applied Logic
- Published
- 2025-02-18
- DOI
- https://doi.org/10.1016/j.apal.2025.103564
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00