По вашему запросу найдено документов: 1005012
Страница 3 из 100502
There is no low maximal d. c. e. degree - CorrigendumComputably enumerable set
Positive Numberings in Admissible Sets such that there exists a positive computable A-numbering of the family of all A-c.e. sets, whereas any negative
Partial Decidable Presentations in Hyperarithmetic are found that reflect the presence of decidable computable Π11- and Σ11-numberings of these families
Enumeration degrees and enumerability of familes family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable
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
On computably enumerable structures by the author at Algebra Computability and Logic conference in Kazan, June 1–6, 2014. The paper is a new
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
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
Enumeration degrees and enumerability of familes family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable
Definable relations in Turing degree structuresIn this paper we investigate questions about the definability of classes of n-computably enumerable
Страница 3 из 100502
Фасеты
Партнеры
Индексация
