Recursion Theory
Computational Aspects of Definability
Seiten
| Ausstattung: Hardcover & eBook
2015
De Gruyter
978-3-11-027565-0 (ISBN)
De Gruyter
978-3-11-027565-0 (ISBN)
- Titel leider nicht mehr lieferbar
- Artikel merken
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.
Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.
| Zusatzinfo | Includes a print version and an ebook |
|---|---|
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 170 x 240 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | Higher Randomness • Hyperdegrees • Hypergrade • Jump Operator • recursion theory • Recursion Theory; Turing Degrees; Hyperdegrees; Jump Operator; Higher Randomness • Rekursionstheorie • Turing Degrees • Turinggrade |
| ISBN-10 | 3-11-027565-1 / 3110275651 |
| ISBN-13 | 978-3-11-027565-0 / 9783110275650 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
