Recursion Theory: Computational Aspects of Definability - Couverture rigide

Chong, Chi Tat; Yu, Liang

Couverture rigide

ISBN 10 : 3110275554 ISBN 13 : 9783110275551

Editeur : De Gruyter, 2015

Synopsis

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.

A propos du livre

À propos de l?auteur

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

Détails de l'édition

• Éditeur: De Gruyter
• Date d'édition: 2015
• Langue: anglais
• ISBN 10: 3110275554
• ISBN 13: 9783110275551
• Reliure: Relié
• Nombre de pages: 320
• Coordonnées du fabricant: productsafety@degruyterbrill.com; productsafety@degruyterbrill.com; ; Theaterstraße 13; Göttingen; 37073; Allemagne