Computable Embeddings of Classes of Structures Under Enumeration and Turing Operators

被引：5
|
作者：
Kalimullin I.S. [1 ]
机构：
[1] N.I. Lobachevskii Institute of Mathematics and Mechanics, Kazan (Volga Region) Federal University, ul. Kremlevskaya 18, Kazan, Tatarstan
来源：
Lobachevskii Journal of Mathematics | 2018年 / 39卷 / 1期
关键词：
elementary theories; enumeration degrees; Erhsov’s hierarchy; structural properties; Turing degrees;
D O I：
10.1134/S1995080218010146
中图分类号：
学科分类号：
摘要：
In the paper we study the differences and partial characterizations of the Turing and enumeration computable embeddings of classes of structures. © 2018, Pleiades Publishing, Ltd.
引用
收藏
页码：84 / 88
页数：4
相关论文
共 30 条
123