Upper semilattice of recursively enumerable sQ-degrees

DOI10.1007/BF01985061zbMATH Open0788.03060MaRDI QIDQ1803017FDOQ1803017

Authors: Roland Sh. Omanadze 

Publication date: 29 June 1993

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

Recommendations

• scientific article; zbMATH DE number 4202251
• Relations between certain reducibilities
• On distributivity of the upper semilattices of the degrees below \(0'\)
• Upper semilattice of recursively enumerable Q-degrees
• On \(sQ\)-completeness of recursively enumerable sets

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper semilattice of recursively enumerable Q-degrees
• Effectively nowhere simple sets
• Title not available (Why is that?)
• Nowhere simple sets and the lattice of recursively enumerable sets
• On the Cartesian subalgebras of a free Lie sum of Lie algebras
• Computational complexity, speedable and levelable sets
• Three theorems on the degrees of recursively enumerable sets
• On complexity properties of recursively enumerable sets

Cited In (8)

• Immunity properties and strong positive reducibilities
• \(sQ_1\)-degrees of computably enumerable sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• r‐Maximal sets and Q1,N‐reducibility
• \(Q _{1}\)-degrees of c.e. sets
• Strong enumeration reducibilities
• Upper semilattice of recursively enumerable Q-degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803017)