A non-splitting theorem for d.r.e. sets

DOI10.1016/0168-0072(95)00070-4zbMath0866.03023OpenAlexW2037833610MaRDI QIDQ2564047

Xiaoding Yi

Publication date: 26 June 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: http://summit.sfu.ca/item/4491

zbMATH Keywords

\(T\)-degreesdifference recursively enumerable sets

Mathematics Subject Classification ID

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

Related Items (1)

A non-splitting theorem for d.r.e. sets

Cites Work

• Weak density and cupping in the d-r.e. degrees
• Definability in the Turing degrees
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• The d.r.e. degrees are not dense
• A non-splitting theorem for d.r.e. sets
• On a Conjecture of Kleene and Post
• D.R.E. Degrees and the Nondiamond Theorem
• A Splitting Theorem for the N-R.E. Degrees
• A recursively enumerable degree which will not split over all lesser ones
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A non-splitting theorem for d.r.e. sets