Comparison of linear reducibility with other reducibilities of tabular type

DOI10.1007/BF02027227zbMath0572.03022OpenAlexW2008641420MaRDI QIDQ1062049

A. N. Degtev

Publication date: 1983

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

Full work available at URL: https://eudml.org/doc/187192

zbMATH Keywords

semilatticedegrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Polynomial clone reducibility

Cites Work

• Hypersimple sets with retraceable complements
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Some Properties of Recursively Inseparable Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison of linear reducibility with other reducibilities of tabular type