Skip to content
You are not logged in |Login  
     
Limit search to available items
Record:   Prev Next
Resources
More Information
Bestseller
BestsellerE-book
Author Chong, C.-T. (Chi-Tat), 1949- author.

Title Recursion theory : computational aspects of definability / Chi Tat Chong, Liang Yu.

Publication Info. Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015]
©2015

Item Status

Description 1 online resource (xiii, 306 pages).
Physical Medium polychrome
Description text file
Series De Gruyter series in logic and its applications ; Volume 8
De Gruyter series in logic and its applications ; 8.
Bibliography Includes bibliographical reference (pages 295-301) and index.
Contents Part I: Fundamental theory -- Part II: The story of turing degrees -- Part III: Hyperarithmetic degrees and perfect set properly -- Part IV: Higher randomness theory.
Summary 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.
Local Note eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America
Language In English.
Subject Recursion theory.
Recursion theory.
Genre/Form Electronic books.
Added Author Yu, Liang (Professor of mathematics), author.
Other Form: Print version: Chong, C.-T. (Chi-Tat), 1949- Recursion theory. Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015] 9783110275551 (DLC) 2015008883 (OCoLC)904420459
ISBN 9783110275643 (electronic book)
3110275643 (electronic book)
9783110275650 (electronic book)
3110275651 (electronic book)
9783110275551 (hardback)
3110275554 (hardback)
311038129X
9783110381290 (EPUB)
Standard No. 10.1515/9783110275643