Abstract
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is strongly noncuppable to a in the class R.
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
