COMPUTABLE TOPOLOGICAL GROUPS

COMPUTABLE TOPOLOGICAL GROUPS

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions based on classical notions in the literature. We relate these notions with the well-established definitions of effective presentability for discrete and profi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of symbolic logic 2023-09, p.1-33
Hauptverfasser: KOH, HEER TERN, MELNIKOV, ALEXANDER G., NG, KENG MENG
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions based on classical notions in the literature. We relate these notions with the well-established definitions of effective presentability for discrete and profinite groups, and compare our results with similar results in computable topology.
ISSN:0022-4812
1943-5886
DOI:10.1017/jsl.2023.67