Arslanov M.; Cooper S.; Li A.
(2000)
We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A, then there is a c. e. splitting A0 ∐ A1 = A such that Ai ⊗ L <T A. In particular, if L is low and n-c. e., then Ai ⊗ L ...