The density of the low\(_ 2\) \(n\)-r.e. degrees

DOI10.1007/BF01370692zbMath0745.03034MaRDI QIDQ1179531

S. Barry Cooper

Publication date: 26 June 1992

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

densitylow\(_ 2\) \(n\)-r.e. degrees

Mathematics Subject Classification ID

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

Related Items (9)

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ There Are No Maximal d.c.e. wtt-degrees ⋮ Infima in the d.r.e. degrees ⋮ Isolation in the CEA hierarchy ⋮ Bounding computably enumerable degrees in the Ershov hierarchy ⋮ Turing computability: structural theory ⋮ A non-splitting theorem for d.r.e. sets

Cites Work

• Unnamed Item
• Weak density and cupping in the d-r.e. degrees
• Jump restricted interpolation in the recursively enumerable degrees
• On the degrees less than 0'
• D.R.E. Degrees and the Nondiamond Theorem
• Working below a high recursively enumerable degree

This page was built for publication: The density of the low\(_ 2\) \(n\)-r.e. degrees