In 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 relationmappings are proposed, and some related properties are discussed. © 2010 Elsevier Ltd...

Let 1 < q < p < ∞ and q ≤ r ≤ p. Let X be a reflexive Banach space satisfying a lower-lq-tree estimate and let T be a bounded linear operator from X which satisfies an upper-lp-tree estimate. Then T factors through a subspace of ( ∑ Fn)lr , where (Fn) is a sequence of finite-dimensional spaces. In particular, T factors through a subspace of a reflexive space with an (lp, lq) FDD. Similarly, let...

A T-fuzzy equivalence relation is a fuzzy binary relation on a set X which is reflexive, symmetric and T-transitive for a t-norm T. Recently, Mesiar et al. [R. Mesiar, B. Reusch, H. Thiele, Fuzzy equivalence relations and fuzzy partitions, J. Multi-Valued Logic Soft Comput. 12 (2006) 167–181] have generalised the t-norm T to any general conjunctor C and investigated the minimal assumptions requ...

The association between hyperstructures and binary relations had been intensively studied 5,6,10,11,2,4,20 . Chvalina 5,6 and Hort 2 use ordered structures for the construction of semigroups and hypergroups. Rosenberg 4 associated with any binary relation of full domain, a hypergroupoid and found conditions on , such that is a hypergroup. Corsini and Leoreanu 16 study hypergroups and binary rel...

E cannot always use the classical methods to solve complicated problems in economics, engineering, social sciences, medical sciences etc. because different types of uncertainties are present in these theories. These days so many theories are available to deal with such type of uncertainties, such as, theory of fuzzy sets [1], theory of intuitionistic fuzzy sets [2], [3], theory of vague sets [4...

Kernel methods and rough sets are two general pursuits in the domain of machine learning and intelligent systems. Kernel methods map data into a higher dimensional feature space, where the resulting structure of the classification task is linearly separable; while rough sets granulate the universe with the use of relations and employ the induced knowledge granules to approximate arbitrary conce...

A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...

Some existence theorems for the mixed variational-like inequality for fuzzy mappings FMVLIP in a reflexive Banach space are established. Further, the auxiliary principle technique is used to suggest a novel and innovative iterative algorithm for computing the approximate solution. Consequently, not only the existence of solutions of the FMVLIP is shown, but also the convergence of iterative seq...

The paper continues a study of extensional formulas and their representation by normal forms. The notion of extensional formula is extended to the case when extensionality is considered with respect to a binary reflexive relation. It has been proved that extensional formulas can be represented by normal forms of infinite type and “approximated” by normal forms of finite type. All proofs are giv...

Let F be the set of all fuzzy numbers. In this study, we embed F into a nonseparable and non-reflexive unital Banach algebra A containing F by means of a norm defined on A, which enable us to consider F as a subset of A. Besides, the Banach lattice structure of the space A according to a partial order, we define on A has been touched on.