По вашему запросу найдено документов: 1005012
Страница 1 из 100502
Definable relations in Turing degree structuresIn this article, we investigate questions about the definability of classes of n-c. e. sets
Definable relations in Turing degree structuresIn this article, we investigate questions about the definability of classes of n-c. e. sets
There is no low maximal d. c. e. degree - CorrigendumWe give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e
On Fairly Low and Superlow Sets well-known low sets and superlow sets called fairly low sets. We prove a slightly more substantial fact
There is no low maximal d. c. e. degreeWe show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L
There is no low maximal d. c. e. degreeWe show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L
On a problem of IshmukhametovGiven a d.c.e. degree d, consider the d.c.e. sets in d and the corresponding degrees
On a problem of IshmukhametovGiven a d.c.e. degree d, consider the d.c.e. sets in d and the corresponding degrees
There is no low maximal d. c. e. degree - CorrigendumWe give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e
Q-degrees of n-C.E. sets. sets form a true hierarchy in terms of Q-degrees, and that for any n ≥ 1 there exists a 2n-c.e. Q
Страница 1 из 100502
Фасеты
Партнеры
Индексация
