Splittings of effectively speedable sets and effectively levelable sets
Roland Sh. Omanadze · Journal of Symbolic Logic · 2004
Abstract We prove that a computably enumerable set A is effectively speedable (effectively levelable) if and only if there exists a splitting (A0, A1) of A such that both A0 and A1 are effectively speedable (effectively levelable). These results answer two questions raised by J. B. Remmel.