The Complexity of Orbits of Computably Enumerable Sets

Bulletin of Symbolic Logic 2008 / 03 Vol. 14; Iss. 1

The Complexity of Orbits of Computably Enumerable Sets

Peter A. Cholak, Rodney Downey and Leo A. Harrington
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:
14
Language:
english
Journal:
The Bulletin of Symbolic Logic
DOI:
10.2307/40039610
Date:
March, 2008
File:
PDF, 2.72 MB
english, 2008
Conversion to is in progress
Conversion to is failed