Abstract
In the paper we study the differences and partial characterizations of the Turing and enumeration computable embeddings of classes of structures
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
W. Calvert, D. Cummins, S. Miller, and J. F. Knight, “Comparing classes of finite structures,” Algebra Logic 43, 365–373 (2004).
M. V. Boom, S. Miller, and J. F. Knight, “Turing computable embeddings,” J. Symbolic Logic 72, 901–918 (2007).
I. Sh. Kalimullin, “Algorithmic reducibilities of algebraic structures,” J. Logic Comput. 22, 831–845 (2012).
Author information
Authors and Affiliations
Corresponding author
Additional information
(Submitted by M. M. Arslanov)
Rights and permissions
About this article
Cite this article
Kalimullin, I.S. Computable Embeddings of Classes of Structures Under Enumeration and Turing Operators. Lobachevskii J Math 39, 84–88 (2018). https://doi.org/10.1134/S1995080218010146
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080218010146