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

מידע ביבליוגרפי
Main Authors:	Downey, R. G. (Rod G.) (Author), Greenberg, Noam 1974- (Author)
פורמט:	Electronic Resource
שפה:	English
יצא לאור:	Cambridge, Massachusetts The MIT Press [2020]
נושאים:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets. Electronic books.
גישה מקוונת:	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