Author:
Downey Rodney G.,Laforte Geoffrey L.,Shore Richard A.
Abstract
AbstractGiven two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ∪ c) ∩ (b ∪ c), a ∪ c ∣ b ∪ c, and c < a ∪ b.
Publisher
Cambridge University Press (CUP)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Turing Computability: Structural Theory;Journal of Mathematical Sciences;2021-05-28
2. Splitting and non-splitting in the difference hierarchy;Mathematical Structures in Computer Science;2016-06-20
3. On self-embeddings of computable linear orderings;Annals of Pure and Applied Logic;2006-03