On specifications of positive data models with effectively separable kernels of algorithmic representations

It is established that any effectively separable multi-sorted positively representable model with an effectively separable representation kernel has an enrichment that is the only (up to isomorphism) model constructed from constants for a suitable computably enumerable set of sentences.

Hali tarjima qilinmagan