Статья

Finite Logical Specifications of Effectively Separable Data Models

N. R. KarimovaNational University of Uzbekistan, 100174, Tashkent, Republic of UzbekistanN. Kh. KasymovNational University of Uzbekistan, 100174, Tashkent, Republic of UzbekistanS. K. ZhavlievNational University of Uzbekistan, 100174, Tashkent, Republic of Uzbekistan

Russian Mathematicsjournal2025en

ABI

Аннотация

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.

Темы

Statistical and Computational Modeling Logic, Reasoning, and Knowledge

Идентификаторы

DOI: 10.3103/s1066369x25700586

Цитирования и источники

Цитирований: 0Использованных источников: 21

Показатели — AkademScholar · Скоро