We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a complete Stone lattice. Furthermore, for the...

In this paper, the notion of the interval valued neutrosophic soft sets (ivn−soft sets) is defined which is a combination of an interval valued neutrosophic sets [36] and a soft sets [30]. Our ivn−soft sets generalizes the concept of the soft set, fuzzy soft set, interval valued fuzzy soft set, intuitionistic fuzzy soft set, interval valued intuitionistic fuzzy soft set and neutrosophic soft se...

An object $X$ of a category $mathbf{C}$ with finite limits is called exponentiable if the functor $-times X:mathbf{C}rightarrow mathbf{C}$ has a right adjoint. There are many characterizations of the exponentiable  spaces in the category $mathbf{Top}$ of topological spaces. Here, we study the exponentiable objects in the category $mathbf{STop}$ of soft topological spaces which is a generalizati...

This paper is devoted to the discussion of the relationship between fuzzy rough set models and fuzzy topologies on a finite universe. The (TC) axiom for fuzzy topology is proposed. It is proved that the set of all lower approximation sets based on a reflexive and transitive fuzzy relation consists of a fuzzy topology which satisfies (TC) axiom; and conversely, a fuzzy topology which obey (TC) a...

In this paper, we firstly defined neutrosophic parameterized neutrosophic soft sets(npn−soft sets) which is combination of a neutrosophic sets and a soft sets. Our npn−soft sets generalizes the concept of the other soft sets such as; fuzzy soft sets, intuitionistic fuzzy soft sets, neutrosophic soft sets, fuzzy parameterized soft sets, intuitionistic fuzzy parameterized soft sets, neutrosophic ...

In this paper, we propose an approach to find transitive closures on large data sets in distributed (i.e., parallel) environment. Finding transitive closures of data records is a preprocessing step of a two-step approach to data quality control, such as data accuracy, redundancy, consistency, currency and completeness. The objective of finding transitive closures is to reduce the number of reco...