Nonbounding and Slaman triples

Steven D. Leonhardi
1996 Annals of Pure and Applied Logic  
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