Completing pseudojump operators
Abstract We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K . We introduce notions of nontriviality for such operators, and use these to study which additional properties can be required of sets which can be completed to the jump by given operators of this kind.