Computably Enumerable Sets and Quasi-Reducibility - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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.

The following publications are possibly variants of this publication:

Addendum to "Computably Enumerable Sets and Quasi-Reducibility"Rodney G. Downey, Geoffrey LaForte, André Nies. APAL, 98(1-3):295, 1999. [doi]

On computing graph minor obstruction setsKevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston. TCS, 233(1-2):107-127, 2000. [doi]

Differences of Computably Enumerable SetsSteffen Lempp, André Nies. mlq, 46(4):555-561, 2000. [doi]

runs on WebDSL