Isolation from side in 2-computably enumerable degrees

DOI10.3103/S1066369X20080095zbMath1454.03051OpenAlexW3082280325MaRDI QIDQ2225889

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

Turing degree\textit{wtt}-degree2-computably enumerable setisolation from side

Mathematics Subject Classification ID

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

Related Items (1)

Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isolated d.r.e. degrees are dense in r.e. degree structure
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• The recursively enumerable degrees are dense
• Interpolation and embedding in the recursively enumerable degrees
• THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES
• On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy
• Turing Definability in the Ershov Hierarchy
• Isolation and lattice embeddings
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees

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