Degree structures of conjunctive reducibility
From MaRDI portal
Publication:2118167
Recommendations
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3529833 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A class of recursively enumerable sets
- Algebraically closed groups
- Computational complexity, speedable and levelable sets
- Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
- On \(m\)-degrees of recursively enumerable sets
- On complexity properties of recursively enumerable sets
- On the Degrees of Index Sets
- Recursively enumerable sets of positive integers and their decision problems
- Several results on upper semilattices and m-degrees
- Tabular powers of maximal sets
- \(Q _{1}\)-degrees of c.e. sets
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)