Joining to High Degrees

DOI10.1007/978-3-540-69407-6_40zbMath1143.03021OpenAlexW1487201914MaRDI QIDQ3507451

Guohua Wu, Jiang Liu

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_40

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Joining to high degrees via noncuppables
• An almost deep degree
• Quasi-complements of the cappable degrees
• A join theorem for the computably enumerable degrees

This page was built for publication: Joining to High Degrees