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

Detalles Bibliográficos
Main Authors:	Downey, R. G. (Rod G.) (Author), Greenberg, Noam 1974- (Author)
Formato:	Electronic Resource
Idioma:	English
Publicado:	Cambridge, Massachusetts The MIT Press [2020]
Subjects:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets. Electronic books.
Acceso en liña:	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