A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206)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 in topology, group theory, and other subfields. |
Contents
oc a functions | 23 |
The hierarchy of totally cÂșc a degrees | 55 |
Maximal totally Oc a degrees | 84 |
Presentations of leftc e reals | 106 |
Embeddings of the 131 lattice | 149 |
Prompt permissions | 188 |
Bibliography | 215 |