Rodney G. Downey, Geoffrey LaForte, André Nies. Computably Enumerable Sets and Quasi-Reducibility. Annals of Pure and Applied Logic, 95(1-3):1-35, 1998.
@article{DowneyLN98,
title = {Computably Enumerable Sets and Quasi-Reducibility},
author = {Rodney G. Downey and Geoffrey LaForte and André Nies},
year = {1998},
researchr = {https://researchr.org/publication/DowneyLN98},
cites = {0},
citedby = {0},
journal = {Annals of Pure and Applied Logic},
volume = {95},
number = {1-3},
pages = {1-35},
}