On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers

DOI10.1007/BF01152759zbMath0372.02022MaRDI QIDQ1244337

Sergey S. Marchenkov

Publication date: 1976

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

Mathematics Subject Classification ID

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

Related Items

Strong reducibilities

Cites Work

• Unnamed Item
• tt- and m-degrees
• Semirecursive Sets and Positive Reducibility
• A note on universal sets