Recursion theory. Computational aspects of definability

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Chong, Chi-Tat; Yu, Liang
Series: De Gruyter series in logic and its applications 8
Publisher: Walter de Gruyter GmbH & Co
Year: 2015

Language: English
Pages: 306
Tags: Recursion theory.;Rekursionstheorie

Content: Preliminaries 1. 11-uniformization and Applications to Turing Degrees 2. Rigidity of Hyperdegrees 3. Basis Theorems and 11-Hyperarithmetic 4. The Jump Operator 5. Independence Results in the Turing Degrees 6. Higher Randomness References Index