Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability

摘要

There are noncomputable c.e. sets, computable from every c.e. set relative to which ?′ is strongly jump-traceable. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone.