Isolation from side in 2-computably enumerable degrees

DOI10.3103/S1066369X20080095MaRDI QIDQ2225889zbMATH OpenOpenAlexFDO

Authors M. M. Yamaleev

Publication date 11 February 2021

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1066369x20080095

zbMATH Keywords

2-computably enumerable set\textit{wtt}-degreeisolation from sideTuring degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• Isolated 2-computably enumerable \(Q\)-degrees
• An Interval of Computably Enumerable Isolating Degrees
• Splitting in 2-computably enumerable degrees with avoiding cones
• Isolation in the CEA hierarchy
• The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees

Cites work

• Definability and elementary equivalence in the Ershov difference hierarchy
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 841082 (Why is no real title available?)
• Interpolation and embedding in the recursively enumerable degrees
• Isolated d.r.e. degrees are dense in r.e. degree structure
• Isolation and lattice embeddings
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
• The recursively enumerable degrees are dense
• Turing Definability in the Ershov Hierarchy

Cited in

(2)

• Isolated 2-computably enumerable \(Q\)-degrees
• Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees

This page was built for publication: Isolation from side in 2-computably enumerable degrees

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