Recursion Theory: Computational Aspects of Definability

by Liang Yu and Chi Tat Chong

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,...

• Format: Hardcover
• Language: English
• ISBN: 3110275554
• ISBN13: 9783110275551
• Release Date: July 2015
• Publisher: de Gruyter
• Length: 320 Pages
• Weight: 1.57 lbs.
• Dimensions: 0.8" x 6.7" x 9.6"
• Grade Range: Postsecondary