Book description
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.
The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
Table of contents
- Cover
- Title
- Copyright
- Preface
- Contents
- Preface
- Part I: Fundamental theory
- Part II: The story of Turing degrees
- Part III: Hyperarithmetic degrees and perfect set property
- Part IV: Higher randomness theory
- A Open problems
- B An interview with Gerald E. Sacks
- C Notations and symbols
- Endnotes
- Bibliography
- Index
Product information
- Title: Recursion Theory
- Author(s):
- Release date: August 2015
- Publisher(s): De Gruyter
- ISBN: 9783110381290
You might also like
book
Theory of Computation
Learn the skills and acquire the intuition to assess the theoretical limitations of computer programming Offering …
book
Galois Theory, 4th Edition
Since 1973, Galois Theory has been educating undergraduate students on Galois groups and classical Galois theory. …
audiobook
Intentional Mindset
Some people seem to be born with a mental makeup that predestines them for success. But …
book
BioCoder #11
BioCoder is a quarterly newsletter for DIYbio, synthetic bio, and anything related. Youâ??ll discover: Articles about …