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

Princeton: Princeton University Press. Edited by Noam Greenberg (2020)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Computability and Randomness.André Nies - 2009 - Oxford University Press.


Added to PP

5 (#847,061)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references