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

書誌詳細
主要な著者:	Downey, R. G. (Rod G.) (著者), Greenberg, Noam 1974- (著者)
フォーマット:	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