Recursion Theory: Computational Aspects of Definability: 8 (De Gruyter Series in Logic & its Applications, 8) - Tapa dura

Libro 8 de 10: De Gruyter Series in Logic and Its Applications

Chong, Chi Tat

 
9783110275551: Recursion Theory: Computational Aspects of Definability: 8 (De Gruyter Series in Logic & its Applications, 8)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9783110275650: Recursion Theory: Computational Aspects of Definability: 8 (De Gruyter Series in Logic & its Applications)

Edición Destacada

ISBN 10:  3110275651 ISBN 13:  9783110275650
Editorial: De Gruyter, 2015
Tapa blanda