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

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

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

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

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

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

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

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.

In this paper, we present a general framework for the study of interval type-2 rough fuzzy sets by using both constructive and axiomatic approaches. First, several concepts and properties of interval type-2 fuzzy sets are introduced. Then, a pair of lower and upper interval type-2 rough fuzzy approximation operators with respect to a crisp binary relation is proposed. Classical representations ...

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...