Fuzzy Soft Incline Algebras

3 downloads 0 Views 190KB Size Report
gebras in their book: Incline algebra and applications, and was studied by some authors [2-10]. Inclines are a generalization of both Boolean and fuzzy algebras, ...
World Applied Sciences Journal 17 (12): 1783-1788, 2012 ISSN 1818-4952 c

IDOSI Publications, 2012

Fuzzy Soft Incline Algebras N.O. Alshehri Department of Mathematics, Faculty of Sciences(Girls) King Abdulaziz University, Jeddah, Saudi Arabia [email protected] Abstract: We introduce the concept of fuzzy soft incline algebras and investigate some of their properties. We discuss fuzzy soft images and fuzzy soft inverse images of fuzzy soft incline algebras. We introduce the notion of an (∈, ∈ ∨q)− fuzzy soft incline algebra which is a generalization of a fuzzy soft incline algebras. Key words: Fuzzy soft incline algebras, (∈, ∈ ∨q)− fuzzy soft incline algebra

INTRODUCTION Cao et al. [1] introduced the notion of incline algebras in their book: Incline algebra and applications, and was studied by some authors [2-10]. Inclines are a generalization of both Boolean and fuzzy algebras, and a special type of a semiring, and they give a way to combine algebras with ordered structures to express the degree of intensity of binary relations. An incline is a structure which has an associative, commutative addition, and a distributive multiplication such that x+x = x, x + xy = x for all x, y. It has both a semiring structure and a poset structure. Inclines can also be used to represent automa and other mathematical systems, in optimization theory, to study inequalities for nonnegative matrices of polynomials. Ahn et al. [2] introduced the notion of quotient incline and obtained the structure of incline algebras. They also introduced the notion of prime and maximal ideals in an incline, and studied some relations between them in incline algebras. Most of the recent mathematical methods meant for formal modelling, reasoning and computing are crisp, accurate and deterministic in nature. But in ground reality, crisp data is not always the part and parcel of the problems encountered in different fields. As a consequence various theories including probability, fuzzy sets, intuitionistic fuzzy sets, vague sets, interval mathematics, rough sets have been evolved in process. But difficulties present in all these theories have been shown by Molodtsov in his paper. The cause of these problems is possibly related to the inadequacy of the parametrization tool of the theories. For handling real life ambiguous situations we need to have methodologies which provide some form or other flexible information processing capacity. In 1999, Molodtsov [11] initiated the concept of soft theory as a new mathematical tool for solving the uncertainties which is free from the above difficulties. He successfully applied the soft set theory into several disci-

plines including game theory, Riemann integration, measure theory. Applications of soft set theory in real life problems are now catching momentum due to the general nature parametrization expressed by a soft set. Maji et al. [12] gave first practical application of soft sets in decision making problems. They also presented the notion of fuzzy soft sets [13], which has proven to be a very natural and effective extension of Molodtsov’s soft sets. Ayg¨ unoglu and Ayg¨ un [14] first introduced the concept of fuzzy soft groups and studied several of their properties. Authors like Ali and Shabir [15], Yang [16], Yin and Zhan [17], Akram et al. [18] are the contributors of fuzzy soft algebraic structures. In this paper, we introduce the concept of fuzzy soft incline algebras and investigate some of their properties. We discuss fuzzy soft images and fuzzy soft inverse images of fuzzy soft incline algebras. We introduce the notion of an (∈, ∈ ∨q)− fuzzy soft incline algebra which is a generalization of a fuzzy soft incline algebras. REVIEW OF LITERATURE An incline (algebra) is a set K with two binary operations denoted by “ + ” and “ ∗ ” satisfying the following axioms for all x, y ∈ K, (a) x + y = y + x, (b) x + (y + z) = (x + y) + z, (c) x ∗ (y ∗ z) = (x ∗ y) ∗ z, (d) x ∗ (y + z) = (x ∗ y) + (x ∗ z), (e) (y + z) ∗ x = (y ∗ x) + (z ∗ x), (f) x + x = x, (g) x + (x ∗ y) = x, (h) y + (x ∗ y) = y. Furthermore, an incline algebra K is said to be commutative if x ∗ y = y ∗ x for all x, y ∈ K. For convenience, we pronounce “+” (resp. “∗”) as addition (resp. multiplication). Every distributive lattice is an incline. An incline is a distributive lattice (as a semiring) if and only if x ∗ x = x for all x ∈ K.

