On the bounded quasi‐degrees of c.e. sets
From MaRDI portal
Publication:4928973
DOI10.1002/malq.201200101zbMath1277.03040MaRDI QIDQ4928973
Publication date: 19 June 2013
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201200101
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Cites Work
- Bounded enumeration reducibility and its degree structure
- Strong enumeration reducibilities
- Upper semilattice of recursively enumerable Q-degrees
- e- and s-degrees
- One class of partial sets
- Splitting theorems in recursion theory
- Relations between certain reducibilities
- One strengthening of \(Q\)-reducibility
- On \(m\)-degrees of recursively enumerable sets
- On complexity properties of recursively enumerable sets
- Nowhere simple sets and the lattice of recursively enumerable sets
- Computational complexity, speedable and levelable sets
- Unnamed Item
- Unnamed Item
- Unnamed Item