По вашему запросу найдено документов: 1005012
Страница 7 из 100502
The least Σ-jump inversion theorem for N-families show that for every set X ≥ T ∅׳_there is a family of sets F which is the Σ-least countable family
Total degrees and nonsplitting properties of ∑2 0 enumeration degrees of semirecursive sets enabled one to proceed, via the natural embedding of the Turing degrees in the enumeration
Об операциях над рекурсивно-перечислимыми множествами, 2 the classes of recursive, creative, simple, pseudo-simple or pseudo-creative sets.
Об операциях над рекурсивно-перечислимыми множествами classes of recursive, creative, simple, pseudo-simple or pseudo-creative sets.
Degree Spectra for Transcendence in Fields of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed Δ20
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
Elementary theories and structural properties of d-c.e. and n-c.e. degrees and enumeration degrees of n-c.e. sets. Questions on the structural properties of these semilattices, and some
Limitwise monotonic sets of reals examples of non-uniformly equivalent families of computable sets with the same enumeration degree spectrum.
The enumeration spectrum hierarchy of n-families© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of sets which can
A survey of results on the d-c.e. and n-c.e. degrees of Turing and enumeration degrees of n-c.e. sets. Questions on the structural properties
Страница 7 из 100502
Фасеты
Партнеры
Индексация
