Degree structures of conjunctive reducibility

DOI10.1007/S00153-021-00774-7OpenAlexW3165720036MaRDI QIDQ2118167

Roland Sh. Omanadze, Irakli O. Chitaia

Publication date: 22 March 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00774-7

zbMATH Keywords

hypersimple set\(c_1\)-reducibility\(c\)-reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

\(sQ_1\)-degrees of computably enumerable sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(Q _{1}\)-degrees of c.e. sets
• A class of recursively enumerable sets
• Several results on upper semilattices and m-degrees
• Algebraically closed groups
• Tabular powers of maximal sets
• On \(m\)-degrees of recursively enumerable sets
• Hyperhypersimple sets and Q₁ -reducibility
• On complexity properties of recursively enumerable sets
• Computational complexity, speedable and levelable sets
• On the Degrees of Index Sets
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Degree structures of conjunctive reducibility