On $\Sigma^0_1$-Classification of Relations on Computable Structures

In the paper the example of computable structure in the language with infinite number of binary predicate symbols without $\Sigma^0_1$-classification of all unary relations, which are definable by $\Sigma^0_1$-formulas on the structure, is constructed.