Some properties of r-maximal sets and Q₁,N-reducibility
From MaRDI portal
Publication:892147
DOI10.1007/S00153-015-0451-XzbMATH Open1348.03037OpenAlexW2129350592MaRDI QIDQ892147FDOQ892147
Authors: Roland Sh. Omanadze
Publication date: 18 November 2015
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-015-0451-x
Recommendations
- Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
- Nonbounding \(n\)-c.e. \(Q\)-degrees
- Computably enumerable sets and quasi-reducibility
- \(Q _{1}\)-degrees of c.e. sets
- scientific article; zbMATH DE number 1779426
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
- Degree structures of conjunctive reducibility
- On the degree structure of equivalence relations under computable reducibility
- Q-degrees of \(n\)-c.e. sets
- Non-isolated quasi-degrees
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?)
- Semirecursive Sets and Positive Reducibility
- On the Degrees of Index Sets. II
- Upper semilattice of recursively enumerable Q-degrees
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- One class of partial sets
- Title not available (Why is that?)
- Nowhere simple sets and the lattice of recursively enumerable sets
- \(Q _{1}\)-degrees of c.e. sets
- On the Lattice of Recursively Enumerable Sets
- Splitting theorems in recursion theory
- Relationships Between Reducibilities
- ON WAYS OF CHARACTERIZING COMPLETE SETS
- Major sets, classes of simple sets, and Q-complete sets
- One strengthening of \(Q\)-reducibility
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Properties of Recursively Inseparable Sets
Cited In (11)
- 1-reducibility inside an m-degree with a maximal set
- \(sQ_1\)-degrees of computably enumerable sets
- r‐Maximal sets and Q1,N‐reducibility
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper semilattice of recursively enumerable Q-degrees
- R.e. Prime powers and total rigidity
- On the bounded quasi‐degrees of c.e. sets
- Non-isolated quasi-degrees
- Title not available (Why is that?)
This page was built for publication: Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892147)