| Title | Definability via partial enumerations with semicomputable codomains |
| Publication Type | Journal Article |
| Year of Publication | 2000 |
| Authors | Nikolova S |
| Journal | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
| Volume | 92 |
| Issue | Livre 1 - Mathématiques et Mecanique |
| Pagination | 49-63 |
| ISSN | 0205-0808 |
| Keywords | abstract computability, enumerations, external definability |
| Abstract | Let $\mathfrak{A}$ be a total abstract structure. We prove that if a set $A \subseteq |\mathfrak{A}|^n$ is admissible in every partial enumeration of $\mathfrak{A}$ with semicomputable codomain, then $A$ is semicomputable in $\mathfrak{A}$ in the sense of Friedman - Shepherdson. |
| 1991/95 MSC | 03D70, 03D75 |
| Attachment | Size |
|---|---|
 92-049-063.pdf | 1.32 MB |