Upper semilattice of recursively enumerable Q-degrees

DOI10.1007/BF01979705zbMath0586.03034MaRDI QIDQ1071761

Roland Sh. Omanadze

Publication date: 1984

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

Full work available at URL: https://eudml.org/doc/187262

zbMATH Keywords

upper boundmaximal setelementary theory

Mathematics Subject Classification ID

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

Related Items

e- and s-degrees ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ On the bounded quasi‐degrees of c.e. sets ⋮ Upper semilattice of recursively enumerable sQ-degrees

Cites Work

• Unnamed Item
• Unnamed Item
• On complete btt-degrees
• The class of recursively enumerable subsets of a recursively enumerabl e set
• On the First Order Theory of the Arithmetical Degrees
• On complexity properties of recursively enumerable sets
• Computational complexity, speedable and levelable sets
• Semirecursive Sets and Positive Reducibility