Recursion Theory: Computational Aspects of Definability

Main
Mathematics
Recursion Theory: Computational Aspects...

Recursion Theory: Computational Aspects of Definability

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

Chi Tat Chong, Liang Yu

5.0 / 0

0 comments

كم أعجبك هذا الكتاب؟

ما هي جودة الملف الذي تم تنزيله؟

قم بتنزيل الكتاب لتقييم الجودة

ما هي جودة الملفات التي تم تنزيلها؟

This monograph presents recursion theory from a generalized and largely global point of view. 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 ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

الفئات:

Mathematics

عام:

2015

الناشر:

de Gruyter

اللغة:

english

الصفحات:

306

ISBN 10:

3110275554