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

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

• Journal of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.847-865
• /
• 2017

For a finite or an infinite set X, let $2^X$ be the power set of X. A class of simple graph, called strong Boolean graph, is defined on the vertex set $2^X{\setminus}\{X,{\emptyset}\}$, with M adjacent to N if $M{\cap}N={\emptyset}$. In this paper, we characterize the annihilating-ideal graphs $\mathbb{AG}(R)$ that are blow-ups of strong Boolean graphs, complemented graphs and preatomic graphs respectively. In particular, for a commutative ring R such that AG(R) has a maximum clique S with $3{\leq}{\mid}V(S){\mid}{\leq}{\infty}$, we prove that $\mathbb{AG}(R)$ is a blow-up of a strong Boolean graph if and only if it is a complemented graph, if and only if R is a reduced ring. If assume further that R is decomposable, then we prove that $\mathbb{AG}(R)$ is a blow-up of a strong Boolean graph if and only if it is a blow-up of a pre-atomic graph. We also study the clique number and chromatic number of the graph $\mathbb{AG}(R)$.

• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.221-230
• /
• 2008

Green's relations are five equivalence relations that characterize the elements of a semigroup in terms of the principal ideals. The J relation is one of Green's relations. Although there are known algorithms that can compute Green relations, they are not useful for finding all J relations in the semigroup of all $n{\times}n$ Boolean matrices. Its computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices. The size of the semigroup of all $n{\times}n$ Boolean matrices grows exponentially as n increases. It is easy to see that it involves exponential time complexity. The computation of J relations over the $5{\times}5$ Boolean matrix is left an unsolved problem. The paper shows theorems that can reduce the computation time, discusses an algorithm for efficient J relation computation whose design reflects those theorems and gives its execution results.

• Journal of Information Technology Services
• /
• v.9 no.4
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• Kyungpook Mathematical Journal
• /
• v.43 no.4
• /
• pp.539-545
• /
• 2003

We present a set of equations that axiomatizes the class of all lattice implication algebras. The construction is different from the one given in [7], and the proof is direct: i.e., it does not rely on results from outside the realm of the lattice implication algebras, such as the theory of BCK-algebras. Then we show that the lattice H implication algebras are nothing more than the familiar Boolean algebras. Finally we obtain some negative results for the embedding of lattice implication algebras into Boolean algebras.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.465-486
• /
• 2005

We study the relationship between intuitionistic fuzzy ideals and intuitionistic fuzzy congruences on a distributive lattice. And we prove that the lattice of intuitionistic fuzzy ideals is isomorphic to the lattice of intuitionistic fuzzy congruences on a generalized Boolean algebra.

• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.539-558
• /
• 2019

An ideal of a commutative ring is called a d-ideal if it contains the annihilator of the annihilator of each of its elements. Denote by DId(A) the lattice of d-ideals of a ring A. We prove that, as in the case of f-rings, DId(A) is an algebraic frame. Call a ring homomorphism "compatible" if it maps equally annihilated elements in its domain to equally annihilated elements in the codomain. Denote by $SdRng_c$ the category whose objects are rings in which the sum of two d-ideals is a d-ideal, and whose morphisms are compatible ring homomorphisms. We show that $DId:\;SdRng_c{\rightarrow}CohFrm$ is a functor (CohFrm is the category of coherent frames with coherent maps), and we construct a natural transformation $RId{\rightarrow}DId$, in a most natural way, where RId is the functor that sends a ring to its frame of radical ideals. We prove that a ring A is a Baer ring if and only if it belongs to the category $SdRng_c$ and DId(A) is isomorphic to the frame of ideals of the Boolean algebra of idempotents of A. We end by showing that the category $SdRng_c$ has finite products.

• Honam Mathematical Journal
• /
• v.37 no.2
• /
• pp.187-205
• /
• 2015

We discuss the relationship between interval-valued fuzzy ideals and interval-valued fuzzy congruence on a distributive lattice L and show that for a generalized Boolean algebra the lattice of interval-valued fuzzy ideals is isomorphic to the lattice of interval-valued fuzzy congruences. Finally we consider the products of interval-valued fuzzy ideals and obtain a necessary and sufficient condition for an interval-valued fuzzy ideal on the direct sum of lattices to be representable as a direct sum of interval-valued fuzzy ideals on each lattice.

• Journal of the Korean Society for information Management
• /
• v.21 no.2
• /
• pp.235-248
• /
• 2004

For the users of information retrieval systems, natural language query is the more ideal interface, compared with keyword and boolean expressions. This paper proposes a retrieval technique with expanded keyword from syntactically-analyzed structures of natural language query as user input. Through the steps combining or splitting the compound nouns based on syntactic tree traversal of the query, and expanding the other-formed or shorten-formed into multiple keyword, it can enhance the precision and correctness of the retrieval system.