tt-degrees of recursively enumerable Turing degrees. II

DOI10.1007/BF01673943zbMath0457.03039MaRDI QIDQ1150611

G. N. Kobzev

Publication date: 1980

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic problems for solvable Lie algebras
• Hypersimple sets with retraceable complements
• The weak truth table degrees of recursively enumerable sets
• Semirecursive Sets and Positive Reducibility

This page was built for publication: tt-degrees of recursively enumerable Turing degrees. II