On m-degrees of recursively enumerable sets

DOI10.1007/BF02219444MaRDI QIDQ2553432zbMATH OpenFDO

Authors S. D. Denisov

Publication date 1971

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

Full work available at URL https://doi.org/10.1007/BF02219444

Mathematics Subject Classification ID

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

Cites work

• A note on universal sets
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On degrees of unsolvability
• On the degrees less than 0'

Cited in

(4)

• Degree structures of conjunctive reducibility
• On the bounded quasi‐degrees of c.e. sets
• Rogers semilattices of limitwise monotonic numberings
• On Non-principal Arithmetical Numberings and Families

This page was built for publication: On \(m\)-degrees of recursively enumerable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553432)