We discuss ideal presentations of effective quasi-Polish spaces and some of their subclasses. Based on this, we introduce and study natural numberings of these classes, in analogy with the numberings of classes of algebraic structures popular in computability theory. We estimate the complexity of (effective) homeomorphism w.r.t. these numberings, and of some natural index sets. In particular, we give precise characterizations of the complexity of certain classes related to separation axioms.
Translated title of the contributionНумерации классов эффективных квази-польских пространств
Original languageEnglish
Title of host publicationRevolutions and Revelations in Computability
PublisherSpringer Nature
Pages88-102
Number of pages15
DOIs
StatePublished - 1 Jan 2022
Eventcomputability in europe-2022 -
Duration: 11 Jul 2022 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Nature
Volume13359
ISSN (Print)0302-9743

Conference

Conferencecomputability in europe-2022
Period11/07/22 → …

    Research areas

  • c.e. preorder, c.e. transitive relation, effective descriptive set theory, effective domain, effective Polish space, Effective quasi-Polish space, index set, numbering, separation axioms

ID: 126984206