• Journal of Information Technology Services
• /
• v.5 no.1
• /
• pp.191-198
• /
• 2006

Boolean matrices have been successfully used in various areas, and many researches have been performed on them. However, almost all the researches focus on the efficient multiplication of two boolean matrices and no research has been shown to deal with the multiplication of all boolean matrices and their consecutive multiplications. The paper suggests a mathematical theory that enables the efficient consecutive multiplications of all $l{\times}n,\;n{\times}m,\;and\;m{\times}k$ boolean matrices, and discusses its computational complexity and the execution results of the consecutive multiplication algorithm based on the theory.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.531-543
• /
• 2022

The article proposed a new type of data relationship: Positive Boolean dependencies by groups on block and slice in the database model of block form, where instead of considering value pairs, we consider a group of p values (p ≥ 2). From this new concept, the article stated and demonstrated the equivalence of the three types of deduction, namely: deduction by logic, deduction by block with groups, deduction by block has no more than p elements with groups. Operations on blocks or slices performed for index attributes on blocks, the properties related to this new concept as theorem the equivalen of the three types of deduction, closure of set positive Boolean dependencies by groups and representation and tight representation set of positive Boolean dependencies by groups when the block degenerated into relation are true in the relational database model and also stated and proven in this paper.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.349-356
• /
• 1998

We give the new formulas counting the total number of all lines planes and tetrahedrons in the n-dimensional Boolean space.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.501-507
• /
• 2005

A Boolean matrix with rank 1 is factored as a left factor and a right factor. The perimeter of a rank-1 Boolean matrix is defined as the number of nonzero entries in the left factor and the right factor of the given matrix. We obtain new characterizations of rank preservers, in terms of perimeter, of Boolean matrices.

• 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.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.813-830
• /
• 2014

The notions of a (Boolean, prime, ultra, good) hesitant fuzzy filter and a hesitant fuzzy MV -filter of an MTL-algebras are introduced, and their relations are investigated. Characterizations of a (Boolean, ultra) hesitant fuzzy filter are discussed. Conditions for a hesitant fuzzy set to be a hesitant fuzzy filter, and for a hesitant fuzzy filter to be a Boolean hesitant fuzzy filter are provided.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.475-484
• /
• 2004

In general, a matrix A is idempotent if $A^2$ = A. The idempotent matrices play an important role in the matrix theory and some properties of the Boolean matrices are examined. Using the upper diagonal completion process, we give the characterization of the Boolean idempotent matrices in modified Frobenius normal form.

• 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 Korean Mathematical Society
• /
• v.6 no.2
• /
• pp.75-80
• /
• 1969

• The Pure and Applied Mathematics
• /
• v.7 no.1
• /
• pp.19-26
• /
• 2000

The purpose of the paper is to show that in the Fraenkel-Mostowski topos, the category of the Boolean algebras has enough injectives.