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

DOI10.1007/S10958-023-06659-9MaRDI QIDQ6147854

M. M. Yamaleev

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx)

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
• Isolation from side in 2-computably enumerable degrees
• The recursively enumerable degrees are dense
• THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES
• On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy
• On the density of the pseudo-isolated degrees
• 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 and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees