Definable relations in Turing degree structures (c. e.) sets and
degrees in the Ershov difference hierarchy. It is proved that the class of all c. e
Definable relations in Turing degree structures (c. e.) sets and
degrees in the Ershov difference hierarchy. It is proved that the class of all c. e
Spectra of degrees of some structuresWe argue for the existence of structures with the spectrum {x : x ≥ a} of
degrees, where a
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
Structural Theory of Degrees of Unsolvability: Advances and Open ProblemsStructural Theory of
Degrees of
Unsolvability: Advances and Open Problems
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