product iamge

A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural 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.

Download
Search on Amazon

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): Rod Downey ; Noam Greenberg
Series: Annals of Mathematics Studies 206
Publisher: Princeton University Press
Year: 2020

Language: English
Tags: Computability theory

Contents
I. Introduction
II. ɑ-c.a. functions
III. The hierarchy of totally ɑ-c.a. degrees
IV. Maximal totally ɑ-c.a. degrees
V. Presentations of left-c.e. reals
VI. m-topped degrees
VII. Embeddings of the 1-3-1 lattice
VIII. Prompt permissions
Bibliography