Definability via partial enumerations with semicomputable codomains

Authors

  • Stela Nikolova

Keywords:

abstract computability, enumerations, external definability

Abstract

Let A be a total abstract structure. We prove that if a set A|A|n is admissible in every partial enumeration of A with semicomputable codomain, then A is semicomputable in A in the sense of Friedman - Shepherdson.

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