A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Friedberg splittings of recursively enumerable sets
1993
Annals of Pure and Applied Logic
Downey, R. and M. Stob, Friedberg splittings of recursively enumerable sets, Annals of Pure and Applied Logic 59 (1993) 175-199. A splitting A, UA, = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W -A not r.e., W -Ai # 0 for i = 1, 2. In an earlier paper, the authors investigated Friedberg splittings of maximal sets and showed that they formed an orbit with very interesting degree-theoretical properties. In the present paper we continue our investigations, this
doi:10.1016/0168-0072(93)90092-r
fatcat:v2eb3cqujfbqngqwgd6wltnqte