Finite logical specifications of effectively separable data models

N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

National University of Uzbekistan, 4 University str., Tashkent, 100174 Republic of Uzbekistan

Abstract: 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.

Keywords: effectively separable numbering, many-sorted algebra, finite specification.

UDC: 510.51: 510.62: 512.57: 519.681

Received: 06.05.2024
Revised: 06.05.2024
Accepted: 26.09.2024

DOI: 10.26907/0021-3446-2025-8-3-16