On \(m\)-degrees of recursively enumerable sets

DOI10.1007/BF02219444zbMath0239.02022MaRDI QIDQ2553432

S. D. Denisov

Publication date: 1971

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

Mathematics Subject Classification ID

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

Related Items

Rogers semilattices of limitwise monotonic numberings ⋮ On the bounded quasi‐degrees of c.e. sets ⋮ Degree structures of conjunctive reducibility

Cites Work

• Unnamed Item
• On the degrees less than 0'
• On degrees of unsolvability
• A note on universal sets