Splitting in 2-computably enumerable degrees with avoiding cones

DOI10.3103/S1066369X09060127zbMATH Open1185.03069OpenAlexW2152094373MaRDI QIDQ735982FDOQ735982

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

Recommendations

• Splitting and cone avoidance in the d.c.e. degrees
• Splitting and jump inversion in the Turing degrees
• Isolated 2-computably enumerable \(Q\)-degrees
• A Splitting with Infimum in the d-c. e. Degrees
• An Interval of Computably Enumerable Isolating Degrees

zbMATH Keywords

splitting2-c.e. degreesavoiding cones

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Turing computability: structural theory
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• Special splitting in the 2-c.e. Turing degrees
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
• A Survey of Results on the d-c.e. and n-c.e. Degrees

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

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