A Simple Set Which is Not Effectively Simple

DOI10.2307/2034348MaRDI QIDQ5534922zbMATH OpenOpenAlexFDO

Authors Gerald E. Sacks

Publication date 1964

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

zbMATH Keywords

mathematical logic

Cites work

• Creative sets
• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Recursively enumerable sets of positive integers and their decision problems
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited in

(5)

• On effectively hypersimple sets
• Effective bi-immunity and randomness
• Recursively enumerable sets and degrees
• Completeness, the Recursion Theorem, and Effectively Simple Sets
• Constructivity conditions on immune sets

This page was built for publication: A Simple Set Which is Not Effectively Simple

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