COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM...

Journal of Symbolic Logic 2014 / 09 Vol. 79; Iss. 3

COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY

IANOVSKI, EGOR, MILLER, RUSSELL, NG, KENG MENG, NIES, ANDRÉ
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
79
Language:
english
Journal:
The Journal of Symbolic Logic
DOI:
10.1017/jsl.2013.33
Date:
September, 2014
File:
PDF, 438 KB
english, 2014
Conversion to is in progress
Conversion to is failed