Three theorems on tt-degrees

DOI10.1007/BF01670286zbMath0436.03041OpenAlexW2327273690MaRDI QIDQ1140637

A. N. Degtev

Publication date: 1979

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01670286

zbMATH Keywords

Turing degreesrecursively enumerable degreesbtt-degreenonrecursive tt-degree

Mathematics Subject Classification ID

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

Related Items

Degree theoretic definitions of the low₂ recursively enumerable sets

Cites Work

• Unnamed Item
• Recursively Enumerable Sets and Retracing Functions
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Relationships Between Reducibilities
• Semirecursive Sets and Positive Reducibility