m-powers of simple sets

DOI10.1007/BF02219737zbMath0287.02027OpenAlexW2028375491MaRDI QIDQ1845718

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)

Related Items (3)

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

Cites Work

• A maximal set which is not complete
• Hypersimple sets with retraceable complements
• On the Lattice of Recursively Enumerable Sets
• Simplicity of recursively enumerable sets
• Unnamed Item

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