A01=Chi Tat Chong
A01=Liang Yu
Author_Chi Tat Chong
Author_Liang Yu
Category=PBCD
Category=PBW
Category=UYA
Category=UYZM
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Rekursionstheorie
Product details
- ISBN 9783110275551
- Weight: 665g
- Dimensions: 170 x 240mm
- Publication Date: 30 Jul 2015
- Publisher: De Gruyter
- Publication City/Country: DE
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.
