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

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

Détails bibliographiques
Auteurs principaux: Downey, R. G. (Rod G.) (Auteur), Greenberg, Noam 1974- (Auteur)
Format: Electronic Resource
Langue:English
Publié: Cambridge, Massachusetts The MIT Press [2020]
Sujets:
Unsolvability (Mathematical logic)
Computable functions.
Recursively enumerable sets.
Electronic books.
Accès en ligne: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