Complete Description of Adjacent Classes of Boolean Algebras by Basis Equivalence

Ihor Mych, Volodymyr Nikolenko, Olena Vartsaba, Oleksandr Kuchanskyi
{"title":"Complete Description of Adjacent Classes of Boolean Algebras by Basis Equivalence","authors":"Ihor Mych, Volodymyr Nikolenko, Olena Vartsaba, Oleksandr Kuchanskyi","doi":"10.1109/SIST58284.2023.10223529","DOIUrl":null,"url":null,"abstract":"The theory of logical functions is the basis of many intelligent systems based on using different sets of bases. The paper has proposed considering the Boolean functions theory from the view of universal Boolean algebra. The set of bases S can be constructed in a Boolean algebra with a preset signature. The problem is solved for which collections of bases S exist algebras which have those and only those collections of bases. The division of the set of Boolean algebras M into adjacent classes, which are determined by the codes of canonical algebras, is received based on the introduced concept of basis equivalence. Tables are presented where all adjacent classes are described by basis equivalence, and a grating of these classes is constructed. Since grating has 1060 vertexes and 4804 edges, the most exciting fragments are presented.","PeriodicalId":367406,"journal":{"name":"2023 IEEE International Conference on Smart Information Systems and Technologies (SIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE International Conference on Smart Information Systems and Technologies (SIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIST58284.2023.10223529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The theory of logical functions is the basis of many intelligent systems based on using different sets of bases. The paper has proposed considering the Boolean functions theory from the view of universal Boolean algebra. The set of bases S can be constructed in a Boolean algebra with a preset signature. The problem is solved for which collections of bases S exist algebras which have those and only those collections of bases. The division of the set of Boolean algebras M into adjacent classes, which are determined by the codes of canonical algebras, is received based on the introduced concept of basis equivalence. Tables are presented where all adjacent classes are described by basis equivalence, and a grating of these classes is constructed. Since grating has 1060 vertexes and 4804 edges, the most exciting fragments are presented.
基于基等价的布尔代数邻类的完全描述
逻辑函数理论是许多基于使用不同基集的智能系统的基础。本文提出了从普遍布尔代数的角度来考虑布尔函数理论。基集S可以在布尔代数中构造,并具有预设的签名。这个问题被解决了,对于哪些基的集合S存在代数有并且只有那些基的集合。在引入基等价概念的基础上,给出了布尔代数集合M划分为由正则代数码决定的相邻类的方法。给出了用基等价描述所有相邻类的表,并构造了这些类的栅格。由于光栅有1060个顶点和4804条边,因此呈现出最令人兴奋的碎片。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信