Post's problem and his hypersimple set

DOI10.2307/2273042zbMath0279.02023OpenAlexW2171535997MaRDI QIDQ4404867

Robert I. Soare, Carl G. jun. Jockusch

Publication date: 1973

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273042

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Thue and Post systems, etc. (03D03)

Related Items

Definability of r. e. sets in a class of recursion theoretic structures ⋮ Recursively enumerable sets and degrees ⋮ Effectively hyperimmune sets and majorants ⋮ Strong reducibilities ⋮ An invariance notion in recursion theory

Cites Work

• Degrees of members of \(\Pi_ 1^ 0\) classes
• The Friedberg-Muchnik Theorem Re-Examined
• Recursively enumerable sets of positive integers and their decision problems
• Unnamed Item
• Unnamed Item