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

Bibliografiset tiedot
Päätekijät:	Downey, R. G. (Rod G.) (Tekijä), Greenberg, Noam 1974- (Tekijä)
Aineistotyyppi:	Electronic Resource
Kieli:	English
Julkaistu:	Cambridge, Massachusetts The MIT Press [2020]
Aiheet:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets. Electronic books.
Linkit:	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