نتایج جستجو برای: fuzzy reflexive subsemihypergroup

تعداد نتایج: 96524  

Journal: :Inf. Sci. 1971
Lotfi A. Zadeh

The notion of “similarity” as defined in this paper is essentially a generalization of the notion of equivalence. In the same vein, a fuzzy ordering is a generalization of the concept of ordering. For example, the relation x *y (x is much larger than y) is a fuzzy linear ordering in the set of real numbers. More concretely, a similarity relation, S, is a fuzzy relation which is reflexive, symme...

Journal: :iranian journal of fuzzy systems 0
b. de baets kermit, department of mathematical modelling, statistics and bioinformatics, ghent university, coupure links 653, b-9000, gent, belgium h. bouremel department of mathematics, faculty of mathematics and informatics, med boudiaf university of msila, p.o. box 166 ichbilia, msila 28000, algeria l. zedam department of mathematics, faculty of mathematics and informatics, med boudiaf university of msila, p.o. box 166 ichbilia, msila 28000, algeria

in a recent paper, de baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. in this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. the reasoninglargely ...

B. De Baets H. Bouremel L. Zedam,

In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...

2010
S. P. Tiwari

This paper is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X,R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approxima...

2011
Dionís Boixader Jordi Recasens

Though the transitive closure of a reflexive and symmetric fuzzy relation R is unique and there are several algorithms to calculate it, there can be many transitive openings (maximal T -indistinguishability operators among the ones smaller than or equal to R). This paper presents a method to calculate transitive openings of a reflexive and symmetric fuzzy relation R. It is worth noticing that a...

Journal: :iranian journal of fuzzy systems 2015
shambhu sharan s. p. tiwari v. k. yadav

the purpose of the present work is to establish a one-to-one correspondence between the family of interval type-2 fuzzy reflexive/tolerance approximation spaces and the family of interval type-2 fuzzy closure spaces.

Mahmood Bakhshi, Mohammad Mehdi Zahedi, Rajab Ali Borzooei

In this note first we define the notions of fuzzy positive implicativehyper BCK-ideals of types 1,2,3 and 4. Then we prove some theorems whichcharacterize the above notions according to the level subsets. Also we obtainthe relationships among these notions, fuzzy (strong, weak, reflexive) hyperBCK-ideals and fuzzy positive implicative hyper BCK-ideals of types 5,6,7and 8. Then, we define the no...

Journal: :Soft Comput. 2018
Parvin Safari Saeed Salehi

Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the Basic Logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models...

2011
Bivas Dinda T. K. Samanta

In this paper, we present the concept of relations in intuitionistic fuzzy soft set and study some of their properties and also discuss symmetric, transitive and reflexive intuitionistic fuzzy soft relations.

2005
Luis Garmendia Adela Salvador

There are fast known algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute T-transitive low approximations of a fuzzy relation. A fast method to compute a T-transitive low approximation of a reflexive and symmetric fuzzy relation is given for any continuous tnorm, spending O(n) time.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید