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

Bibliografiska uppgifter
Huvudupphovsmän:	Downey, R. G. (Rod G.) (Författare, medförfattare), Greenberg, Noam 1974- (Författare, medförfattare)
Materialtyp:	Electronic Resource
Språk:	English
Publicerad:	Cambridge, Massachusetts The MIT Press [2020]
Ämnen:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets. Electronic books.
Länkar:	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