Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility

DOI10.1007/s00153-015-0451-xzbMath1348.03037OpenAlexW2129350592MaRDI QIDQ892147

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

zbMATH Keywords

splittingdegreesupper semilattice\(Q_{1,N}\)-reducibility\(r\)-maximal set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

r‐Maximal sets and Q1,N‐reducibility ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ R.e. Prime powers and total rigidity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(Q _{1}\)-degrees of c.e. sets
• Upper semilattice of recursively enumerable Q-degrees
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• One class of partial sets
• Splitting theorems in recursion theory
• Major sets, classes of simple sets, and Q-complete sets
• One strengthening of \(Q\)-reducibility
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• Nowhere simple sets and the lattice of recursively enumerable sets
• On the Lattice of Recursively Enumerable Sets
• On the Degrees of Index Sets. II
• Relationships Between Reducibilities
• Semirecursive Sets and Positive Reducibility
• Some Properties of Recursively Inseparable Sets