|
Books > Science & Mathematics > Mathematics > Algebra
|
Buy Now
Recursion Theory - Computational Aspects of Definability (Hardcover, Digital original)
Loot Price: R4,396
Discovery Miles 43 960
|
|
|
Recursion Theory - Computational Aspects of Definability (Hardcover, Digital original)
Series: De Gruyter Series in Logic & its Applications
Expected to ship within 12 - 17 working days
|
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
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!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
