Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>

Recursion Theory: Computational Aspects of Definability

-15% su kodu: ENG15
202,65 
Įprasta kaina: 238,41 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
202,65 
Įprasta kaina: 238,41 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
2025-02-28 238.4100 InStock
Nemokamas pristatymas į paštomatus per 11-15 darbo dienų užsakymams nuo 20,00 

Knygos aprašymas

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.

Informacija

Autorius: Liang Yu, Chi Tat Chong,
Serija: ISSN
Leidėjas: De Gruyter
Išleidimo metai: 2015
Knygos puslapių skaičius: 322
ISBN-10: 3110275554
ISBN-13: 9783110275551
Formatas: 246 x 175 x 23 mm. Knyga kietu viršeliu
Kalba: Anglų

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „Recursion Theory: Computational Aspects of Definability“

Būtina įvertinti prekę

Goodreads reviews for „Recursion Theory: Computational Aspects of Definability“