Cupping and Diamond Embeddings: A Unifying Approach

DOI10.1007/978-3-642-21875-0_8zbMath1345.03079OpenAlexW1603046657MaRDI QIDQ3091442

Chengling Fang, Guohua Wu, Jiang Liu

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_8

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The d.r.e. degrees are not dense
• Complementing cappable degrees in the difference hierarchy.
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Degrees with Almost Universal Cupping Property
• D.R.E. Degrees and the Nondiamond Theorem
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Isolation and lattice embeddings
• A minimal pair of recursively enumerable degrees
• Theory and Applications of Models of Computation

This page was built for publication: Cupping and Diamond Embeddings: A Unifying Approach