Logical Specifications of Effectively Separable Data Models
N. Kh. KasymovNational University of Uzbekistan, 100174, Tashkent, Republic of Uzbekistan
ABI
Аннотация
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.
Ҳали таржима қилинмаган