По вашему запросу найдено документов: 30650
Страница 4 из 3065
Definable relations in Turing degree structuresIn this paper we investigate questions about the definability of classes of n-computably enumerable
The enumeration spectrum hierarchy of α-families and lowα degrees level of the hierarchy and that the collection of non-lowα degrees for every computable ordinal α
CEA Operators and the Ershov Hierarchy^0$ Turing degrees. We study the long-standing problem raised in [1] about the existence of a low computably
Restrictions on the degree spectra of algebraic structuresWe construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b
Strong Degrees of Categoricity and Weak Density© 2020, Pleiades Publishing, Ltd. Abstract: It is well-known that every c.e. Turing degree
On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees
Non-isolated quasi-degreesWe show that non-isolated from below 2-c.e. Q-degrees are dense in the structure of c.e. Q-degrees
Algorithmic reducibilities of algebraic structurese-degrees (enumeration degrees)
Definable relations in Turing degree structuresIn this paper we investigate questions about the definability of classes of n-computably enumerable
The complements of lower cones of degrees and the degree spectra of structures© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable
Страница 4 из 3065
Фасеты
Партнеры
Индексация
