Upper semilattice of recursively enumerable sQ-degrees

DOI10.1007/BF01985061zbMath0788.03060MaRDI QIDQ1803017

Roland Sh. Omanadze

Publication date: 29 June 1993

Published in: Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

densityspeedability\(sQ\)-reducibilityabstract complexity propertiesupper semilattice of recursively enumerable \(sQ\)- degrees

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

Strong enumeration reducibilities ⋮ r‐Maximal sets and Q1,N‐reducibility ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ Immunity properties and strong positive reducibilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper semilattice of recursively enumerable Q-degrees
• Three theorems on the degrees of recursively enumerable sets
• On the Cartesian subalgebras of a free Lie sum of Lie algebras
• Effectively nowhere simple sets
• On complexity properties of recursively enumerable sets
• Nowhere simple sets and the lattice of recursively enumerable sets
• Computational complexity, speedable and levelable sets

This page was built for publication: Upper semilattice of recursively enumerable sQ-degrees