Comparison of linear reducibility with other reducibilities of tabular type

DOI10.1007/BF02027227zbMATH Open0572.03022OpenAlexW2008641420MaRDI QIDQ1062049FDOQ1062049

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

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'\)

zbMATH Keywords

semilatticedegrees

Mathematics Subject Classification ID

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

Cites Work

• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Title not available (Why is that?)
• Hypersimple sets with retraceable complements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Properties of Recursively Inseparable Sets
• Title not available (Why is that?)

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)