Abstract
J. R. Shoenfield conjectured in a talk at the Berkeley Model Theory Symposium (1963) that, if b and d are non-zero recursively enumerable (r.e.) degrees such that b < d then there exists an r.e. degree c such that c < d and b U c = d. G. E. Sacks echoed this conjecture at the end of [3]. In this paper the conjecture is disproved. We construct r.e. degrees b, d such that 0 < b < d and such that for no r.e. degree c is it true that c < d and b U c = d. We are grateful to G. E. Sacks for suggesting this problem.
Publisher
Cambridge University Press (CUP)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Peano Arithmetic Models and Computability;Algebraic Computability and Enumeration Models;2016-02-25
2. Degrees of Unsolvability;Computational Logic;2014
3. Degree Structures: Local and Global Investigations;Bulletin of Symbolic Logic;2006-09
4. The ∀∃-theory of ℛ(≤,∨,∧) is undecidable;Transactions of the American Mathematical Society;2003-10-08
5. Cupping the Recursively Enumerable Degrees by D.R.E. Degrees;Proceedings of the London Mathematical Society;1999-07