{"title":"Completeness criterion with respect to the enumeration closure operator in the three-valued logic","authors":"S. Marchenkov, V. A. Prostov","doi":"10.1515/dma-2022-0010","DOIUrl":null,"url":null,"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.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2022-0010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 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.
期刊介绍:
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.