Recursion Theory
Computational Aspects of Definability
(Sprache: Englisch)
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...
Jetzt vorbestellen
versandkostenfrei
Buch (Gebunden)
Fr. 189.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Recursion Theory “
Klappentext zu „Recursion Theory “
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.
Inhaltsverzeichnis zu „Recursion Theory “
Preliminaries 1. 11-uniformization and Applications to Turing Degrees
2. Rigidity of Hyperdegrees
3. Basis Theorems and 11-Hyperarithmetic
4. The Jump Operator
5. Independence Results in the Turing Degrees
6. Higher Randomness
References
Index
Autoren-Porträt von Chi Tat Chong, Liang Yu
Chitat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.
Bibliographische Angaben
- Autoren: Chi Tat Chong , Liang Yu
- 2015, XIV, 306 Seiten, 10 Schwarz-Weiss-Abbildungen, mit Abbildungen, Masse: 17,5 x 24,6 cm, Gebunden, Englisch
- Verlag: De Gruyter
- ISBN-10: 3110275554
- ISBN-13: 9783110275551
- Erscheinungsdatum: 30.07.2015
Sprache:
Englisch
Pressezitat
"This book serves two purposes, and does so very well. In Part I, it provides an exposition of the now-classical theory of definability in first-order arithmetic, in the form of the arithmetic hierarchy, and in second-order arithmetic, in the form of effective descriptive set theory. This part would be a good source on which to base a graduate course on this material. In Parts II-IV, by giving a coherent and systematic treatment spanning many modern examples, it illustrates how these classical ideas have evolved into powerful mathematical tools, which is valuable both to newcomers and to experts." Mathematical Reviews "This is a very well written book by researchers who contributed with significant results to the field, the treatment is mathematical rigourous, with important open problems, and an up-dated list of references. The book is suited for advanced courses and research." Zentralblatt für Mathematik
Kommentar zu "Recursion Theory"
0 Gebrauchte Artikel zu „Recursion Theory“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Recursion Theory".
Kommentar verfassen