Matrix expression of finite Boolean-type algebras

Shihua Fu, Daizhan Cheng, Jun-e Feng and Jianli Zhao

Applied Mathematics and Computation, 2021, vol. 395, issue C

Abstract: This paper provides a systematic matrix description for finite Boolean- type algebras (BTAs). A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then of BTA) are presented. Via their matrix expression, the construction and certain properties of BTAs are investigated, including the homomorphism and isomorphism, as well as the decomposition. Moreover, straightforward verifiable conditions are obtained to detect the properties above by means of logical matrices operations.

Keywords: Boolean-type algebra; Lattice; Complementation; Universal algebra; Semi-tensor product of matrices (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032030833X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:395:y:2021:i:c:s009630032030833x

DOI: 10.1016/j.amc.2020.125880

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().