A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumera - detaljert visning

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

Rod Downey
Bok Engelsk 2020

Medvirkende	Greenberg, Noam

Omfang	viii, 222 sider
Opplysninger	[alpha]-c.a. functions -- The hierarchy of totally [alpha]-c.a. degrees -- Maximal totally [alpha]-c.a. degrees -- Presentations of left-c.e. reals -- m-topped degrees -- Embeddings of the 1-3-1 lattice -- Prompt permissions.. - "This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies not only in the depth of the results contained therein, but also in the fact that the notions the authors introduce allow them to unify results from several subfields of computability theory"--
Emner	Computable functions. Recursively enumerable sets. Unsolvability (Mathematical logic)
Dewey	511.3
ISBN	9780691199658. - 9780691199665