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

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

Авторов:
761 409

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

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

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
On arithmetical level of the class of superhigh sets
Faizrahmanov M.
We determine the proper arithmetical level of the class of superhigh sets. © 2014 Allerton Press
Extending Cooper’s theorem to Δ30 Turing degrees
hierarchy to higher levels of the arithmetical hierarchy. Thus we contribute to the theory of ' " 3 0
On arithmetical level of the class of superhigh sets
Faizrahmanov M.
We determine the proper arithmetical level of the class of superhigh sets. © 2014 Allerton Press
Turing reducibility in the fine hierarchy
Melnikov A.G., Selivanov V.L., Yamaleev M.M.
hierarchy {Σγ}γ<ε0 proceeds through transfinite levels below ε0 to cover all arithmetical sets
Quasi-completeness and functions without fixed-points
Batyrshin I.
of the arithmetical hierarchy. As an application of the criterion we obtain Q-completeness of the set of all pairs (x
Quasi-completeness and functions without fixed-points
Batyrshin I.
of the arithmetical hierarchy. As an application of the criterion we obtain Q-completeness of the set of all pairs (x
Fixed-point Selection Functions
Arslanov M.M.
of elements of B. Suppose that for a class A of arithmetical sets, which have an effective enumeration
On the arithmetic properties of polyadic integers.
Чирский В. Г.
On the arithmetic properties of polyadic integers.
Multi-criterial method. Analytic hierarchy process
Muomah Chinedum Frederick
The analytic hierarchy process (AHP) is a structured technique for organizing and analyzing complex

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

Фасеты

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

Новости

Партнеры

КФУ
ТГУ
Elpub
СФУ
Webpublishers

Индексация

BASE
WorldCat
OpenAIRE
EDS
core