Zur Seitenansicht


A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / Rod Downey, Noam Greenberg
VerfasserDowney, R. G. In der Gemeinsamen Normdatei der DNB nachschlagen In Wikipedia suchen nach R. G. Downey ; Greenberg, Noam In der Gemeinsamen Normdatei der DNB nachschlagen In Wikipedia suchen nach Noam Greenberg
ErschienenPrinceton ; Oxford : Princeton University Press, 2020
Umfangviii, 222 Seiten : Illustrationen
SerieAnnals of mathematics studies ; number 206
SchlagwörterUnsolvability (Mathematical logic) In Wikipedia suchen nach Unsolvability (Mathematical logic) / Computable functions In Wikipedia suchen nach Computable functions / Recursively enumerable sets In Wikipedia suchen nach Recursively enumerable sets
Download A hierarchy of Turing degrees [0,32 mb]
Verfügbarkeit In meiner Bibliothek

[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"--