Relations between table-type degrees

DOI10.1007/BF01979647zbMath0534.03020OpenAlexW2073082088MaRDI QIDQ790106

A. N. Degtev

Publication date: 1983

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

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

zbMATH Keywords

r-degreestable-type reducibilities

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Decidability and undecidability of theories with a predicate for the primes

Cites Work

• Hypersimple sets with retraceable complements
• Relationships Between Reducibilities
• Unnamed Item
• Unnamed Item

This page was built for publication: Relations between table-type degrees