On \(sQ\)-completeness of recursively enumerable sets

DOI10.1007/BF01209615zbMath0787.03031MaRDI QIDQ1316903

Roland Sh. Omanadze

Publication date: 12 April 1994

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

recursively enumerable sets\(sQ_ 1\)-reducibility\(sQ\)-reducibility

Mathematics Subject Classification ID

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

Related Items (1)

\(sQ_1\)-degrees of computably enumerable sets

Cites Work

• Reducibility and Completeness for Sets of Integers
• On subcreative sets and S-reducibility
• On a Class of Complete Simple Sets
• Creative sets

This page was built for publication: On \(sQ\)-completeness of recursively enumerable sets