Completing pseudojump operators

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 requir...

Full description

Saved in:
Bibliographic Details
Published in:Annals of pure and applied logic 2005-11, Vol.136 (3), p.297-333
Main Authors: Coles, R., Downey, R., Jockusch, C., LaForte, G.
Format: Article
Language:English
Subjects:
Computable enumerable degrees
Pseudojump operators
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0168-0072
DOI:10.1016/j.apal.2003.07.001