Abstract
The first nontrivial DCE (2-computably enumerable) Turing approximation to the class of computably enumerable degrees is obtained. This depends on the following extension of the splitting theorem for the DCE degrees. For any DCE degree a and any computably enumerable degree b, if b < a, then there are DCE degrees x0, x1 such that b < x0, x1 < a and a = x0 ∨ x1. The construction is unusual in that it is incompatible with upper cone avoidance.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
