A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / Rod Downey and Noam Greenberg.

Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields. This book introduces a new...

Full description

Bibliographic Details

Online Access:	Full Text (via University Press Scholarship Online)
Main Authors:	Downey, R. G. (Rod G.) (Author), Greenberg, Noam, 1974- (Author)
Format:	eBook
Language:	English
Published:	Princeton : Princeton University Press, 2021.
Series:	Annals of mathematics studies ; number 206. Princeton scholarship online.
Subjects:	Unsolvability (Mathematical logic) Computable functions. Recursively enumerable sets.