Computable Embeddings of Classes of Structures Under Enumeration and Turing Operators


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

In the paper we study the differences and partial characterizations of the Turing and enumeration computable embeddings of classes of structures

作者简介

I. Kalimullin

N.I. Lobachevskii Institute of Mathematics and Mechanics

编辑信件的主要联系方式.
Email: ikalimul@gmail.com
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##