Recursion theory : computational aspects od definability
著者
書誌事項
Recursion theory : computational aspects od definability
(De Gruyter series in logic and its applications, v. 8)
Walter de Gruyter, c2015
大学図書館所蔵 件 / 全3件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [295]-301) and index
内容説明・目次
内容説明
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.
目次
Preliminaries
1. 11-uniformization and Applications to Turing Degrees
2. Rigidity of Hyperdegrees
3. Basis Theorems and 11-Hyperarithmetic
4. The Jump Operator
5. Independence Results in the Turing Degrees
6. Higher Randomness
References
Index
「Nielsen BookData」 より