#
A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability
Resource Information
The work ** A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability** represents a distinct intellectual or artistic creation found in **University of Missouri Libraries**. This resource is a combination of several types including: Work, Language Material, Books.

The Resource
A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability
Resource Information

The work

**A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability**represents a distinct intellectual or artistic creation found in**University of Missouri Libraries**. This resource is a combination of several types including: Work, Language Material, Books.- Label
- A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability

- Title remainder
- a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability

- Statement of responsibility
- Rod Downey, Noam Greenberg

- Language
- eng

- Summary
- "This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies not only in the depth of the results contained therein, but also in the fact that the notions the authors introduce allow them to unify results from several subfields of computability theory"--

- Assigning source
- Provided by publisher

- Cataloging source
- LBSOR/DLC

- Dewey number
- 511.3

- Illustrations
- illustrations

- Index
- no index present

- LC call number
- QA9.63

- LC item number
- .D69 2020

- Literary form
- non fiction

- Nature of contents
- bibliography

- Series statement
- Annals of mathematics studies

- Series volume
- number 206

## Context

Context of A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability#### Work of

No resources found

No enriched resources found

- A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability, Rod Downey, Noam Greenberg
- A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability, Rod Downey, Noam Greenberg

## Embed

### Settings

Select options that apply then copy and paste the RDF/HTML data fragment to include in your application

Embed this data in a secure (HTTPS) page:

Layout options:

Include data citation:

<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/resource/qznE1XoGOjE/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/qznE1XoGOjE/">A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>

Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements

### Preview

## Cite Data - Experimental

### Data Citation of the Work A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability

Copy and paste the following RDF/HTML data fragment to cite this resource

`<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/resource/qznE1XoGOjE/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/qznE1XoGOjE/">A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>`