Finite logical specifications of effectively separable data models
N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev · Russian Mathematics · 2025
Data models with effectively separable algorithmic representations are considered. It is established that any such model has an enrichment, which is the unique model constructed from constants for a suitable proposal of first-order logic