Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees

DOI10.1007/BF01876317zbMath0369.02019OpenAlexW2036284732MaRDI QIDQ1243710

A. N. Degtev

Publication date: 1977

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

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

Mathematics Subject Classification ID

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

Related Items (1)

On \(1\)-degrees inside \(m\)-degrees

Cites Work

• Unnamed Item
• Splinters of recursive functions
• Linear orderings under one-one reducibility
• Some Properties of Recursively Inseparable Sets

This page was built for publication: Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees