Work

Comparing notions of presentability in Polish spaces and Polish groups

Year: 2025

Type: article

Abstract: 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.

Source: Annals of Pure and Applied Logic

DOI: 10.1016/j.apal.2025.103564

Authors: Sapir Ben-Shahar, Heer Tern Koh

Institutions: Victoria University of Wellington, Nanyang Technological University

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,520

OpenAlex ID: W4407695016

FWCI:

Cites: 22

Cited by:

Related to: 10