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
Ochiq kirish: yoʻq
ABI
Annotatsiya
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.
Hali tarjima qilinmagan
Mavzular
Identifikatorlar
Iqtiboslar va manbalar
0 ta iqtibos21 ta foydalanilgan manba