The density of the low\(_ 2\) \(n\)-r.e. degrees
From MaRDI portal
Publication:1179531
DOI10.1007/BF01370692zbMath0745.03034MaRDI QIDQ1179531
Publication date: 26 June 1992
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Infima in the d.r.e. degrees, Isolation in the CEA hierarchy, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, Turing computability: structural theory, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, Bounding computably enumerable degrees in the Ershov hierarchy, A non-splitting theorem for d.r.e. sets, A Survey of Results on the d-c.e. and n-c.e. Degrees, There Are No Maximal d.c.e. wtt-degrees
Cites Work