Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8)
ISBN-13:
9783110275551
ISBN-10:
3110275554
Edition:
1
Author:
Chi Tat Chong, Liang Yu
Publication date:
2015
Publisher:
De Gruyter
Format:
Hardcover
320 pages
FREE US shipping
Book details
ISBN-13:
9783110275551
ISBN-10:
3110275554
Edition:
1
Author:
Chi Tat Chong, Liang Yu
Publication date:
2015
Publisher:
De Gruyter
Format:
Hardcover
320 pages
Summary
Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8) (ISBN-13: 9783110275551 and ISBN-10: 3110275554), written by authors
Chi Tat Chong, Liang Yu, was published by De Gruyter in 2015.
With an overall rating of 3.9 stars, it's a notable title among other
books. You can easily purchase or rent Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8) (Hardcover) from BooksRun,
along with many other new and used
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
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.
We would LOVE it if you could help us and other readers by reviewing the book
{user}
{createdAt}
{truncated_title}
{author_block}
by {truncated_author}
