Band 8
Recursion Theory Computational Aspects of Definability
Aus der Reihe
De Gruyter Series in Logic and Its Applications
-
Form:Einzelkauf Download
-
Sprache:Englisch
-
eBook Format:PDF
- PDF Fr. 192.90 ausgewählt
- ePUB Fr. 192.90
Fr. 192.90
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
Kopierschutz
Nein
Family Sharing
Nein
Text-to-Speech
Nein
Erscheinungsdatum
17.08.2015
Verlag
De Gruyter OldenbourgSeitenzahl
320 (Printausgabe)
Auflage
1. Auflage
Sprache
Englisch
EAN
9783110275643
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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung