0

Recursion Theory

Computational Aspects of Definability, De Gruyter Series in Logic and Its Applications 8

Erschienen am 30.07.2015, 1. Auflage 2015
164,95 €
(inkl. MwSt.)

Lieferbar innerhalb 1 - 2 Wochen

In den Warenkorb
Bibliografische Daten
ISBN/EAN: 9783110275551
Sprache: Englisch
Umfang: XIV, 306 S.
Format (T/L/B): 2.2 x 24.5 x 17.5 cm
Einband: gebundenes Buch

Beschreibung

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.

Produktsicherheitsverordnung

Hersteller:
Walter de Gruyter GmbH
De Gruyter GmbH
productsafety@degruyterbrill.com
Genthiner Strasse 13
DE 10785 Berlin


Autorenportrait

Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.

Weitere Artikel aus der Reihe "De Gruyter Series in Logic and Its Applications"

Lieferbar innerhalb 1 - 2 Wochen

179,95 €
inkl. MwSt.

Lieferbar innerhalb 1 - 2 Wochen

189,95 €
inkl. MwSt.

Lieferbar innerhalb 1 - 2 Wochen

109,95 €
inkl. MwSt.

Lieferbar innerhalb 1 - 2 Wochen

229,00 €
inkl. MwSt.

Lieferbar innerhalb 1 - 2 Wochen

199,95 €
inkl. MwSt.
Alle Artikel anzeigen