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.
Thể loại:
Năm:
2015
Nhà xuát bản:
de Gruyter
Ngôn ngữ:
english
Trang:
306
ISBN 10:
3110275554
ISBN 13:
9783110275551
Loạt:
De Gruyter Series in Logic and Its Applications 8
File:
PDF, 1.57 MB
IPFS:
,
english, 2015
Amazon 
Barnes & Noble 
Bookshop.org
Bạn có muốn thêm cừa hàng sách? Xin liên lạc theo support@z-lib.do
Chuyển đổi tập tin
Các kết quả tìm kiếm tiếp theo
Các lợi ích khác 
Từ khóa thường sử dụng nhất
Các mục liên quan
