A Note on Postian Matrix Theory

From MaRDI portal





A Post algebra \(P\) is known to be a double Heyting algebra. The author computes the disjunctive components of the meet-pseudocomplement \(a\to b\) and of the join-pseudocomplement \(b-a\) in terms of the disjunctive components of the elements \(a,b\in P\). An application is given to the lattice of ordered partitions of a set. Also, the consistency condition for an equation \(a\to x=c\) is obtained in terms of the disjunctive components of \(a\) and \(c\), implying that \(c\) is a solution whenever the equation is consistent. Further, an element \(a\in P\) is uniquely determined by the elements \(a\to e_k\) \((k=1,\dots,r-1)\), where \(e_1<e_2<\cdots< e_{r-1}=1\) is the chain of constants of \(P\). Finally, the theory of the Boolean matrix equations \(A\otimes X\leq B\) and \(A\otimes X=B\) and of invertible square Boolean matrices is extended to Post matrices. Reviewer's remarks: Theorems 6 and 7 are valid in any Heyting algebra; cf. the reviewer: Boolean functions and equations (1974; Zbl 0321.06013), Theorem \(7.2'\), Remark \(7.1'\) and Theorem \(7.3'\), Remark \(7.2'\), respectively. As a matter of fact, matrix equations over a Heyting algebra are the beginning of the theory of fuzzy relational equations, intensively studied nowadays; cf. \textit{A. Di Nola}, \textit{S. Sessa}, \textit{W. Pedrycz} and \textit{E. Sanchez}: Fuzzy relation equations and their applications to knowledge engineering (1989; Zbl 0694.94025).











This page was built for publication: A Note on Postian Matrix Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342930)