m-powers of simple sets

DOI10.1007/BF02219737MaRDI QIDQ1845718zbMATH OpenOpenAlexFDO

Authors A. N. Degtev

Publication date 1973

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

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3342829 (Why is no real title available?)
• A maximal set which is not complete
• Hypersimple sets with retraceable complements
• On the Lattice of Recursively Enumerable Sets
• Simplicity of recursively enumerable sets

Cited in

(3)

• r‐Maximal sets and Q1,N‐reducibility
• Strong reducibilities
• Degrees of sets having no subsets of higher m- and t t-degree

This page was built for publication: m-powers of simple sets

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