• 한국지능시스템학회논문지
• /
• 제18권3호
• /
• pp.401-405
• /
• 2008

We investigate the properties of fuzzy relations and $\odot$-equivalence relation on a stsc quantale lattice L and a commutative cqm-lattice. In particular, fuzzy relations preserve(*, \otimes$)-equivalence relations where $\otimes$ are compositions, $\Rightarrow$ and $\Leftarrow$.

• 대한수학회논문집
• /
• 제23권4호
• /
• pp.461-468
• /
• 2008

We define an $\epsilon$-fuzzy congruence, which is a weakened fuzzy congruence, find the $\epsilon$-fuzzy congruence generated by the union of two $\epsilon$-fuzzy congruences on a semigroup, and characterize the $\epsilon$-fuzzy congruences generated by fuzzy relations on semigroups. We also show that the collection of all $\epsilon$-fuzzy congruences on a semigroup is a complete lattice and that the collection of $\epsilon$-fuzzy congruences under some conditions is a modular lattice.

• 충청수학회지
• /
• 제26권3호
• /
• pp.557-569
• /
• 2013

In this paper we shall introduce the $f$-function in a set, and give some properties of $f$-function of a set. In particular, we establish a relation between $f$-function of a set and fuzzy equivalence relation. We also introduce the notion of $f$-homomorphism on a semigroup S, and prove the generalized fundamental homomorphism theorem of semigroup.

• 한국지능시스템학회논문지
• /
• 제19권3호
• /
• pp.425-431
• /
• 2009

By using the notion of interval-valued fuzzy relations, we forms the poset (IVFR (X), $\leq$) of interval-valued fuzzy relations on a given set X. In particular, we forms the subposet (IVFE (X), $\leq$) of interval-valued fuzzy equivalence relations on a given set X and prove that the poset (IVFE(X), $\leq$) is a complete lattice with the least element and greatest element.

• 한국지능시스템학회논문지
• /
• 제21권1호
• /
• pp.145-152
• /
• 2011

By using the notion of interval-valued intuitionistic fuzzy relations, we form the poset (IVIR(X), $\leq$) of interval-valued intuitionistic fuzzy relations on a given set X. In particular, we form the subposet (IVIE(X), $\leq$) of interval-valued intuitionistic fuzzy equivalence relations on a given set X and prove that the poset (IVIE(X), $\leq$) is a complete lattice with the least element and greatest element.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권2호
• /
• pp.127-132
• /
• 2004

$H_v$-rings first were introduced by Vougiouklis in 1990. The largest class of algebraic systems satisfying ring-like axioms is the $H_v$-ring. Let R be an $H_v$-ring and ${\gamma}_R$ the smallest equivalence relation on R such that the quotient $R/{\gamma}_R$, the set of all equivalence classes, is a ring. In this case $R/{\gamma}_R$ is called the fundamental ring. In this short communication, we study the fundamental rings with respect to the product of two fuzzy subsets.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.409-420
• /
• 2006

In this paper we consider the set of all n + 1-tuples of real numbers, not necessarily all distinct, in the decreasing order from the unit interval under the usual ordering of real numbers, always including 1. Such n + 1-tuples inherently arise as the membership values of fuzzy subsets and are called keychains. An natural equivalence relation is introduced on this set and the equivalence classes of keychains are studied here. The number of such keychains is finite and the set of all keychains is a lattice under the coordinate-wise ordering. Thus keychains are subchains of a finite chain of real numbers in the unit interval. We study some of their properties and give some applications to counting fuzzy subsets of finite sets.

• 한국지능시스템학회논문지
• /
• 제16권3호
• /
• pp.357-366
• /
• 2006

We introduce the notion of intuitionistic fuzzy (t, s)-congruences on a lattice and study some of its properties. Moreover, we obtain some properties of intuitionistic fuzzy congruences on the direct product of two lattices. Finally, we prove that the set of all intuitionistic fuzzy congruences on a lattice forms a distributive lattice.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.315-325
• /
• 2006

The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite state machines are introduced, and related properties are investigated. After we give a congruence relation on the set of all words of elements of X of finite length, the quotient structure is discussed. We show that the family of equivalence classes is a finite semigroup with identity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권2호
• /
• pp.249-253
• /
• 2004

When we decide the software quality on the basis of the software measurement, the transitive property which is a requirement for an equivalence relation is not always satisfied. Therefore, we propose a scheme for classifying the software quality that employs a tolerance relation instead of an equivalence relation. Given the experimental data set, the proposed scheme generates the tolerant classes for elements in the experiment data set, and generates the tolerant ranges for classifying the software quality by clustering the means of the tolerance classes. Through the experiment, we showed that the proposed scheme could product very useful and valid results. That is, it has no problems that we use as the criteria for classifying the software quality the tolerant ranges generated by the proposed scheme.