Fr. 173.00

Recursion Theory - Computational Aspects of Definability

English · Hardback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

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.

List of contents

Preliminaries
1. 11-uniformization and Applications to Turing Degrees
2. Rigidity of Hyperdegrees
3. Basis Theorems and 11-Hyperarithmetic
4. The Jump Operator
5. Independence Results in the Turing Degrees
6. Higher Randomness
References
Index

About the author










Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.

Report

"This book serves two purposes, and does so very well. In Part I, it provides an exposition of the now-classical theory of definability in first-order arithmetic, in the form of the arithmetic hierarchy, and in second-order arithmetic, in the form of effective descriptive set theory. This part would be a good source on which to base a graduate course on this material. In Parts II-IV, by giving a coherent and systematic treatment spanning many modern examples, it illustrates how these classical ideas have evolved into powerful mathematical tools, which is valuable both to newcomers and to experts." Mathematical Reviews
"This is a very well written book by researchers who contributed with significant results to the field, the treatment is mathematical rigourous, with important open problems, and an up-dated list of references. The book is suited for advanced courses and research." Zentralblatt für Mathematik

Product details

Authors Chi Ta Chong, Chi Tat Chong, Liang Yu
Publisher De Gruyter
 
Languages English
Product format Hardback
Released 01.08.2015
 
EAN 9783110275551
ISBN 978-3-11-027555-1
No. of pages 306
Dimensions 175 mm x 22 mm x 247 mm
Weight 664 g
Illustrations 10 schw.-w. Abb.
Series de Gruyter Series in Logic and Its Applications
De Gruyter Series in Logic and Its Applications
ISSN
Subject Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.