On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy
- Авторы: Arslanov M.1, Yamaleev M.1
-
Учреждения:
- N.I. Lobachevskii Institute of Mathematics and Mechanics
- Выпуск: Том 39, № 5 (2018)
- Страницы: 634-638
- Раздел: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202158
- DOI: https://doi.org/10.1134/S1995080218050037
- ID: 202158
Цитировать
Аннотация
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
![](/img/style/loading.gif)