Recursion Theory: Computational Aspects of Definability

Main
Mathematics
Recursion Theory: Computational Aspects...

Recursion Theory: Computational Aspects of Definability

Name: Recursion Theory: Computational Aspects of Definability
ISBN: 9783110275551

Chi Tat Chong, Liang Yu

5.0 / 0

0 comments

この本はいかがでしたか？

ファイルの質はいかがですか？

質を評価するには、本をダウンロードしてください。

ダウンロードしたファイルの質はいかがでしたか？

This monograph presents recursion theory from a generalized and largely global point of view. 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 ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

カテゴリー:

Mathematics

年:

2015

出版社:

de Gruyter

言語:

english

ページ:

306

ISBN 10:

3110275554