A Simple Set Which is Not Effectively Simple

DOI10.2307/2034348zbMath0154.25703OpenAlexW4210665989MaRDI QIDQ5534922

Gerald E. Sacks

Publication date: 1964

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

zbMATH Keywords

mathematical logic

Related Items

Effective Bi-immunity and Randomness, Completeness, the Recursion Theorem, and Effectively Simple Sets, Recursively enumerable sets and degrees, On effectively hypersimple sets

Cites Work

• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets
• Unnamed Item
• Unnamed Item