По вашему запросу найдено документов: 168528
Страница 1 из 16853
Enumeration degrees and enumerability of familes family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable
A semilattice generated by superlow computably enumerable degreesWe prove that a partially ordered set of all computably enumerable (c. e.) degrees
Enumeration degrees and enumerability of familes family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable
Non-isolated quasi-degreesWe show that non-isolated from below 2-c.e. Q-degrees are dense in the structure of c.e. Q-degrees
Algorithmic reducibilities of algebraic structurese-degrees (enumeration degrees)
On downey's conjectureWe prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees
Irreducible, Singular, and Contiguous Degrees© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger
Non-isolated quasi-degreesWe show that non-isolated from below 2-c.e. Q-degrees are dense in the structure of c.e. Q-degrees
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
Страница 1 из 16853
Фасеты
Партнеры
Индексация
