Article

Logical specifications of effectively separable data models

N. Kh. KasymovNational University of Uzbekistan

Izvestiya Vysshikh Uchebnykh Zavedenii Matematikajournal2024en

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

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

Identifiers

DOI: 10.26907/0021-3446-2024-6-15-26

Citations and references

Cited by 1 14 references

Metrics — AkademScholar · Coming soon