A hierarchy of Turing degrees a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability

Manylion Llyfryddiaeth
Prif Awduron:	Downey, R. G. (Rod G.) (Awdur), Greenberg, Noam 1974- (Awdur)
Fformat:	Electronic Resource
Iaith:	English
Cyhoeddwyd:	Cambridge, Massachusetts The MIT Press [2020]
Pynciau:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets. Electronic books.
Mynediad Ar-lein:	Also available remotely for University of the Philippines System via IEEE Xplore. Click here to access thru EZproxy Available for University of the Philippines System via IEEE Xplore. Click here to access