Comparison of linear reducibility with other reducibilities of tabular type

DOI10.1007/BF02027227MaRDI QIDQ1062049zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Semilattices of disjunctive and linear degrees
• Relations between table-type degrees
• Relations between reducibilities of table type
• Degrees of denumerability reducibilities
• On distributivity of the upper semilattices of the degrees below 0'

Cites work

• scientific article; zbMATH DE number 3689373 (Why is no real title available?)
• scientific article; zbMATH DE number 3792148 (Why is no real title available?)
• scientific article; zbMATH DE number 3604878 (Why is no real title available?)
• scientific article; zbMATH DE number 3639607 (Why is no real title available?)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Hypersimple sets with retraceable complements
• Some Properties of Recursively Inseparable Sets

Cited in

(3)

• Polynomial clone reducibility
• Relations between reducibilities of table type
• Semilattices of disjunctive and linear degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062049)