1783

World Appl. Sci. J., 17 (12): 1783-1788, 2012

Note that x ≤ y ⇔ x + y = y for all x, y ∈ K. A subincline of an incline K is a non-empty subset M of K which is closed under addition and multiplication. A subincline M is said to be an ideal of an incline K if x ∈ M and y ≤ x then y ∈ M . An element 0 in an incline algebra K is a zero element if x+0 = x = 0+x and x ∗ 0 = 0 ∗ x = 0, for any x ∈ K. By a homomorphism of inclines we shall mean a mapping f from an incline K into an incline L such that f (x + y) = f (x) + f (y) and f (x ∗ y) = f (x) ∗ f (y) for all x, y ∈ K. Definition 1. A fuzzy set µ in a set X of the form ( t ∈ (0, 1], if y=x , µ(y) = 0, y 6= x, is said to be a fuzzy point with support x and value t and is denoted by xt . For a fuzzy point xt and a fuzzy set µ in a set X, Pu and Liu gave meaning to the symbol xt αµ, where α ∈ {∈, q, ∈ ∨q, ∈ ∧q}. A fuzzy point xt is called belong to a fuzzy set µ, written as xt ∈ µ, if µ(x) ≥ t. A fuzzy point xt is said to be quasicoincident with a fuzzy set µ, written as xt qµ, if µ(x) + t > 1. To say that xt ∈ ∨qµ (resp. xt ∈ ∧qµ) means that xt ∈ µ or xt qµ (resp. xt ∈ µ and xt qµ). xt αµ means that xt αµ does not hold, where α ∈ {∈, q, ∈ ∨q, ∈ ∧q}. Definition 2. A fuzzy set µ in an incline algebra K is called a fuzzy incline algebra of K if 1. µ(x + y) ≥ min(µ(x), µ(y)), 2. µ(x ∗ y) ≥ min(µ(x), µ(y)) for all x, y ∈ G. Definition 3. A fuzzy set µ in K is called an (∈, ∈ ∨q)fuzzy incline algebra of K if it satisfies the following conditions: (1) xs ∈ µ → (e)s ∈ ∨qµ, (2) xs ∈ µ, yt ∈ µ → (x + y)min(s,t) ∈ ∨qµ, (3) xs ∈ µ, yt ∈ µ → (x ∗ y)min(s,t) ∈ ∨qµ for all x, y ∈ G, s, t ∈ (0, 1]. Proposition 4. Let K be an incline algebra. A fuzzy set µ in K is a fuzzy incline algebra of K if and only if the following assertions are valid: 1. xt ∈ µ, ys ∈ µ → (x + y)min(s,t) ∈ µ, 2. xt ∈ µ, ys ∈ µ → (x ∗ y)min(s,t) ∈ µ for all x, y ∈ G, s, t ∈ (0, 1]. Molodtsov defined the notion of soft set in the following way: Let U be an initial universe and E be a set of parameters. Let P (U ) = I U denotes the power set of U and let A be non-empty subset of E. A pair (f, A) is called a soft set over U , where f is a mapping given by f : A → P (U ). In other words, a soft set over U is a parameterized family of subsets of the universe U . For

ε ∈ A, f (ε) may be considered as the set of ε− approximate elements of the soft set (f, A). Clearly, a soft set is not just a subset of U . Maji et al. defined fuzzy soft set in the following way: A pair (f, A) is called a fuzzy soft set over U , where f is a mapping given by f : A → P(U ), P(U ) = I U , I = [0, 1]. In general, for every ε ∈ A, f (ε) = fε is a fuzzy set of U and it is called fuzzy value set of parameter x. The set of all fuzzy soft sets over U with parameters from E is called a fuzzy soft class, and it is denote by FS(U, E). Definition 5. A fuzzy soft set (f, A) over U is called a null fuzzy soft set, denoted by Φ, if f (ε) is the null fuzzy set 0 of U , where 0(x) = 0 for all x ∈ U . A fuzzy soft set (g, A) over U is called a whole fuzzy soft set, denoted by U, if g(ε) is the whole fuzzy set 1 of U , where 1(x) = 1 for all x ∈ U . To solve decision making problems based on fuzzy soft sets, Feng et al. [19] introduced the following notion called t-level soft sets of fuzzy soft sets. Definition 6. Let (f, A) be a fuzzy soft set over U . For each t ∈ [0, 1], the set (f, A)t = (f t , A) is called an tlevel soft set of (f, A), where fεt = {x ∈ U | fε (x) ≥ t} for all ε ∈ A. Clearly, (f, A)t is a soft set over U . Definition 7. Let (f, A) and (g, B) be two fuzzy soft sets over U . We say that (f, A) is a fuzzy soft subset of (g, B) and write (f, A) b (g, B) if (i) A ⊆ B, (ii) For any ε ∈ A, f (ε) ⊆ g(ε). (f, A) and (g, B) are said to be fuzzy soft equal and write (f, A) = (g, B) if (f, A) b (g, B) and (g, B) b (f, A). Definition 8. Let (f, A) and (g, B) be two fuzzy soft sets over U . Then their extended intersection is a fuzzy soft set denoted by (h, C), where C = A ∪ B and  if ε ∈ A − B,  fε gε if ε ∈ B − A, h(ε) =  fε ∩ gε if ε ∈ A ∩ B, for all ε ∈ C. e (g, B). (f, A)∩

This is denoted by (h, C) =

Definition 9. If (f ,A) and (g,B) are two fuzzy soft sets over the same universe U then “(f ,A)AND(g,B)" is a fuzzy soft set denoted by (f ,A) ∧ (g,B), and is defined by (f ,A)∧(g,B) = (h,A×B) where, h(a, b) = h(a)∩g(b) for all (a,b) ∈ A × B. Here ∩ is the operation of fuzzy intersection. Definition 10. Let (f, A) and (g, B) be two fuzzy soft sets over U . Then their extended union denoted by

1784

World Appl. Sci. J., 17 (12): 1783-1788, 2012

(h, C), where C = A ∪ B and  if ε ∈ A − B,  fε gε if ε ∈ B − A, h(ε) =  fε ∪ gε if ε ∈ A ∩ B, for all ε ∈ C. e (g, B). (f, A)∪

f (e2 ) = {(a, 0.6), (b, 0.2), (c, 0.5), (d, 0.2), f (e3 ) = {(a, 0.7), (b, 0.1), (c, 0.3), (d, 0.1).

This is denoted by (h, C) =

We state the following propositions without their proofs.

Definition 11. Let (f, A) and (g, B) be two fuzzy soft sets over a common universe U with A ∩ B 6= ∅, then their restricted intersection is a fuzzy soft set (h, A ∩ B) denoted by (f, A) e (g, B) = (h, A ∩ B) where, h(ε) = f (ε) ∩ g(ε) for all ε ∈ A ∩ B. Definition 12. Let (f, A) and (g, B) be two fuzzy soft sets over a common universe U with A ∩ B 6= ∅, then their restricted union is denoted by (f, A) d (g, B) and is defined as (f, A) d (g, B) = (h, C) where C = A ∩ B and for all ε ∈ C, h(ε) = f (ε) ∪ g(ε). Definition 13. The extended product of two fuzzy soft sets (f, A) and (g, B) over U is a fuzzy soft set, denoted by (f ◦ g, C), where C = A ∪ B and  if ε ∈ A − B,  f (ε) g(ε) if ε ∈ B − A, (f ◦ g)(ε) =  f (ε) ◦ g(ε) if ε ∈ A ∩ B, for all ε ∈ C. (f, A)e ◦(g, B).

This is denoted by (f ◦ g, C) =

Definition 14. If A ∩ B 6= ∅, then the restricted product (h,C) of two fuzzy soft sets (f ,A) and (g,B) over U is defined as the fuzzy soft set, (h,A ∩ B) denoted by (f ,A) oR (g,B) where h (ε) = f (ε) ◦ g (ε), for all ε ∈ A ∩ B. Here f (ε) ◦ g (ε) is the product of two fuzzy subsets of U . FUZZY SOFT INCLINE ALGEBRAS Definition 15. Let (f, A) be a fuzzy soft set over K. Then (f, A) is said to be a fuzzy soft incline algebra over K if (a) fε (x + y) > min{fε (x), fε (y)}, (b) fε (x ∗ y) > min{fε (x), fε (y)} for all x, y ∈ K. Example 16. Consider the incline algebra K = {a, b, c, d} and we define the sum “+” and product “∗“ on K as: + a b c d

a a b c d

b b b b b

c c b c b

Clearly, (f, A) is fuzzy soft sets over K. By routine calculations, it is easy to see that f (x) is fuzzy incline algebra s for x ∈ A.

d d b b d

∗ a b c d

a a a a a

b a b c d

c a c c a

d a d a d

Let A = {e1 , e2 , e3 } and f : A → P(K) be a set-valued function defined by f (e1 ) = {(a, 0.7), (b, 0.3), (c, 0.6), (d, 0.3)},

Proposition 17. Let (f, A) and (g, B) be fuzzy soft ine (g, B) is a fuzzy soft cline algebra s over K, then (f, A)∩ incline algebra over K. Proposition 18. Let (f, A) and (g, B) be fuzzy soft incline algebra s over K, then (f, A)∧(g, B) is a fuzzy soft incline algebra over K. Proposition 19. Let (f, A) and (g, B) be fuzzy soft ine (g, B) cline algebra s over K. If A ∩ B = ∅ then (f, A)∪ is a fuzzy soft incline algebra of K. Theorem 20. Let (f, A) be a fuzzy soft set over K. (f, A) is a fuzzy soft incline algebra if and only if (f, A)t is a soft incline algebra over K for each t ∈ [0, 1]. Proof. Suppose that (f, A) is a fuzzy soft incline algebra . For each t ∈ [0, 1], ε ∈ A and x1 , x2 ∈ fεt , then fε (x1 ) ≥ t and fε (x2 ) ≥ t. From Definition 15, it follows that fε is a fuzzy incline algebra over K. Thus fε (x1 + x2 ) ≥ min(fε (x1 ), fε (x2 )), fε (x1 + x2 ) ≥ t. This implies that x1 + x2 ∈ fεt , Likewise, x1 ∗ x2 ∈ fεt i.e., fεt is a incline algebra over K. According to Definition 6, (f, A)t is a soft incline algebra over K for each t ∈ [0, 1]. Conversely, assume that (f, A)t is a soft incline algebra over K for each t ∈ [0, 1]. For each ε ∈ A and x1 , x2 ∈ K, let t = min{fε (x1 ), fε (x2 )}, then x1 , x2 ∈ fεt . Since fεt is a incline algebra over K, then x1 + x2 , x1 ∗ x2 ∈ fεt . This means that fε (x1 + x2 ) ≥ min(fε (x1 ), fε (x2 )), fε (x1 ∗ x2 ) ≥ min(fε (x1 ), fε (x2 )), i.e., fεt is a fuzzy incline algebra over K. According to Definition 15, (f, A) is a fuzzy soft incline algebra over K. This completes the proof. Definition 21. Let φ : X → Y and ψ : A → B be two functions, A and B are parametric sets from the crisp sets X and Y , respectively. Then the pair (φ, ψ) is called a fuzzy soft function from X to Y . Definition 22. Let (f, A) and (g, B) be two fuzzy soft sets over K1 and K2 , respectively and let (φ, ψ) be a fuzzy soft function from K1 to K2 . (1) The image of (f, A) under the fuzzy soft function (φ, ψ), denoted by (φ, ψ)(f, A), is the fuzzy soft set on K2 defined by (φ, ψ)(f, A) = (φ(f ), ψ(A)), where for all k ∈ ψ(A), y ∈ K2 W  W if x ∈ ψ −1 (y), φ(x)=y ψ(a)=k fa (x) φ(f )k (y) = 0 otherwise.

1785

World Appl. Sci. J., 17 (12): 1783-1788, 2012

(2) The preimage of (g, B) under the fuzzy soft function (φ, ψ), denoted by (φ, ψ)−1 (g, B), is the fuzzy soft set over K1 defined by (φ, ψ)−1 (g, B) = (φ−1 (g), ψ −1 (B)) where φ−1 (g)a (x) = gψ(a) (φ(x)), for all a ∈ ψ −1 (A), for all x ∈ K1 . Definition 23. Let (φ, ψ) be a fuzzy soft function from K1 to K2 . If φ is a homomorphism from K1 to K2 then (φ, ψ) is said to be fuzzy soft homomorphism, If φ is a isomorphism from K1 to K2 and ψ is one-to-one mapping from A onto B then (φ, ψ) is said to be fuzzy soft isomorphism. Theorem 24. Let (g, B) be a fuzzy soft incline algebra over K2 and let (φ, ψ) be a fuzzy soft homomorphism from K1 to K2 . Then (φ, ψ)−1 (g, B) is a fuzzy soft incline algebra over K1 .

Let µ be a fuzzy set in G defined by µ(0) = 0.7, µ(a) = 0.8, µ(b) = 0.8 and µ(1) = 0.4. Then µ is an (∈, ∈ ∨q)-fuzzy incline algebra of K. Take A = (0, 0.5] and let (f, A) be an ∈-soft set over K. Then (1) f (t) = G if t ∈ (0, 0.4], (2) f (t) = {0, a, b} if t ∈ (0.4, 0.6] which are incline algebras of K. Hence (f, A) is a soft incline algebra over K. Definition 28. Let (fµ , A) be a fuzzy soft set over K. Then (fµ , A) is said to be an (∈, ∈ ∨q)-fuzzy soft incline algebra over K if fµ (x) is an (∈, ∈ ∨q)-fuzzy incline algebra of K for all x ∈ A. Example 29. Consider the incline algebra K = {0, a, b, 1} and + and ∗ are given by the Cayley’s table in Example 27. Let A = {e1 , e2 } and fµ : A → P(K) be a set-valued function defined by

Proof. Let x1 , x2 ∈ K1 , then

fµ (e1 ) = {(0, µ(0)), (a, µ(a)), (b, µ(b)), (1, µ(1))},

φ−1 (gε )(x1 + x2 ) = gψ(ε) (φ(x1 + x2 )) = gψ(ε) (φ(x1 ) + φ(x2 )) > min{gψ(ε) (φ(x1 )), gψ(ε) (φ(x2 ))} = min{φ−1 (gε )(x1 ), φ−1 (gε )(x2 )},

fµ (e1 ) = {(0, 0.7), (a, 0.4), (b, 0.6), (1, 0.4)}, fµ (e2 ) = {(0, µ(0)), (a, µ(a)), (b, µ(b)), (1, µ(1))}, fµ (e2 ) = {(0, 0.8), (a, 0.5), (b, 0.7), (1, 0.5)}.

φ−1 (gε )(x1 ∗ x2 ) = gψ(ε) (φ(x1 ∗ x2 )) = gψ(ε) (φ(x1 ) ∗ φ(x2 )) > min{gψ(ε) (φ(x1 )), gψ(ε) (φ(x2 ))} = min{φ−1 (gε )(x1 ), φ−1 (gε )(x2 )}. Hence (φ, ψ)−1 (g, B) is a fuzzy soft incline algebra over K1 .

Clearly, (fµ , A) is fuzzy soft set over K. Since µ(x+y) ≥ min(µ(x), µ(y), 0.5), µ(x ∗ y) ≥ min(µ(x), µ(y), 0.5) hold for all x, y ∈ K, fµ (x) is an (∈, ∈ ∨q)-fuzzy incline algebra of K for all x ∈ A. Hence (fµ , A) is an (∈, ∈ ∨q)- fuzzy soft incline algebra over K. The proofs of the following propositions are obvious.

Remark 25. Let (f, A) be a fuzzy soft incline algebra over K1 and let (φ, ψ) be a fuzzy soft homomorphism from K1 to K2 . Then (φ, ψ)(f, A) may not be a fuzzy soft incline algebra over K2 .

Proposition 30. Let (fµ , A) and (gµ , B) be (∈, ∈ ∨q)e (gµ , B) fuzzy soft incline algebras over K, then (fµ , A)∩ is an (∈, ∈ ∨q)-fuzzy soft incline algebra over K.

(∈, ∈ ∨q)− FUZZY SOFT INCLINE ALGEBRAS

Proposition 31. Let (fµ , A) and (gµ , B) be (∈, ∈ ∨q)fuzzy soft incline algebras over K, then (fµ , A)∧(gµ , B) is an (∈, ∈ ∨q)-fuzzy soft incline algebra over K.

Definition 26. Given a fuzzy set µ in K and A ⊆ [0, 1], we define two set-valued functions f : A → P (K) and fq : A → P (K) by f (t) = {x ∈ G | xt ∈ µ}, fq (t) = {x ∈ G | xt qµ ∈ µ} for all t ∈ A, respectively. Then (f, A) and (fq , A) are soft sets over K, which are called an ∈-soft set and a q-soft set over K, respectively. Example 27. Consider the incline algebra K = {0, a, b, 1} and we have define the sum “+” and product “∗“ on K as: + 0 a b 1

0 0 a b 1

a a a b 1

b b b b 1

1 1 1 1 1

∗ 0 a b 1

0 0 0 0 0

a 0 a a a

b 0 a b b

1 0 a b 1

Proposition 32. Let (fµ , A) and (gµ , B) be (∈, ∈ ∨q)fuzzy soft incline algebras over K. If A ∩ B = ∅ then e (gµ , B) is an (∈, ∈ ∨q)-fuzzy soft incline alge(fµ , A)∪ bra of K. Proposition 33. Let µ be a fuzzy set in a K-algebra K and let (f, A) be an ∈-soft set on K with A =(0, 1]. Then (f, A) is a soft incline algebra on K if and only if µ is a fuzzy incline algebra of K. Proof. Assume that (f, A) is a soft incline algebra on K. If µ is not a fuzzy incline algebra of K, then there exist a, b ∈ K such that µ(a + b) < min(µ(a), µ(b)). Take t ∈ A such that µ(a + b) < t ≤ min(µ(a), µ(b)). Then at ∈ µ and bt ∈ µ but (a + b)min(t,t) =(a + b)t ∈ / µ. Hence a, b ∈ f (t), but a + b ∈ / f (t), a contradiction. Thus, µ(x + y) ≥ min(µ(x), µ(y)) for all x, y ∈ K. Likewise, µ(x ∗ y) ≥ min(µ(x), µ(y)).

1786

World Appl. Sci. J., 17 (12): 1783-1788, 2012

Conversely, suppose that µ is a fuzzy incline algebra of K. Let t ∈ µ and x, y ∈ f (t). Then xt and yt ∈ µ. It follows from Proposition 4 that (x + y)t = (x + y)min(t,t) ∈ µ so that x + y ∈ f (t). Likewise, x ∗ y ∈ f (t). Hence f (t) is a incline algebra of K, i.e., (f, A) is a soft incline algebra on K. Proposition 34. Let µ be a fuzzy set in an incline algebra K and let (fq , A) be a q-soft set over K with A = (0, 1]. Then (fq , A) is a soft incline algebra over K if and only if µ is a fuzzy incline algebra of K. Proof. Suppose that µ is a fuzzy incline algebra of K. Let t ∈ A and x, y ∈ fq (t). Then xtq µ and yt qµ, i.e., µ(x)+t > 1 and µ(y)+t > 1. It follows from Definition 2 that µ(x + y) + t ≥ min(µ(x), µ(y)) + t = min(µ(x) + t, µ(y) + t) > 1 so that (x + y)t qµ, i.e., x + y ∈ fq (t). Likewise, x ∗ y ∈ fq (t). Hence fq (t) is a incline algebra of K for all t ∈ A, and so (fq , A) is a soft incline algebra over K. The proof of converse part is obvious. This complete the proof. Proposition 35. Let µ be a fuzzy set in an incline algebra K and let (f, A) be an ∈-soft set on K with A = (0.5, 1]. Then the following assertions are equivalent: (a) (f, A) is a soft incline algebra over K,

Conversely, suppose that (ii) is valid. If there exist a, b ∈ G such that µ(a + b) < min(µ(a), µ(b), 0.5), then we take t ∈ (0, 1) such that µ(a + b) < t ≤ min(µ(a), µ(b), 0.5). Thus t ≤ 0.5, at ∈ µ and bt ∈ µ, that is, a ∈ f (t) and b ∈ f (t). Since f (t) is a incline algebra of K. it follows that a + b ∈ f (t) for all t ≤ 0.5 so that (a + b)t ∈ µ or equivalently µ(a + b) ≥ t for all t ≤ 0.5, a contradiction. Hence µ(x + y) ≥ min(µ(x), µ(y), 0.5) for all x, y ∈ K. Likewise, µ(x ∗ y) ≥ min(µ(x), µ(y), 0.5) for all x, y ∈ K. It follows from Lemma 36 that µ is an (∈, ∈ ∨q)-fuzzy incline algebra of K. We state the following proposition without its proof. Proposition 38. Let H be a incline algebra of an incline algebra K and let (f, A) be a soft set over K. If A = (0, 0.5], then there exists an (∈, ∈ ∨q)-fuzzy incline algebra µ of K such that f (t) = {x ∈ H | xt ∈ µ} = H ∀ t ∈ A.

(b) max(µ(x + y), 0.5) ≥ min(µ(x), µ(y))

Proposition 39. Let µ be a fuzzy set in an incline algebra K and let (fq , A) be a q-soft set over K with A = (0, 1]. Then the following assertions are equivalent:

(c) max(µ(x ∗ y), 0.5) ≥ min(µ(x), µ(y)) x, y ∈ K.

(i) µ is a fuzzy incline algebra of K,

Lemma 36. A fuzzy set µ in an incline algebra K is an (∈, ∈ ∨q)-fuzzy incline algebra of K if and only if it satisfies: • µ(x + y) ≥ min(µ(x), µ(y), 0.5), • µ(x ∗ y) ≥ min(µ(x), µ(y), 0.5) for all x, y ∈ K. Proposition 37. Let µ be a fuzzy set in an incline algebra K and let (f, A) be an ∈-soft set on K with A = (0, 0.5]. Then the following assertions are equivalent: (i) µ is an (∈, ∈ ∨q)-fuzzy incline algebra of K, (ii) (f, A) is a soft incline algebra over K. Proof. Assume that µ is an (∈, ∈ ∨q)-fuzzy incline algebra of K. Let t ∈ A and x, y ∈ f (t). Then xt ∈ µ and yt ∈ µ or equivalently µ(x) ≥ t and µ(y) ≥ t. It follows from Lemma 4.6 that µ(x + y) ≥ min(µ(x), µ(y), 0.5) ≥ min(t, 0.5) = t, so that (x + y)t ∈ µ, or equivalently x + y ∈ f (t). Likewise, x ∗ y ∈ f (t). Hence (f, A) is a soft incline algebra on K.

(ii) (fq (t) 6= ∅ → fq (t)) is a incline algebra of K for all t ∈ A. Proof. Assume that µ is a fuzzy incline algebra of K. Let t ∈ A be such that fq (t) 6= ∅. Let x, y ∈ K be such that x + y ∈ fq (t), e ∈ fq (t). Then (x + y)t qµ, (x ∗ y)∈ µt q or equivalently, µ(x + y) + t > 1, µ(x ∗ y) + t > 1. Using Definition 2, we have µ(x ∗ y) + t ≥ µ(x) + t > 1, µ(x + y) + t ≥ min(µ(x), µ(y)) + t = min(µ(x) + t, µ(y) + t) > 1, and so (x + y)t qµ i.e., x ∗ y ∈ fq (t), x + y ∈ fq (t). Thus fq (t) is a incline algebra of K. Conversely, assume that (ii) is valid. Suppose there exist a, b ∈ G such that µ(a + b) < min(µ(a), µ(b)). Then µ(a + b) + s ≤ 1 < min(µ(a), µ(b)) + s for some s ∈ A. It follows that (a)s qµ and bs qµ, i.e., a ∈ fq (s) and b ∈ fq (s). Since fq (s) is a incline algebra of K, we get a + b ∈ fq (s), and so (a + b)s qµ or equivalently µ(a + b) + s > 1, a contradiction. Thus µ(x + y) ≥ min(µ(x), µ(y)) for all x, y ∈ K. Likewise, µ(x ∗ y) ≥ min(µ(x), µ(y)) for all x, y ∈ K. Hence µ is a fuzzy incline algebra of K.

1787

World Appl. Sci. J., 17 (12): 1783-1788, 2012

REFERENCES

18. Akram, M., N.O. Alshehri, R.S. Al-ghamdi. 2013. Fuzzy soft K-algebras, Utilitas Mathematica 90:116.

1. Cao, Z.Q. K.H. Kim, F.W. Roush. 1984. Incline algebra and applications, Ellis Horwood, New York. 2. Ahn, S.S., Y.B. Jun, H.S. Kim, 2001. Ideals and quotients of incline algebras, Comm. Korean Math. ˝ Soc. 16: 573U583.

19. F. Feng, Y.B. Jun, X.Y. Liu and L.F. Li, An adjustable approach to fuzzy soft set based decision making, Journal of Computational and Applied Mathematics 234 (2010)10-20.

3. Kim, K.H., F. W. Roush, 1995. Inclines of algebraic structures, Fuzzy Sets and Systems 72: 189-196.

20. Zadeh, L.A. 1965. Fuzzy sets, Inform. and Control, 8: 338-353.

4. Kim, K.H., F.W. Roush, G. Markowsky, 1997. Representation of inclines, Algebra Colloq. 4: 461-470.

22. Aktas, H., N. Cagman. 2007. Soft sets and soft groups, Information Sciences 177: 2726-2735.

5. Turunen, E. 1999. Mathematics Behind Fuzzy Logic, Physica-Verlag, Heidelberg.

23. Acar, U., F. Koyuncu, B. Tanay. 2010. Soft sets and soft rings, Computers and Mathematics with Applications 59: 3458-3463.

6. Al-Shehri, N.O. 2010. On derivations of incline algebras, Scientia Mathematicae Japonicae 71: 349355.

24. Feng, F., Y.B. Jun, X. Z. Zhao. 2008. Soft semirings, Comput. Math. Appl. 56: 2621-2628.

7. Han, S.C. 2005. A Study on Incline Matrices with Indices, Ph.D. Dissertation, Beijing Normal University, China.

25. Jun, Y.B. 2008. Soft BCK/BCI-algebras, Computers & Mathematics with Applications 56:4081413.

8. Ahn, S.S. 1997. Permanents over inclines and other semirings, PU. M. A. 8: 147–154. 9. Yao, W. and S.C.Han. 2009. On ideals, filters and congruences in inclines, Bull. Korean Math. Soc. 46: 591-598. 10. Ahn, S.S. and H.S. Kim. 2002. On r−ideals in incline algebras, Commun. Korean Math. Soc. 17: 229-235. 11. Molodtsov, D. 1986. Soft set theory first results, Comput. Math. Appl. 37: 19-31. 12. Maji, P.K., R. Biswas, R. Roy. 2003. Soft set theory, Comput. Math. Appl. 45: 555-562. 13. Maji, P.K., R. Biswas, R.Roy. 2001. Fuzzy soft sets, The J. of Fuzzy Math. 9: 589-602. 14. Ayg¨ unoglu, A., Ayg¨ un, H. 2009. Introduction to fuzzy soft groups, Comput. Math. Appl. 58: 12791286. 15. Ali, M.I., Shabir, M. 2009. Soft ideals and generalized fuzzy ideals in semigroups, New Math. and Nat. Comp. 5: 599-615. 16. Yang, C.-F. 2011. Fuzzy soft semigroups and fuzzy soft ideals, Comput. Math. Appl. 61: 255-561. 17. Y. Yin and J. Zhan, The characterizations of hemirings in terms of fuzzy soft h-ideals, Neural Computing and Applications 21(2012) S43-S57. 1788

26. Kazanci, O., S. Ylmaz, S. Yama. 2010. Soft sets and soft BCH-algebras, Hacettepe Journal of Mathematics and Statistics 39: 205-217. ¨ urk, M.A., Inan, ˙ 27. Ozt¨ E. 2012. Fuzzy soft subnearrings and (∈, ∈ ∨q)-fuzzy soft subnear-rings, Computers and Mathematics with Applications, 63: 617628. 28. Chen, D., E.C.C. Tsang, D. S. Yeung, X. Wang. 2005. The parameterization reduction of soft sets and its applications, Computers and Mathematics with Applications 49:757-763. 29. Akram, M., F. Feng. 2013. Soft intersection Lie algebras, Quasigroups and Related Systems, 21: 110. 30. Pu, P.M., Liu, Y.M. 1980. Fuzzy topology,I. Neighborhood structure of a fuzzy point and Moore-Smith convergence, J. Math. Anal. Appl. 76: 571-599.