Skip to main content
Conference Proceedings

On the problems of definability in the enumeration degrees

Lecture Notes in Computer Science (2005) 3526 221-222
DOI: 10.1007/11494645_27
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Kalimullin, I. S. (2005). On the problems of definability in the enumeration degrees. In Lecture Notes in Computer Science (Vol. 3526, pp. 221–222). Springer Verlag. https://doi.org/10.1007/11494645_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free