Abstract
AbstractSay that (a, d) is an isolation pair if a is a c.e. degree, d is a d.c.e. degree, a < d and a bounds all c.e. degrees below d. We prove that there are an isolation pair (a, d) and a c.e. degree c such that c is incomparable with a, d, and c cups d to o′, caps a to o. Thus, {o, c, d, o′} is a diamond embedding, which was first proved by Downey in [9]. Furthermore, combined with Harrington-Soare continuity of capping degrees, our result gives an alternative proof of N5 embedding.
Publisher
Cambridge University Press (CUP)
Reference14 articles.
1. Recursively Enumerable Sets and Degrees
2. Cooper S. B. , Degrees of unsolvability, Ph.D. thesis, Leicester University, Leicester, England.
3. Structural properties of the degrees below o′;Arslanov;Doklady Akademii Nauk SSSR,1985
4. Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献