- Additional Authors
- Greenberg, Noam
- Found In
- Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English 9783110704716
- Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 9783110704518
- Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 English 9783110704846
- Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 9783110704662
- Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 9783110494914
- Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2020 9783110690088
- Series Statement
- Annals of Mathematics Studies ; 382
- Uniform Title
- Hierarchy of Turing Degrees (Online)
- Alternative Title
- Hierarchy of Turing Degrees (Online)
- Subject
- Access (note)
- Access restricted to authorized users.
- System Details (note)
- Mode of access: Internet via World Wide Web.
- Language (note)
- Contents
- Frontmatter -- Contents -- Acknowledgments -- Chapter One. Introduction -- Chapter Two. <U+0251>-c.a. functions -- Chapter Three. The hierarchy of totally <U+0251>-c.a. degrees -- Chapter Four. Maximal totally <U+0251>-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
- LCCN
- 2019052456
- 10.1515/9780691200217
- OCLC
- ssj0002789516
- Author
Downey, Rod.
- Title
A Hierarchy of Turing Degrees [electronic resource] : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / Noam Greenberg, Rod Downey.
- Imprint
Princeton, NJ : Princeton University Press, [2020]
- Description
1 online resource (240 p.) : 3 b/w illus.
- Digital File Characteristics
text file PDF
- Series
Annals of Mathematics Studies ; 382
- Access
Access restricted to authorized users.
- Summary
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 Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
- System Details
Mode of access: Internet via World Wide Web.
- Language
In English.
- Source of description
Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)
- Connect to:
- Added Author
Greenberg, Noam.
- Found In:
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English 9783110704716
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 9783110704518 ZDB-23-DGG
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 English 9783110704846
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 9783110704662 ZDB-23-DMA
Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 9783110494914 ZDB-23-PMB
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2020 9783110690088
- Other Standard Identifier
10.1515/9780691200217 doi