Modulo computably enumerable degrees by cupping partners

DOI10.1007/s11425-007-0064-xzbMath1125.03031OpenAlexW2102066489MaRDI QIDQ2454661

Wei Wang, Ding, Decheng

Publication date: 16 October 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0064-x

zbMATH Keywords

Turing degreescomputably enumerablecupping partner

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Semilattices (06A12)

Cites Work

• Unnamed Item
• Unnamed Item
• On the definable ideal generated by the plus cupping c.e. degrees
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• A recursively enumerable degree which will not split over all lesser ones
• Generalized nonsplitting in the recursively enumerable degrees
• The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
• Theory and Applications of Models of Computation

This page was built for publication: Modulo computably enumerable degrees by cupping partners