По вашему запросу найдено документов: 19884
Страница 2 из 1989
Splitting and nonsplitting in the Σ2 0 enumeration degrees of the enumeration degrees, for which the Ershov hierarchy provides an informative setting. The main results below
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
Splitting and nonsplitting in the Σ2 0 enumeration degrees of the enumeration degrees, for which the Ershov hierarchy provides an informative setting. The main results below
Irreducible, Singular, and Contiguous Degrees algorithmic reducibilities inside the degrees of weaker algorithmic ones. Results in this area are reviewed
Algorithmic reducibilities of algebraic structuresAlgorithmic reducibilities of algebraic structures
Non-isolated quasi-degreesComputably-enumerable degrees
Structural properties of Q-degrees of n-c. e. setsComputably enumerable sets
The least Σ-jump inversion theorem for N-families© J.UCS. Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we
Non-isolated quasi-degreesComputably-enumerable degrees
Algorithmic reducibilities of algebraic structuresAlgorithmic reducibilities of algebraic structures
Страница 2 из 1989
Фасеты
Партнеры
Индексация
