A hierarchy of Turing degrees: a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability/
Downey, R. G.
A hierarchy of Turing degrees: a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability/ Rod Downey, Noam Greenberg. - viii, 222 pages: illustrations; 24 cm. - Annals of mathematics studies; number 206 . - Annals of mathematics studies; no. 206. .
Includes bibliographical references (pages [215]-222).
9780691199658 0691199655 9780691199665 0691199663
2019052456
Unsolvability (Mathematical logic)
Computable functions.
Recursively enumerable sets.
511.3 / D748h
A hierarchy of Turing degrees: a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability/ Rod Downey, Noam Greenberg. - viii, 222 pages: illustrations; 24 cm. - Annals of mathematics studies; number 206 . - Annals of mathematics studies; no. 206. .
Includes bibliographical references (pages [215]-222).
9780691199658 0691199655 9780691199665 0691199663
2019052456
Unsolvability (Mathematical logic)
Computable functions.
Recursively enumerable sets.
511.3 / D748h