Finite logical specifications of effectively separable data models
N. R. KarimovaNational University of UzbekistanN. Kh. KasymovNational University of UzbekistanS. K. ZhavlievNational University of Uzbekistan
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
Ҳали таржима қилинмаган
Мавзулар
Идентификаторлар
Иқтибослар ва манбалар
0 та иқтибос18 та фойдаланилган манба
Кўрсаткичлар — AkademScholar · Тез орада