Bücher online kaufen
Recursion Theory
Computational Aspects of Definability
Langbeschreibung
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
Preliminaries
Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.
ISBN-13:
9783110275551
Veröffentl:
2015
Erscheinungsdatum:
30.07.2015
Seiten:
322
Autor:
Liang Yu
Gewicht:
727 g
Format:
246x175x23 mm
Serie:
8, ISSN
Sprache:
Englisch
154,95 €*
Lieferzeit: Print on Demand - Lieferbar innerhalb von 3-5 Werktageni
Alle Preise inkl. MwSt.
| zzgl. Versand