Finite logical specifications of effectively separable data models
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
Authors
- N. R. Karimova (ORCID: https://orcid.org/0009-0005-0374-531X)
- S. K. Zhavliev
- N. Kh. Kasymov
Institutions
- National University of Uzbekistan (UZ)
Publication Details
- Journal
- Izvestiya Vysshikh Uchebnykh Zavedenii Matematika
- Published
- 2025-09-19
- DOI
- https://doi.org/10.26907/0021-3446-2025-8-3-16
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00