Recursion Theory: Computational Aspects of Definability

Main
Mathematics - Logic
Recursion Theory: Computational Aspects...

Recursion Theory: Computational Aspects of Definability

Name: Recursion Theory: Computational Aspects of Definability
ISBN: 9783110275643

Chi Tat Chong, Liang Yu

0 / 0

0 comments

Որքա՞ն է ձեզ դուր եկել այս գիրքը:

Ինչպիսի՞ն է բեռնված ֆայլի որակը:

Բեռնեք գիրքը` գնահատելու դրա որակը

Ինչպիսի՞ն է բեռնված ֆայլերի որակը:

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.

Կատեգորիաներ:

Mathematics - Logic

Տարի:

2015

Հրատարակչություն:

De Gruyter

Լեզու:

english

Էջեր:

320

ISBN 10:

3110275643