A class of hypersimple incomplete sets

DOI10.1007/BF01157017zbMath0597.03024OpenAlexW2003218671MaRDI QIDQ1078559

Marat M. Arslanov

Publication date: 1985

Published in: Mathematical Notes (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Strong enumeration reducibilities

Cites Work

• On the Lattice of Recursively Enumerable Sets
• Degrees of recursively enumerable sets which have no maximal supersets
• Semirecursive Sets and Positive Reducibility
• A Theorem on Hypersimple Sets
• Recursively enumerable sets of positive integers and their decision problems