Completeness criterion with respect to the enumeration closure operator in the three-valued logic

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2022-04-01 DOI:10.1515/dma-2022-0010

S. Marchenkov, V. A. Prostov

引用次数: 0

Abstract

Abstract The enumeration closure operator (the Π-operator) is considered on the set Pk of functions of the k-valued logic. It is proved that, for any k ⩾ 2, any positively precomplete class in Pk is also Π-precomplete. It is also established that there are no other Π-precomplete classes in the three-valued logic.

查看原文本刊更多论文

关于三值逻辑中枚举闭包运算符的完备性准则

在k值逻辑的函数集合Pk上考虑了枚举闭包算子Π-operator。证明，对于任何k小于2,Pk中的任何正预完成类也是Π-precomplete。还确定在三值逻辑中不存在其他Π-precomplete类。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.