Enviar artigo por via de e-mail On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy
- Autores: Arslanov M.1, Yamaleev M.1
-
Afiliações:
- N.I. Lobachevskii Institute of Mathematics and Mechanics
- Edição: Volume 39, Nº 5 (2018)
- Páginas: 634-638
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202158
- DOI: https://doi.org/10.1134/S1995080218050037
- ID: 202158
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Palavras-chave
Sobre autores
M. Arslanov
N.I. Lobachevskii Institute of Mathematics and Mechanics
Autor responsável pela correspondência
Email: marat.arslanov@kpfu.ru
Rússia, ul. Kremlevskaya 18, Kazan, 420008
M. Yamaleev
N.I. Lobachevskii Institute of Mathematics and Mechanics
Email: marat.arslanov@kpfu.ru
Rússia, ul. Kremlevskaya 18, Kazan, 420008
