
Recursion Theory
Computational Aspects of Definability
De Gruyter (Publisher)
Published on 17. August 2015
Book
Mixed media product
XIV, 306 pages
978-3-11-027565-0 (ISBN)
Article is exhausted; no reprint
Description
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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Target group
Professional and scholarly
US School Grade: College Graduate Student
Illustrations
Includes a print version and an ebook
Dimensions
Height: 24 cm
Width: 17 cm
ISBN-13
978-3-11-027565-0 (9783110275650)
Schweitzer Classification
Persons
Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.