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.
Nonbounding and Slaman triples
1996
Annals of Pure and Applied Logic
Preserved Fulltext
We consider the relationship of the lattice-theoretic properties and the jump-theoretic properties satisfied by a recursively enumerable Turing degree. The existence is shown of a high2 r.e. degree which does not hound what we call the base of any Slaman triple. *
doi:10.1016/0168-0072(95)00044-5
fatcat:fdohubhdlfbxhatl5dqvxcvpqi