The Resource 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
Resource Information
The item 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 represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item 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 represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 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"
 Language
 eng
 Extent
 viii, 222 pages
 Contents

 [Alpha]c.a. functions
 The hierarchy of totally [alpha]c.a. degrees
 Maximal totally [alpha]c.a. degrees
 Presentations of leftc.e. reals
 mtopped degrees
 Embeddings of the 131 lattice
 Prompt permissions
 Isbn
 9780691199665
 Label
 A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability
 Title
 A hierarchy of Turing degrees
 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
 http://library.link/vocab/creatorName
 Downey, R. G.
 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
 http://library.link/vocab/relatedWorkOrContributorDate
 1974
 http://library.link/vocab/relatedWorkOrContributorName
 Greenberg, Noam
 Series statement
 Annals of mathematics studies
 Series volume
 number 206
 http://library.link/vocab/subjectName

 Unsolvability (Mathematical logic)
 Computable functions
 Recursively enumerable sets
 Computable functions
 Recursively enumerable sets
 Unsolvability (Mathematical logic)
 Label
 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
 Bibliography note
 Includes bibliographical references
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 [Alpha]c.a. functions  The hierarchy of totally [alpha]c.a. degrees  Maximal totally [alpha]c.a. degrees  Presentations of leftc.e. reals  mtopped degrees  Embeddings of the 131 lattice  Prompt permissions
 Control code
 1145894088
 Dimensions
 24 cm.
 Extent
 viii, 222 pages
 Isbn
 9780691199665
 Lccn
 2019052456
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 System control number
 (OCoLC)1145894088
 Label
 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
 Bibliography note
 Includes bibliographical references
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 [Alpha]c.a. functions  The hierarchy of totally [alpha]c.a. degrees  Maximal totally [alpha]c.a. degrees  Presentations of leftc.e. reals  mtopped degrees  Embeddings of the 131 lattice  Prompt permissions
 Control code
 1145894088
 Dimensions
 24 cm.
 Extent
 viii, 222 pages
 Isbn
 9780691199665
 Lccn
 2019052456
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 System control number
 (OCoLC)1145894088
Library Links
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 faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AhierarchyofTuringdegreesatransfinite/akGZMbbzySc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AhierarchyofTuringdegreesatransfinite/akGZMbbzySc/">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></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 Item 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
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AhierarchyofTuringdegreesatransfinite/akGZMbbzySc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AhierarchyofTuringdegreesatransfinite/akGZMbbzySc/">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></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>