Maqola

Finite logical specifications of effectively separable data models

N. R. KarimovaNational University of UzbekistanN. Kh. KasymovNational University of UzbekistanS. K. ZhavlievNational University of Uzbekistan

Izvestiya Vysshikh Uchebnykh Zavedenii Matematikajournal2025en

ABI

Annotatsiya

Data models with effectively separable algorithmic representations are considered. It is established that any such model has an enrichment, which is the unique model constructed from constants for a suitable proposal of first-order logic

Mavzular

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

Identifikatorlar

DOI: 10.26907/0021-3446-2025-8-3-16

Iqtiboslar va manbalar

0 ta iqtibos18 ta foydalanilgan manba

Koʻrsatkichlar — AkademScholar · Tez orada