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.

Authors

Rodney G. Downey

This author has not been identified. Look up 'Rodney G. Downey' in Google

Geoffrey LaForte

This author has not been identified. Look up 'Geoffrey LaForte' in Google

André Nies

This author has not been identified. Look up 'André Nies' in Google