Logical Specifications of Effectively Separable Data Models

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

Russian Mathematicsjournal2024en

Ochiq kirish: yoʻq

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

Mavzular

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

Identifikatorlar

DOI: 10.3103/s1066369x24700397

Iqtiboslar va manbalar

2 ta iqtibos 22 ta foydalanilgan manba