Liang Yu: Recursion Theory
Recursion Theory
Buch
- Computational Aspects of Definability
- De Gruyter, 07/2015
- Einband: Gebunden, HC runder Rücken kaschiert
- Sprache: Englisch
- ISBN-13: 9783110275551
- Bestellnummer: 6213133
- Umfang: 322 Seiten
- Sonstiges: 10 schw.-w. Abb.
- Copyright-Jahr: 2015
- Gewicht: 664 g
- Maße: 246 x 172 mm
- Stärke: 25 mm
- Erscheinungstermin: 30.7.2015
- Serie: ISSN - Band 8
Achtung: Artikel ist nicht in deutscher Sprache!
Beschreibung
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.Klappentext
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.