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

Abstract

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.

Categories

Keywords

Reprint years

Call number

QA9.63.D69 2020

ISBN(s)

9780691199658

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

External links

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

Through your library

My notes

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, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
Computability and Randomness.André Nies - 2009 - Oxford University Press.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Computability Theory.Valentina Harizanov, Keshav Srinivasan & Dario Verta - 2024 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Cham: Springer. pp. 1933-1961.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.

Analytics

Added to PP
2022-12-03

Downloads
9 (#1,523,857)

6 months
3 (#1,470,638)

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