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

degreessemilattice

Mathematics Subject Classification ID

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

Review text

It is proved that \(Th(L_{\ell})\neq Th(L_ r)\), where \(r\in \{tt,p,d\}\) and \(L_{\ell}\) \((L_ r)\) is the semilattice of r.e. \(\ell\)-degrees (r- degrees). Some facts about connections between c-, bd-, \(\ell\)-, d- completeness are given.

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

• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• 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?)
• Hypersimple sets with retraceable complements
• Some Properties of Recursively Inseparable Sets

Cited in

(3)

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

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)