По вашему запросу найдено документов: 1005012
Страница 4 из 100502
There is no low maximal d. c. e. degreeWe show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L
Restrictions on the degree spectra of algebraic structuresComputably enumerable set
Irreducible, Singular, and Contiguous Degrees not settled for these. A computably enumerable Q-degree which consists of one computably enumerable m
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
Definable relations in Turing degree structuresIn this paper we investigate questions about the definability of classes of n-computably enumerable
There is no low maximal d. c. e. degree - CorrigendumComputably enumerable set
Relative enumerability in Ershov's hierarchyGeneralizations to various levels of Ershov's hierarchy of the relationship between n-computable
The enumeration spectrum hierarchy of α-families and lowα degrees countable sets in the ZFC-theory with urelements from N. The families from the hierarchy can be coded
The complements of lower cones of degrees and the degree spectra of structuresComputably enumerable (c.e.) sets
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
Страница 4 из 100502
Фасеты
Партнеры
Индексация
