Logical specifications of effectively separable data models
N. Kh. KasymovNational University of Uzbekistan
Ochiq kirishGibrid
Litsenziya: cc-by
ABI
Annotatsiya
It is established that any effectively separable many-sorted universal algebra has an enrichment that is the only (up to isomorphism) model constructed from constants for a suitable computably enumerable set of sentences
Hali tarjima qilinmagan