Standard
A Note on Computable Embeddings for Ordinals and Their Reverses. / Bazhenov, Nikolay; Vatev, Stefan.
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Proceedings. ed. / Marcella Anselmo; Gianluca Della Vedova; Florin Manea; Arno Pauly. Springer Gabler, 2020. p. 1-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12098 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Bazhenov, N & Vatev, S 2020,
A Note on Computable Embeddings for Ordinals and Their Reverses. in M Anselmo, G Della Vedova, F Manea & A Pauly (eds),
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12098 LNCS, Springer Gabler, pp. 1-13, 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy,
29.06.2020.
https://doi.org/10.1007/978-3-030-51466-2_1
APA
Vancouver
Bazhenov N, Vatev S.
A Note on Computable Embeddings for Ordinals and Their Reverses. In Anselmo M, Della Vedova G, Manea F, Pauly A, editors, Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Proceedings. Springer Gabler. 2020. p. 1-13. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-51466-2_1
Author
Bazhenov, Nikolay ; Vatev, Stefan. /
A Note on Computable Embeddings for Ordinals and Their Reverses. Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Proceedings. editor / Marcella Anselmo ; Gianluca Della Vedova ; Florin Manea ; Arno Pauly. Springer Gabler, 2020. pp. 1-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@inproceedings{1571ea25c5d040cebe003fc4f29515b9,
title = "A Note on Computable Embeddings for Ordinals and Their Reverses",
abstract = "We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree structure. Our main result shows that although is computably embeddable in, the class is not computably embeddable in for any natural number.",
keywords = "Computable embedding, Enumeration operator, Linear order",
author = "Nikolay Bazhenov and Stefan Vatev",
year = "2020",
month = jul,
day = "1",
doi = "10.1007/978-3-030-51466-2_1",
language = "English",
isbn = "9783030514655",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Gabler",
pages = "1--13",
editor = "Marcella Anselmo and {Della Vedova}, Gianluca and Florin Manea and Arno Pauly",
booktitle = "Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Proceedings",
address = "Germany",
note = "16th Conference on Computability in Europe, CiE 2020 ; Conference date: 29-06-2020 Through 03-07-2020",
}
RIS
TY - GEN
T1 - A Note on Computable Embeddings for Ordinals and Their Reverses
AU - Bazhenov, Nikolay
AU - Vatev, Stefan
PY - 2020/7/1
Y1 - 2020/7/1
N2 - We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree structure. Our main result shows that although is computably embeddable in, the class is not computably embeddable in for any natural number.
AB - We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree structure. Our main result shows that although is computably embeddable in, the class is not computably embeddable in for any natural number.
KW - Computable embedding
KW - Enumeration operator
KW - Linear order
UR - http://www.scopus.com/inward/record.url?scp=85088208740&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-51466-2_1
DO - 10.1007/978-3-030-51466-2_1
M3 - Conference contribution
AN - SCOPUS:85088208740
SN - 9783030514655
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 13
BT - Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Proceedings
A2 - Anselmo, Marcella
A2 - Della Vedova, Gianluca
A2 - Manea, Florin
A2 - Pauly, Arno
PB - Springer Gabler
T2 - 16th Conference on Computability in Europe, CiE 2020
Y2 - 29 June 2020 through 3 July 2020
ER -
