Материалов:
1 005 012

Репозиториев:
30

Авторов:
761 409

По вашему запросу найдено документов: 1005012

Страница 1 из 100502

Turing and enumeration jumps in the Ershov hierarchy
Faizrahmanov M., Kalimullin I.
In the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the Ershov
Turing jumps in the Ershov hierarchy
Faizrakhmanov M.
We look at infinite levels of the Ershov hierarchy in the natural system of notation, which
Relative enumerability in Ershov's hierarchy
Batyrshin I.
Generalizations to various levels of Ershov's hierarchy of the relationship between n
Extending Cooper’s theorem to Δ30 Turing degrees
a 2-c.e. Turing degree which doesn't contain a c.e. set. Thus, he showed that the second level
Turing Degrees in Refinements of the Arithmetical Hierarchy
Selivanov V., Yamaleev M.
hierarchy exhausts arithmetical sets and contains as a small fragment finite levels of Ershov hierarchies
CEA Operators and the Ershov Hierarchy
Arslanov M.M., Batyrshin I.I., Yamaleev M.M.
We examine the relationship between the CEA hierarchy and the Ershov hierarchy within $\Delta_2
Turing and enumeration jumps in the Ershov hierarchy
Faizrahmanov M., Kalimullin I.
In the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the Ershov
Turing jumps in the Ershov hierarchy
Faizrakhmanov M.
We look at infinite levels of the Ershov hierarchy in the natural system of notation, which
Decomposability of low 2-computably enumerable degrees and turing jumps in the ershov hierarchy
Faizrakhmanov M.
degrees whose jumps belong to the corresponding Δ-level of the Ershov hierarchy. © Allerton Press, Inc
Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
Faizrahmanov M.
belonging to a fixed level of the Ershov hierarchy, and we deduce existence of a Σcomputable numbering

Страница 1 из 100502

Фасеты

Новости проекта

Новости

Партнеры

КФУ
ТГУ
Elpub
СФУ
Webpublishers

Индексация

BASE
WorldCat
OpenAIRE
EDS
core