Recursion Theory: Computational Aspects of Definability - Couverture rigide

Livre 8 sur 10: De Gruyter Series in Logic and Its Applications

Chong, Chi Tat; Yu, Liang

 
9783110275551: Recursion Theory: Computational Aspects of Definability

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l?auteur

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

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Autres éditions populaires du même titre

9783110275650: Recursion Theory: Computational Aspects of Definability

Edition présentée

ISBN 10 :  3110275651 ISBN 13 :  9783110275650
Editeur : De Gruyter, 2015
Couverture souple