Turing computable embeddings, computable infinitary equivalence, and linear orders › Research Explorer

Novosibirsk State University's Research Portal

Turing computable embeddings, computable infinitary equivalence, and linear orders

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

Section of Discrete Mathematics and Computer Science of MMD and SESC

DOI

https://doi.org/10.1007/978-3-319-58741-7_15
Final published version

Nikolay Bazhenov

Original language	English
Title of host publication	Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Proceedings
Editors	J Kari, F Manea, Petre
Publisher	Springer-Verlag GmbH and Co. KG
Pages	141-151
Number of pages	11
Volume	10307 LNCS
ISBN (Print)	9783319587400
DOIs	https://doi.org/10.1007/978-3-319-58741-7_15
Publication status	Published - 1 Jan 2017
Event	13th Conference on Computability in Europe, CiE 2017 - Turku, Finland Duration: 12 Jun 2017 → 16 Jun 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10307 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th Conference on Computability in Europe, CiE 2017
Country/Territory	Finland
City	Turku
Period	12.06.2017 → 16.06.2017

Research areas

Computable infinitary equivalence, Computable structure, Linear order, Ordinal, Turing computable embedding, ALGEBRAIC STRUCTURES, RECURSIVE STRUCTURES

ID: 10184739