По вашему запросу найдено документов: 1005012
Страница 2 из 100502
Isolation from Side in 2-Computably Enumerable Degrees structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively
Some Properties of the Upper Semilattice of Computable Families of Computably Enumerable Sets families of computably enumerable sets in Ω. It is proved that ideals of minuend and finite families of Ω
Positive Presentations of Families Relative to e-Oracles-numberings for the natural families of sets e-reducible to a fixed set. We prove that, for every computable A
Almost computably enumerable families of sets. Moreover, it is established that for any computably enumerable (c.e.) set A there exists afamily that is X
On computably enumerable structures by the author at Algebra Computability and Logic conference in Kazan, June 1–6, 2014. The paper is a new
Complements for enumeration Π1 0-degrees of cocomputably enumerable sets in the local structure of e-degrees. © 2013 Pleiades Publishing, Ltd.
Restrictions on the degree spectra of algebraic structuresComputably enumerable set
Complements for enumeration Π1 0-degrees of cocomputably enumerable sets in the local structure of e-degrees. © 2013 Pleiades Publishing, Ltd.
CEA Operators and the Ershov Hierarchy enumerable (c.e.) degree $\bf a$ for which the class of all non-c.e. $CEA(\bf a)$ degrees does not contain 2
Turing and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the Ershov
Страница 2 из 100502
Фасеты
Партнеры
Индексация
