Logical Specifications of Effectively Separable Data Models
N. Kh. Kasymov · Russian Mathematics · 2024
Abstract It is established that any effectively separable many-sorted universal algebra has an enrichment that is the only (up to isomorphism) model constructed from constants for a suitable computably enumerable set of sentences.