The impossibility of finding relative complements for recursively enumerable degrees
- 2 September 1966
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 31 (3) , 434-454
- https://doi.org/10.2307/2270459
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.Keywords
This publication has 3 references indexed in Scilit:
- The Recursively Enumerable Degrees are DenseAnnals of Mathematics, 1964
- Introduction to Metamathematics. By S. C. Kleene. Pp. x, 550, Fl. 32.50. 1952. (Noordhoff, Groningen; North-Holland Publishing Co., Amsterdam)The Mathematical Gazette, 1954
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944