Computably Enumerable Sets and Quasi-Reducibility

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.

Abstract

Abstract is missing.