Splitting in 2-computably enumerable degrees with avoiding cones

DOI10.3103/S1066369X09060127zbMath1185.03069OpenAlexW2152094373MaRDI QIDQ735982

M. M. Yamaleev

Publication date: 26 October 2009

Published in: Russian Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

splitting2-c.e. degreesavoiding cones

Mathematics Subject Classification ID

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

Related Items (5)

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ On the problem of definability of the computably enumerable degrees in the difference hierarchy ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

Cites Work

• Weak density and cupping in the d-r.e. degrees
• Splitting and cone avoidance in the d.c.e. degrees
• On the degrees less than 0'
• On Downey's conjecture
• A Splitting Theorem for the N-R.E. Degrees

This page was built for publication: Splitting in 2-computably enumerable degrees with avoiding cones