Definability via partial enumerations with semicomputable codomains
Keywords:
abstract computability, enumerations, external definabilityAbstract
Let
Downloads
Published
2000-12-12
How to Cite
Nikolova, S. (2000). Definability via partial enumerations with semicomputable codomains. Ann. Sofia Univ. Fac. Math. And Inf., 92, 49–63. Retrieved from https://ftl5.uni-sofia.bg/index.php/fmi/article/view/254
Issue
Section
Articles