О семействе вычислимых множеств на допустимых множествах

We study the existence of computable numberings of the set of all $\Delta$-predicates over admissible sets. We construct an admissible set whose set of all $\Delta$-predicates fails to have such a numbering and give a series of examples of admissible sets in which such numberings exist.