| Title | LEAST ENUMERATIONS OF UNARY PARTIAL STRUCTURES |
| Publication Type | Journal Article |
| Year of Publication | 2013 |
| Authors | Ditchev A |
| Journal | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
| Volume | 101 |
| Keywords | degree of a structure, Enumeration, enumeration degree, enumeration operator, Turing degree, type of a sequence of elements of a structure, universal set |
| Abstract | In the present paper we consider structures with unary partial functions and partial predicates, called unary structures. Unary structures does not contain equality and inequality among the predicates of the structure. The main result obtained here is a characterization of the unary structures which have least enumerations, called degrees of the structures. As a corollary it is obtained a characterization of the unary structures which admit eective enumerations. There are some interesting results concerning the spectrum and the so-called quasi-degree of such structures. |
| 2010 MSC | 03D45, 03D60, 03D75 |
| Attachment | Size |
|---|---|
 101-051-069.pdf | 269.59 KB |