Recursion Theory - Computational Aspects of Definability (Hardcover, Digital original)

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. 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 techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.

General

Imprint:	De Gruyter
Country of origin:	Germany
Series:	De Gruyter Series in Logic & its Applications
Release date:	July 2015
First published:	2015
Authors:	Chitat Chong • Liang Yu
Dimensions:	240 x 170mm (L x W)
Format:	Hardcover - Cloth over boards
Pages:	320
Edition:	Digital original
ISBN-13:	978-3-11-027555-1
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Science & Mathematics > Mathematics > Algebra > General Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	3-11-027555-4
Barcode:	9783110275551

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!