A Hierarchy of Turing Degrees : : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / / Noam Greenberg, Rod Downey.
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2020] ©2020 |
Year of Publication: | 2020 |
Language: | English |
Series: | Annals of Mathematics Studies ;
382 |
Online Access: | |
Physical Description: | 1 online resource (240 p.) :; 3 b/w illus. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Frontmatter
- Contents
- Acknowledgments
- Chapter One. Introduction
- Chapter Two. ɑ-c.a. functions
- Chapter Three. The hierarchy of totally ɑ-c.a. degrees
- Chapter Four. Maximal totally ɑ-c.a. degrees
- Chapter Five. Presentations of left-c.e. reals
- Chapter Six. m-topped degrees
- Chapter Seven. Embeddings of the 1-3-1 lattice
- Chapter Eight. Prompt permissions
- Bibliography