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

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

Авторов:
761 409

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

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

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
Extending Cooper’s theorem to Δ30 Turing degrees
of the Ershov hierarchy is proper. In this paper we investigate proper levels of some extensions of 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
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 reducibility in the fine hierarchy
Melnikov A.G., Selivanov V.L., Yamaleev M.M.
sets to extend the Ershov hierarchy beyond Δ20 sets. Similar to the Ershov hierarchy, Selivanov's fine
Relative enumerability in Ershov's hierarchy
Batyrshin I.
Generalizations to various levels of Ershov's hierarchy of the relationship between n
Turing jumps in the Ershov hierarchy
Faizrakhmanov M.
We look at infinite levels of the Ershov hierarchy in the natural system of notation, which
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
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

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

Фасеты

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

Новости

Партнеры

КФУ
ТГУ
Elpub
СФУ
Webpublishers

Индексация

BASE
WorldCat
OpenAIRE
EDS
core