Kernels and closures of soft set relations, and soft set relation mappings

Abstract

a b s t r a c tIn this paper, the notions of anti-reflexive kernel, symmetric kernel, reflexive closure, and symmetric closure of a soft set relation are first introduced, respectively. Then, their accurate calculation formulae and some properties are obtained. Finally, soft set relation mappings and inverse soft set relation mappings are proposed, and some related properties are discussed.

Uncertain linguistic fuzzy soft sets and their applications in group decision making

“…Motivated by the work of Babitha and Sunil [24] and Yang and Guo [25], we investigate the binary relation between two ULFSSs in this subsection.…”

Logic Connectives for Soft Sets and Fuzzy Soft Sets

“…Applications of the soft set theory may be seen in [5], [6], [11], [12], [15], [16], [23], [24], [26], [27], [28], and [41]. Relations in soft sets have been studied in [43]. Structures of soft sets have been studied by many authors (see [4], [32], [38]).…”

Studies on soft topological spaces

“…The concepts of soft set relations, the Cartesian product of the soft sets and soft set functions are defined by Babitha and Sunil [3]. As a continuation of their work, Yang and Guo [11] defined on soft set theory the notions of anti-reflexive kernel, symmetric kernel, reflexive closure, and symmetric closure of a soft set relation. Moreover transitive closure of soft set relation and ordering on soft set is defined by Babitha and Sunil [4].…”