Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees

DOI10.2307/2274869zbMath0631.03031OpenAlexW2093948978MaRDI QIDQ3767338

Rodney G. Downey

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274869

zbMATH Keywords

m-degreestt-degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Tabular degrees in \(\alpha\)-recursion theory ⋮ Irreducible, singular, and contiguous degrees

Cites Work

• Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
• Algorithmic problems for solvable Lie algebras
• Classical recursion theory. Vol. II
• Strong reducibilities

This page was built for publication: Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees