{"title":"Logical Specifications of Effectively Separable Data Models","authors":"N. Kh. Kasymov","doi":"10.3103/s1066369x24700397","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>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.</p>","PeriodicalId":46110,"journal":{"name":"Russian Mathematics","volume":"407 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Russian Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s1066369x24700397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
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.