This article is cited in 3 papers

Logical specifications of effectively separable data models

N. Kh. Kasymov

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

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.

Keywords: effectively separable many-sorted algebra, data model, specification.

UDC: 510.5: 510.6: 519.681

Received: 11.05.2023
Revised: 11.05.2023
Accepted: 26.12.2023

DOI: 10.26907/0021-3446-2024-6-15-26

 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2024, 68:6, 11–20