Effectively hyperimmune sets and majorants
From MaRDI portal
The main results are: i) every effectively immune set which is a Boolean combination of r.e. sets has Turing degree 0', ii) every effectively hyperimmune set is effectively immune, iii) every infinite set which majorizes all p.r. functions is effectively hyperimmune, iv) every effectively hyperimmune set majorizes all recursive functions.
Recommendations
Cites work
- A lattice property of Post's simple set
- Complete Recursively Enumerable Sets
- Completeness, the Recursion Theorem, and Effectively Simple Sets
- Effectively Simple Sets
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3316917 (Why is no real title available?)
- Post's problem and his hypersimple set
- Recursively enumerable sets of positive integers and their decision problems
Cited in
(8)- \(e\)-immune sets
- A reducibility related to being hyperimmune-free
- scientific article; zbMATH DE number 3859105 (Why is no real title available?)
- ON THE STRUCTURE OF FAMILIES OF IMMUNE, HYPERIMMUNE AND HYPERHYPERIMMUNE SETS
- scientific article; zbMATH DE number 4004170 (Why is no real title available?)
- The degrees of bi-hyperhyperimmune sets
- Constructivity conditions on immune sets
- Immunity and non-cupping for closed sets
This page was built for publication: Effectively hyperimmune sets and majorants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820774)
