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

Xehetasun bibliografikoak
Egile Nagusiak:	Downey, R. G. (Rod G.) (Egilea), Greenberg, Noam 1974- (Egilea)
Formatua:	Electronic Resource
Hizkuntza:	ingelesa
Argitaratua:	Cambridge, Massachusetts The MIT Press [2020]
Gaiak:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets. Electronic books.
Sarrera elektronikoa:	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