Post's problem and his hypersimple set

DOI10.2307/2273042MaRDI QIDQ4404867zbMATH OpenOpenAlexFDO

Authors Carl G. jun. Jockusch, Robert I. Soare

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

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

Cites work

• Degrees of members of \(\Pi_ 1^ 0\) classes
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3387326 (Why is no real title available?)
• Recursively enumerable sets of positive integers and their decision problems
• The Friedberg-Muchnik Theorem Re-Examined

Cited in

(5)

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

This page was built for publication: Post's problem and his hypersimple set

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