One strengthening of \(Q\)-reducibility

DOI10.1007/BF00750555zbMath0842.03034MaRDI QIDQ1910291

Roland Sh. Omanadze

Publication date: 24 July 1996

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

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

zbMATH Keywords

r.e. setsbsQ-reducibilitycomplete \(m\)-degree

Mathematics Subject Classification ID

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

Related Items

Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ On the bounded quasi‐degrees of c.e. sets

Cites Work

• Unnamed Item
• Unnamed Item
• w tt-Complete Sets are not Necessarily tt-Complete
• Nowhere simple sets and the lattice of recursively enumerable sets
• Semirecursive Sets and Positive Reducibility