Recursion Theory: Computational Aspects of Definability
Chi Tat Chong, Liang Yu
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.
Категорії:
Рік:
2015
Видавництво:
de Gruyter
Мова:
english
Сторінки:
306
ISBN 10:
3110275554
ISBN 13:
9783110275551
Серії:
De Gruyter Series in Logic and Its Applications 8
Файл:
PDF, 1.57 MB
IPFS:
,
english, 2015