По вашему запросу найдено документов: 21614
Страница 6 из 2162
Strong Degrees of Categoricity and Weak Densitycomputably enumerable sets
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
Universal computable enumerations of finite classes of families of total functions© 2016, Allerton Press, Inc.In the paper we introduce the notion of a computable enumeration of a
The enumeration spectrum hierarchy of n-families© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of sets which can
ON ТНЕ THEORIES OF ТНЕ STRONGLY BOUNDED TURING DEGREES OF COMPUTABLY ENUMERABLE SETSON ТНЕ THEORIES OF ТНЕ STRONGLY BOUNDED TURING DEGREES OF COMPUTABLY ENUMERABLE SETS
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
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
The enumeration spectrum hierarchy of n-families© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of sets which can
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
Страница 6 из 2162
Фасеты
Партнеры
Индексация
