Degree structures of conjunctive reducibility
From MaRDI portal
Publication:2118167
DOI10.1007/S00153-021-00774-7OpenAlexW3165720036MaRDI QIDQ2118167FDOQ2118167
Authors: Irakli O. Chitaia, Roland Sh. Omanadze 
Publication date: 22 March 2022
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-021-00774-7
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Recursively enumerable sets of positive integers and their decision problems
- \(Q _{1}\)-degrees of c.e. sets
- On the Degrees of Index Sets
- Algebraically closed groups
- Computational complexity, speedable and levelable sets
- Several results on upper semilattices and m-degrees
- Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
- On complexity properties of recursively enumerable sets
- A class of recursively enumerable sets
- Tabular powers of maximal sets
- On \(m\)-degrees of recursively enumerable sets
- Title not available (Why is that?)
Cited In (6)
- \(sQ_1\)-degrees of computably enumerable sets
- Completely mitotic c.e. degrees and non-jump inversion
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility
- Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
- Priority arguments in the continuous r.e. degrees
- On the degree structure of equivalence relations under computable reducibility
This page was built for publication: Degree structures of conjunctive reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118167)
