On the problem of definability of the computably enumerable degrees in the difference hierarchy

DOI10.1134/S1995080218050037zbMATH Open1477.03161OpenAlexW2843614064WikidataQ129576846 ScholiaQ129576846MaRDI QIDQ1785041FDOQ1785041

Authors: M. M. Yamaleev, M. M. Arslanov 

Publication date: 27 September 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080218050037

Recommendations

• Definable relations in Turing degree structures
• A hierarchy of computably enumerable degrees
• Definability and elementary equivalence in the Ershov difference hierarchy
• scientific article; zbMATH DE number 1531930
• Differences of Computably Enumerable Sets

zbMATH Keywords

difference hierarchystructural propertiesdefinable relationsTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• On the r. e. predecessors of d. r. e. degrees
• Splitting and cone avoidance in the d.c.e. degrees
• Downward density of exact degrees
• On Downey's conjecture
• Differences of Computably Enumerable Sets
• Jump restricted interpolation in the recursively enumerable degrees
• Turing Definability in the Ershov Hierarchy
• Splitting in 2-computably enumerable degrees with avoiding cones
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
• Definable relations in Turing degree structures
• Nondensity of Double Bubbles in the D.C.E. Degrees

Cited In (12)

• Definability and elementary equivalence in the Ershov difference hierarchy
• Non-uniformity and generalised Sacks splitting
• Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees
• Isolation from side in 2-computably enumerable degrees
• A Note on the Differences of Computably Enumerable Reals
• A hierarchy of computably enumerable degrees
• Equivalence structures and isomorphisms in the difference hierarchy
• Differences of Computably Enumerable Sets
• Definable relations in Turing degree structures
• A Hierarchy of Turing Degrees
• Marat Mirzaevich Arslanov (on his eightieth birthday)
• Relative enumerability in the difference hierarchy

This page was built for publication: On the problem of definability of the computably enumerable degrees in the difference hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785041)