Examples of structures which do not admit recursive presentations

Abstract

In the paper it is proved that there exists a class of structure with function and a unary predicate which do no admit an effective enumeration, but all $\sum_i$-definable subsets of $N$ are $\sum_i^0(i=1,2)$ sets in the arithmetical hierarchy.