По вашему запросу найдено документов: 16252
Страница 1 из 1626
Definable relations in Turing degree structures and degrees in the Ershov difference hierarchy. © 2013 The Author, 2013. Published by Oxford University Press
Definable relations in Turing degree structures and degrees in the Ershov difference hierarchy. © 2013 The Author, 2013. Published by Oxford University Press
Extending Cooper’s theorem to Δ30 Turing degrees a 2-c.e. Turing degree which doesn't contain a c.e. set. Thus, he showed that the second level
Computable Embeddings of Classes of Structures Under Enumeration and Turing Operators characterizations of the Turing and enumeration computable embeddings of classes of structures.
On Degree Spectra of Topological Spaces-computability’’ is measured by the so called degree spectrum, i.e. the set of Turing degrees that compute an isomorphic copy
Algorithmic reducibilities of algebraic structuresTuring degrees
Degrees of categoricity of rigid structures© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing
Turing Degrees in Refinements of the Arithmetical Hierarchy of characterizing proper levels of the fine hierarchy (up to Turing equivalence). It is known that the fine
Strong noncuppability in low computably enumerable degreesWe prove the existence of noncomputable low computably enumerable degrees b < a such that b
Enumeration degrees and enumerability of familesWe study the enumerability of families relative to the enumeration degrees. It is shown that if a
Страница 1 из 1626
Фасеты
Партнеры
Индексация
