Recommendations
- Nonbounding \(n\)-c.e. \(Q\)-degrees
- Computably enumerable sets and quasi-reducibility
- Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
- scientific article; zbMATH DE number 4172957
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility
- On the connections between wtt- and Q-reducibilities
- One strengthening of \(Q\)-reducibility
- Some structural properties of quasi-degrees
- Classes bounded by incomplete sets
Cites work
- Bounded enumeration reducibility and its degree structure
- Computational complexity, speedable and levelable sets
- e- and s-degrees
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Nonbounding \(n\)-c.e. \(Q\)-degrees
- Nowhere simple sets and the lattice of recursively enumerable sets
- On \(m\)-degrees of recursively enumerable sets
- On complexity properties of recursively enumerable sets
- One class of partial sets
- One strengthening of \(Q\)-reducibility
- Relations between certain reducibilities
- Splitting theorems in recursion theory
- Strong enumeration reducibilities
- Upper semilattice of recursively enumerable Q-degrees
Cited in
(7)
This page was built for publication: On the bounded quasi‐degrees of c.e. sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928973)
