Scholarlink

Abstract <p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Finite Logical Specifications of Effectively Separable Data Models

  • 期刊论文

  • 发表日期：

    2025年8月1日

查看全文
  • N. R. Karimova,
  • N. Kh. Kasymov,
  • S. K. Zhavliev

摘要

Abstract

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.