Finite logical specifications of effectively separable data models
N. R. KarimovaNational University of UzbekistanN. Kh. KasymovNational University of UzbekistanS. K. ZhavlievNational University of Uzbekistan
Ochiq kirishGibrid
Litsenziya: cc-by
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 iqtibos18 ta foydalanilgan manba