电邮这篇文章 On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy
- 作者: Arslanov M.M.1, Yamaleev M.M.1
-
隶属关系:
- N.I. Lobachevskii Institute of Mathematics and Mechanics
- 期: 卷 39, 编号 5 (2018)
- 页面: 634-638
- 栏目: Article
- URL: https://bakhtiniada.ru/1995-0802/article/view/202158
- DOI: https://doi.org/10.1134/S1995080218050037
- ID: 202158
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
Questions of definability of computably enumerable degrees in the difference hierarchy (degrees of sets from finite levels of the Ershov difference hierarchy) are studied. Several approaches to the solution of this problem are outlined.
作者简介
M. Arslanov
N.I. Lobachevskii Institute of Mathematics and Mechanics
编辑信件的主要联系方式.
Email: marat.arslanov@kpfu.ru
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, 420008
M. Yamaleev
N.I. Lobachevskii Institute of Mathematics and Mechanics
Email: marat.arslanov@kpfu.ru
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, 420008
补充文件
