Tabular degrees in \(\alpha\)-recursion theory

DOI10.1016/0168-0072(92)90036-YzbMath0747.03021MaRDI QIDQ1184713

Rodney G. Downey, Colin G. Bailey

Publication date: 28 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

\(\alpha\)-recursionregular setstruth-table reducibilities

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Techniques of admissible recursion theory
• Structural interactions of the recursively enumerable T- and W-degrees
• Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
• Negative solutions to Post's problem. II
• Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees
• T-Degrees, Jump Classes, and Strong Reducibilities
• Strong reducibilities
• Splitting an α-Recursively Enumerable Set
• The recursively enumerable α-degrees are dense

This page was built for publication: Tabular degrees in \(\alpha\)-recursion theory