A Hierarchy of Turing Degrees

DOI10.1515/9780691200217OpenAlexW4285074266MaRDI QIDQ5220017

Noam Greenberg, Rodney G. Downey

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1515/9780691200217

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02)

Related Items (10)

Nonlowness is independent from fickleness ⋮ Separating weak \(\alpha\)-change and \(\alpha\)-change genericity ⋮ Bounded low and high sets ⋮ Turing reducibility in the fine hierarchy ⋮ Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ Effective domination and the bounded jump ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions ⋮ Maximality and collapse in the hierarchy of α-c.a. degrees

This page was built for publication: A Hierarchy of Turing Degrees