По вашему запросу найдено документов: 16008
Страница 3 из 1601
Isolation from Side in 2-Computably Enumerable Degrees structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively
Enumeration degrees and enumerability of familesWe study the enumerability of families relative to the enumeration degrees. It is shown that if a
The complements of lower cones of degrees and the degree spectra of structures© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable
Restrictions on the degree spectra of algebraic structuresWe construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b
Decomposability of low 2-computably enumerable degrees and turing jumps in the ershov hierarchy there exists a low 2-computably enumerable degree that is not splittable into two lower 2-computably enumerable
On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees
Strong Degrees of Categoricity and Weak Density© 2020, Pleiades Publishing, Ltd. Abstract: It is well-known that every c.e. Turing degree
Increasing η-representable degreesIn this paper we prove that any Δ0 3 degree has an increasing η-representation. Therefore
The complements of lower cones of degrees and the degree spectra of structures© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable
Algorithmic reducibilities of algebraic structuresTuring degrees
Страница 3 из 1601
Фасеты
Партнеры
Индексация
