Article

Logical Specifications of Effectively Separable Data Models

N. Kh. KasymovNational University of Uzbekistan, 100174, Tashkent, Republic of Uzbekistan

Russian Mathematicsjournal2024en

ABI

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.

Topics

Computability, Logic, AI Algorithms Semantic Web and Ontologies Logic, Reasoning, and Knowledge

Identifiers

DOI: 10.3103/s1066369x24700397

Citations and references

Cited by 2 22 references

Metrics — AkademScholar · Coming soon