Recursion Theory: Computational Aspects of Definability
Chi Tat Chong, Liang YuThis 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.
カテゴリー:
年:
2015
出版社:
De Gruyter
言語:
english
ページ:
320
ISBN 10:
3110275643
ISBN 13:
9783110275643
シリーズ:
De Gruyter Series in Logic and Its Applications; 8
ファイル:
PDF, 1.70 MB
IPFS:
,
english, 2015
Amazon 
Barnes & Noble 
Bookshop.org 
ファイル拡張子変換機能
検索結果をもっと見る
その他多くの特典 
