Email this article Computable Embeddings of Classes of Structures Under Enumeration and Turing Operators
- Authors: Kalimullin I.S.1
-
Affiliations:
- N.I. Lobachevskii Institute of Mathematics and Mechanics
- Issue: Vol 39, No 1 (2018)
- Pages: 84-88
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/200927
- DOI: https://doi.org/10.1134/S1995080218010146
- ID: 200927
Cite item
Open Access
Access granted
Subscription Access
Abstract
In the paper we study the differences and partial characterizations of the Turing and enumeration computable embeddings of classes of structures
About the authors
I. Sh. Kalimullin
N.I. Lobachevskii Institute of Mathematics and Mechanics
Author for correspondence.
Email: ikalimul@gmail.com
Russian Federation, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
