• Korean Journal of Mathematics
• /
• v.12 no.1
• /
• pp.49-54
• /
• 2004

In this paper we introduce the notion of quotient Boolean algebra and study the relation between the ideals of Boolean algebra ${\wp}(S)$ and the ideals of quotient Boolean algebra ${\wp}(S)/I$.

• The Pure and Applied Mathematics
• /
• v.7 no.2
• /
• pp.71-78
• /
• 2000

Any Hausdoroff space on a set which has at least two points a regular closed Boolean algebra different from the indiscrete regular closed Boolean algebra as indiscrete space. The Sierpinski space and the space with finite complement topology on any infinite set etc. do the same. However, there is $T_{0}$ space which does the same with Hausdorpff space as above. The regular closed Boolean algebra in a topological space is isomorphic to that algebra in the space with its open extension topology.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.77-86
• /
• 2006

We consider the set of commuting pairs of matrices and their preservers over binary Boolean algebra, chain semiring and general Boolean algebra. We characterize those linear operators that preserve the set of commuting pairs of matrices over a general Boolean algebra and a chain semiring.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.4
• /
• pp.613-629
• /
• 2016

In this paper, we introduced the notion of multiplier of Boolean algebras and discuss related properties between multipliers and special mappings, like dual closures, homomorphisms on B. We introduce the notions of xed set $Fix_f(X)$ and normal ideal and obtain interconnection between multipliers and $Fix_f(B)$. Also, we introduce the special multiplier ${\alpha}_p$a nd study some properties. Finally, we show that if B is a Boolean algebra, then the set of all multipliers of B is also a Boolean algebra.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.531-536
• /
• 1998

It is well known that a Boolean algebra is one of the most important algebra for engineering. A fuzzy algebra, which is referred to also as a Kleen algebra, is obtained from a Boolean algebra by replacing the complementary law in the axioms of a Bloolean algebra with the Kleen's law, where the Kleen's law is a weaker condition than the complementary law. Removal of the Kleen's law from a Kleen algebra gives a De Morgan algebra. In this paper, we generate lattice structures of the above related algebraic systems having finite elements by using a computer. From the result, we could find out a hypothesis that the structure excepting for each element name between a Kleene algebra and a De Morgan algebra is the same from the lattice standpoint.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.531-540
• /
• 1995

There is much literature on the study of matrices over a finite Boolean algebra. But many results in Boolean matrix theory are stated only for binary Boolean matrices. This is due in part to a semiring isomorphism between the matrices over the Boolean algebra of subsets of a k element set and the k tuples of binary Boolean matrices. This isomorphism allows many questions concerning matrices over an arbitrary finite Boolean algebra to be answered using the binary Boolean case. However there are interesting results about the general (i.e. nonbinary) Boolean matrices that have not been mentioned and they differ somwhat from the binary case.

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.781-788
• /
• 2011

A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.1-9
• /
• 2013

We consider the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.13 no.6
• /
• pp.20-23
• /
• 1976

A boolean algebra method for computing the reliability in a communication network is prosented. Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by the Boolean operation which is named parallel operation. The method seems to be promising for both oriented and nonoriented network.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1525-1532
• /
• 2011

The $m{\times}n$ Boolean matrix A is said to be of Boolean rank r if there exist $m{\times}r$ Boolean matrix B and $r{\times}n$ Boolean matrix C such that A = BC and r is the smallest positive integer that such a factorization exists. We consider the the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.