Standard

Enumerating Classes of Effective Quasi-Polish Spaces. / de Brecht, Matthew; Kihara, Takayuki; Selivanov, Victor.

Revolutions and Revelations in Computability. Springer Nature, 2022. p. 88-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13359).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

de Brecht, M, Kihara, T & Selivanov, V 2022, Enumerating Classes of Effective Quasi-Polish Spaces. in Revolutions and Revelations in Computability. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13359, Springer Nature, pp. 88-102, computability in europe-2022, 11/07/22. https://doi.org/10.1007/978-3-031-08740-0_8

APA

de Brecht, M., Kihara, T., & Selivanov, V. (2022). Enumerating Classes of Effective Quasi-Polish Spaces. In Revolutions and Revelations in Computability (pp. 88-102). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13359). Springer Nature. https://doi.org/10.1007/978-3-031-08740-0_8

Vancouver

de Brecht M, Kihara T, Selivanov V. Enumerating Classes of Effective Quasi-Polish Spaces. In Revolutions and Revelations in Computability. Springer Nature. 2022. p. 88-102. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-031-08740-0_8

Author

de Brecht, Matthew ; Kihara, Takayuki ; Selivanov, Victor. / Enumerating Classes of Effective Quasi-Polish Spaces. Revolutions and Revelations in Computability. Springer Nature, 2022. pp. 88-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{f04fac669e2d4a77a5d32a3b5393bc3b,
title = "Enumerating Classes of Effective Quasi-Polish Spaces",
abstract = "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.",
keywords = "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",
author = "{de Brecht}, Matthew and Takayuki Kihara and Victor Selivanov",
year = "2022",
month = jan,
day = "1",
doi = "10.1007/978-3-031-08740-0_8",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "88--102",
booktitle = "Revolutions and Revelations in Computability",
address = "Germany",
note = "computability in europe-2022 ; Conference date: 11-07-2022",

}

RIS

TY - GEN

T1 - Enumerating Classes of Effective Quasi-Polish Spaces

AU - de Brecht, Matthew

AU - Kihara, Takayuki

AU - Selivanov, Victor

PY - 2022/1/1

Y1 - 2022/1/1

N2 - 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.

AB - 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.

KW - c.e. preorder

KW - c.e. transitive relation

KW - effective descriptive set theory

KW - effective domain

KW - effective Polish space

KW - Effective quasi-Polish space

KW - index set

KW - numbering

KW - separation axioms

UR - http://www.scopus.com/inward/record.url?scp=85134168658&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-08740-0_8

DO - 10.1007/978-3-031-08740-0_8

M3 - Conference contribution

AN - SCOPUS:85134168658

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 88

EP - 102

BT - Revolutions and Revelations in Computability

PB - Springer Nature

T2 - computability in europe-2022

Y2 - 11 July 2022

ER -

ID: 126984206