Elementary differences between the (2p)-C. E. and the (2p +1)-c. e. enumeration degrees

DOI10.2178/JSL/1174668395zbMath1117.03047OpenAlexW2119456237MaRDI QIDQ3426574

Iskander Sh. Kalimullin

Publication date: 12 March 2007

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1174668395

zbMATH Keywords

computably enumerable degree

Mathematics Subject Classification ID

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

Related Items (2)

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees

Cites Work

• Unnamed Item
• Splitting properties of n-c.e. enumeration degrees

This page was built for publication: Elementary differences between the (2_p)-C. E. and the (2_p +1)-c. e. enumeration degrees