Материалов:
1 005 012

Репозиториев:
30

Авторов:
761 409

По вашему запросу найдено документов: 2153

Страница 2 из 216

Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy belonging to a fixed level of the Ershov hierarchy, and we deduce existence of a Σcomputable numbering

CEA Operators and the Ershov HierarchyWe examine the relationship between the CEA hierarchy and the Ershov hierarchy within $\Delta_2

Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy belonging to a fixed level of the Ershov hierarchy, and we deduce existence of a Σcomputable numbering

Decomposability of low 2-computably enumerable degrees and turing jumps in the ershov hierarchy degrees whose jumps belong to the corresponding Δ-level of the Ershov hierarchy. © Allerton Press, Inc

Classifying equivalence relations in the Ershov hierarchy-degrees to the Δ20 case. In doing so, we rely on the Ershov hierarchy. For any notation a for a non-zero computable

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

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

On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy in the difference hierarchy (degrees of sets from finite levels of the Ershov difference hierarchy) are studied

Computable Linear Orders and the Ershov Hierarchy
Computable Linear Orders and the Ershov Hierarchy

Structural properties of Q-degrees of n-c. e. setsErshov hierarchy

Страница 2 из 216