@article {IOPORT.01694870,
    author       = {Wu, Guohua},
    title        = {Isolation and the jump operator.},
    year         = {2001},
    journal      = {Mathematical Logic Quarterly (MLQ)},
    volume       = {47},
    number       = {4},
    issn         = {0942-5616},
    pages        = {525-534},
    publisher    = {Wiley-VCH, Berlin},
    doi          = {10.1002/1521-3870(200111)47:4<525::AID-MALQ525>3.0.CO;2-7},
    abstract     = {The paper deals with the Turing degrees of differences of recursively (= computably) enumerable degrees. The author constructs recursively enumerable sets $A,B,C$ such that $A$ has low$_2$ Turing degree, the d.r.e.\ set $D = B-C$ has high Turing degree and the Turing degree of $D$ is isolated above $A$, that is, every recursively enumerable set $E$ below $D$ is already below $A$: $E \leq_T D \Rightarrow E \leq_T A$. The author announces that the result can be improved: Together with Ishmukhametov he constructed $A,B,C$ as above with the improvement that the Turing degree of $A$ is low and not only low$_2$.},
    reviewer     = {Frank Stephan (Heidelberg)},
    identifier   = {01694870},
}