Title of article
Completing pseudojump operators
Author/Authors
Coles، نويسنده , , R. and Downey، نويسنده , , R. and Jockusch، نويسنده , , C. and LaForte، نويسنده , , G.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
37
From page
297
To page
333
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.
Keywords
Computable enumerable degrees , Pseudojump operators
Journal title
Annals of Pure and Applied Logic
Serial Year
2005
Journal title
Annals of Pure and Applied Logic
Record number
1444173
Link To Document