This monograph presents recursion theory from a generalized and largely global point of view. 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 ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.
This monograph presents recursion theory from a generalized and largely global point of view. 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 ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.
Recursion Theory: Computational Aspects of Definability
320
Recursion Theory: Computational Aspects of Definability
320Related collections and offers
Product Details
| ISBN-13: | 9783110381290 |
|---|---|
| Publisher: | De Gruyter |
| Publication date: | 08/17/2015 |
| Series: | De Gruyter Series in Logic and Its Applications , #8 |
| Sold by: | Barnes & Noble |
| Format: | eBook |
| Pages: | 320 |
| File size: | 15 MB |
| Note: | This product may take a few minutes to download. |
| Age Range: | 18 Years |