Recursion Theory

Computational Aspects of Definability
1. Auflage 2015
ISBN: 978-3-11-027555-1
Verlag: De Gruyter

Buch, Englisch, Band 8, 306 Seiten, HC runder Rücken kaschiert, Format (B × H): 175 mm x 246 mm, Gewicht: 727 g

Reihe: ISSN

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.

Zielgruppe

Students, Graduates, Researchers, and Lecturers in Mathematics an

Autoren/Hrsg.

Yu, Liang

Chong, Chi Tat

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik

Über Autor(innen)

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