Email this article On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy
- Authors: Arslanov M.M.1, Yamaleev M.M.1
-
Affiliations:
- N.I. Lobachevskii Institute of Mathematics and Mechanics
- Issue: Vol 39, No 5 (2018)
- Pages: 634-638
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202158
- DOI: https://doi.org/10.1134/S1995080218050037
- ID: 202158
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
M. M. Arslanov
N.I. Lobachevskii Institute of Mathematics and Mechanics
Author for correspondence.
Email: marat.arslanov@kpfu.ru
Russian Federation, ul. Kremlevskaya 18, Kazan, 420008
M. M. Yamaleev
N.I. Lobachevskii Institute of Mathematics and Mechanics
Email: marat.arslanov@kpfu.ru
Russian Federation, ul. Kremlevskaya 18, Kazan, 420008
