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

DOI10.1016/0168-0072(95)00070-4MaRDI QIDQ2564047zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A Splitting Theorem for the N-R.E. Degrees
• The universal splitting property. II
• On decomposition of the 0' degree into lesser T-degrees containing differences of recursively enumerable sets

Cites work

• scientific article; zbMATH DE number 3784863 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 510777 (Why is no real title available?)
• A Splitting Theorem for the N-R.E. Degrees
• A non-splitting theorem for d.r.e. sets
• A recursively enumerable degree which will not split over all lesser ones
• D.R.E. Degrees and the Nondiamond Theorem
• Definability in the Turing degrees
• On a Conjecture of Kleene and Post
• The d.r.e. degrees are not dense
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• Weak density and cupping in the d-r.e. degrees

Cited in

(2)

• The thin set theorem for pairs implies DNR
• A non-splitting theorem for d.r.e. sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564047)