Skip to main content
The Scientific World Journal logoLink to The Scientific World Journal
. 2014 Jun 23;2014:136424. doi: 10.1155/2014/136424

Ideal Theory in Semigroups Based on Intersectional Soft Sets

Seok Zun Song 1, Hee Sik Kim 2,*, Young Bae Jun 3
PMCID: PMC4094860  PMID: 25101310

Abstract

The notions of int-soft semigroups and int-soft left (resp., right) ideals are introduced, and several properties are investigated. Using these notions and the notion of inclusive set, characterizations of subsemigroups and left (resp., right) ideals are considered. Using the notion of int-soft products, characterizations of int-soft semigroups and int-soft left (resp., right) ideals are discussed. We prove that the soft intersection of int-soft left (resp., right) ideals (resp., int-soft semigroups) is also int-soft left (resp., right) ideals (resp., int-soft semigroups). The concept of int-soft quasi-ideals is also introduced, and characterization of a regular semigroup is discussed.

1. Introduction

Molodtsov [1] introduced the concept of soft set as a new mathematical tool for dealing with uncertainties. He pointed out several directions for the applications of soft set theory. At present, works on soft set theory are progressing rapidly. Maji et al. [2] described the application of soft set theory to a decision making problem. Maji et al. [3] also studied several operations on the theory of soft sets.

Çağman and Enginoğlu [4] introduced fuzzy parameterized (FP) soft sets and their related properties. They proposed a decision making method based on FP-soft set theory and provided an example which shows that the method can be successfully applied to the problems that contain uncertainties. Decision making based on soft sets was further developed in [58]. It is worth noting that soft sets are closely related to many other soft computing models such as rough sets and fuzzy sets. Feng and Li [9] initiated soft approximation spaces and soft rough sets, which extended Pawlak's rough sets. Moreover, Feng [10] considered the application of soft rough approximations in multicriteria group decision making problems. Aktaş and Çağman [11] studied the basic concepts of soft set theory and compared soft sets to fuzzy and rough sets, providing examples to clarify their differences. They also discussed the notion of soft groups. After that, many algebraic properties of soft sets were studied by several researchers (see [1226]). Recently, Feng et al. [27] investigated the relationships among five different types of soft subsets. They also explored free soft algebras associated with soft product operations, showing that soft sets have some nonclassical algebraic properties. In this paper, we introduce the notion of int-soft semigroups and int-soft left (resp., right) ideals. Using these notions, we provide characterizations of subsemigroups and left (resp., right) ideals. Using the notion of inclusive set, we also establish characterizations of subsemigroups and left (resp., right) ideals. Using the notion of int-soft products, we give characterizations of int-soft semigroups and int-soft left (resp., right) ideals. We show that the soft intersection of int-soft left (resp., right) ideals (resp., int-soft semigroups) is also int-soft left (resp., right) ideals (resp., int-soft semigroups). We also introduce the concept of int-soft quasi-ideals and discuss a characterization of a regular semigroup by using the notion of int-soft quasi-ideals.

2. Preliminaries

Let S be a semigroup. Let A and B be subsets of S. Then the multiplication of A and B is defined as follows:

    AB={abSaA,bB}. (1)

A semigroup S is said to be regular if for every xS there exists aS such that xax = x.

A nonempty subset A of S is called

  1. a subsemigroup of S if AAA, that is, abA for all a, bA,

  2. a left (resp., right) ideal of S if SAA (resp., SAA), that is, xaA (resp., axA) for all xS and aA,

  3. a two-sided ideal of S if it is both a left and a right ideal of S,

  4. a quasi-ideal of S if ASSAA.

A soft set theory was introduced by Molodtsov [1], and Çağman and Enginoğlu [5] provided new definitions and various results on soft set theory.

In what follows, let U be an initial universe set and let E be a set of parameters. Let P(U) denote the power set of U and A, B, C,…⊆E.

Definition 1 (see [1, 5]). —

A soft set (α, A) over U is defined to be the set of ordered pairs

(α,A):={(x,α(x)):xE,α(x)P(U)}, (2)

where α : EP(U) such that α(x) = if xA.

The function α is called approximate function of the soft set (α, A). The subscript A in the notation α indicates that α is the approximate function of (α, A).

Definition 2 (see [28]). —

Assume that E has a binary operation ↪. For any nonempty subset A of E, a soft set (α, A) over U is said to be intersectional over U if it satisfies

(xyAα(x)α(y)α(xy))(x,yA). (3)

For a soft set (α, A) over U and a subset γ of U, the γ-inclusive set of (α, A), denoted by i A(α; γ), is defined to be the set

    iA(α;γ):={xAγα(x)}. (4)

3. Intersectional Soft Ideals

In what follows, we take E = S, as a set of parameters, which is a semigroup unless otherwise specified.

Definition 3 . —

A soft set (α, S) over U is called an intersectional soft semigroup (briefly, int-soft semigroup) over U if it satisfies

    (x,yS)(α(x)α(y)α(xy)). (5)

Definition 4 . —

A soft set (α, S) over U is called an intersectional soft left (resp., right) ideal (briefly, int-soft left (resp., right) ideal) over U if it satisfies

    (x,yS)(α(xy)α(y)(resp.,α(xy)α(x))). (6)

If a soft set (α, S) over U is both an int-soft left ideal and an int-soft right ideal over U, we say that (α, S) is an intersectional soft two-sided ideal (briefly, int-soft two-sided ideal) over U.

Example 5 . —

Let S = {a, b, c, d} be a semigroup with the following Cayley table:

graphic file with name TSWJ2014-136424.e001.jpg (7)

Let (α, S) be a soft set over U defined as follows:

α:SP(U),x{γ1,if  x=a,γ2,if  x=b,γ4,if  x=c,γ3,if  x=d, (8)

where γ 1, γ 2, γ 3, and γ 4 are subsets of U with γ 1γ 2γ 3γ 4. Then (α, S) is an int-soft two-sided ideal over U.

Obviously, every int-soft left (resp., right) ideal over U is an int-soft semigroup over U. But the converse is not true as seen in the following example.

Example 6 . —

Let S = {0,1, 2,3, 4,5} be a semigroup with the following Cayley table:

graphic file with name TSWJ2014-136424.e002.jpg (9)
  • (1)
    Let (α, S) be a soft set over U defined as follows:
    α:SP(U),x{γ1,if  x=0,γ2,if  x=1,γ5,if  x{2,4},γ4,if  x=3,γ3,if  x=5, (10)
    where γ 1, γ 2, γ 3, γ 4, and γ 5 are subsets of U with γ 1γ 2γ 3γ 4γ 5. Then (α, S) is an int-soft semigroup over U. But it is not an int-soft left ideal over U since α(3 · 5) = α(3) = γ 4γ 3 = α(5).
  • (2)
    Let (β, S) be a soft set over U defined as follows:
    β:SP(U),x{γ1if  x{0,1},γ3if  x=2,γ2if  x=3,γ4if  x{4,5}, (11)
    where γ 1, γ 2, γ 3, and γ 4 are subsets of U with γ 1γ 2γ 3γ 4. Then (β, S) is an int-soft semigroup over U. But it is not an int-soft right ideal over U since β(3 · 4) = β(2) = γ 3γ 2 = β(3).

For a nonempty subset A of S, define a map χ A as follows:

χA:SP(U),x{U,if  x  A,,otherwise. (12)

Then (χ A, S) is a soft set over U, which is called the characteristic soft set. The soft set (χ S, S) is called the identity soft set over U.

Theorem 7 . —

For any nonempty subset A of  S, the following are equivalent.

  1. A is a left (resp., right) ideal of  S.

  2. The characteristic soft set (χ A, S) over  U is an int-soft left (resp., right) ideal over  U.

Proof —

Assume that A is a left ideal of S. For any x, yS, if yA then χ A(xy)⊇ = χ A(y). If yA, then xyA since A is a left ideal of S. Hence χ A(xy) = U = χ A(y). Therefore (χ A, S) is an int-soft left ideal over U. Similarly, (χ A, S) is an int-soft right ideal over U when A is a right ideal of S.

Conversely suppose that (χ A, S) is an int-soft left ideal over U. Let xS and yA. Then χ A(y) = U, and so χ A(xy)⊇χ A(y) = U; that is, χ A(xy) = U. Thus xyA and therefore A is a left ideal of S. Similarly, we can show that if (χ A, S) is an int-soft right ideal over U, then A is a right ideal of S.

Corollary 8 . —

For any nonempty subset A of  S, the following are equivalent.

  1. A is a two-sided ideal of  S.

  2. The characteristic soft set (χ A, S) over  U  is an int-soft two-sided ideal over  U.

Theorem 9 . —

A soft set (α, S) over  U is an int-soft semigroup over U if and only if the nonempty γ-inclusive set of (α, S) is a subsemigroup of  S for all γU.

Proof —

Assume that (α, S) over U is an int-soft semigroup over U. Let γU be such that i S(α; γ) ≠ . Let x, yi S(α; γ). Then α(x)⊇γ and α(y)⊇γ. It follows from (5) that

    α(xy)α(x)α(y)γ, (13)

so that xyi S(α; γ). Thus i S(α; γ) is a subsemigroup of S.

Conversely, suppose that the nonempty γ-inclusive set of (α, S) is a subsemigroup of S for all γU. Let x, yS be such that α(x) = γ x and α(y) = γ y. Taking γ = γ xγ y implies that x, yi S(α; γ). Hence xyi S(α; γ), and so α(xy)⊇γ = γ xγ y = α(x)∩α(y). Therefore (α, S) is an int-soft semigroup over U.

Theorem 10 . —

A soft set (α, S) over U is an int-soft left (resp., right) ideal over U if and only if the nonempty γ-inclusive set of  (α, S) is a left (resp., right) ideal of  S for all γU.

Proof —

It is the same as the proof of Theorem 9.

Corollary 11 . —

A soft set (α, S) over  U is an int-soft two-sided ideal over U if and only if the nonempty γ-inclusive set of  (α, S) is a two-sided ideal of  S for all γU.

For any soft sets (α, S) and (β, S) over U, we define

(α,S)~(β,S)ifα(x)β(x)xS. (14)

The soft union of (α, S) and (β, S) is defined to be the soft set (α  ~  β,S) over U in which α  ~  β is defined by

    (α~β)(x)=α(x)β(x)xS. (15)

The soft intersection of (α, S) and (β, S) is defined to be the soft set (α  ~  β,S) over U in which α  ~  β is defined by

    (α~β)(x)=α(x)β(x)xS. (16)

The int-soft product of (α, S) and (β, S) is defined to be the soft set (α~β,S) over U in which α~β is a mapping from S to P(U) given by

(α~β)(x)={x=yz{α(y)β(z)},ify,zSsuch  that  x=yz,,otherwise.   (17)

Proposition 12 . —

Let  (α 1, S), (α 2, S), (β 1, S), and  (β 2, S) be soft sets over U. If

(α1,S)~(β1,S),(α2,S)  ~  (β2,S), (18)

then (α1~  α2,S)  ~  (β1~β2,S).

Proof —

Let xS. If x is not expressed as x = yz for y, zS, then clearly

(α1~α2,S)  ~  (β1~  β2,S). (19)

Suppose that there exist y, zS such that x = yz. Then

(α1~  α2)(x)=x=yz{α1(y)α2(z)}x=yz{β1(y)β2(z)}=(β1~  β2)(x). (20)

Therefore (α1~  α2,S)  ~  (β1~  β2,S).

Lemma 13 . —

Let (χ A, S) and (χ B, S) be characteristic soft sets over  U where A and B are nonempty subsets of  S. Then the following properties hold:

  1. χA  ~  χB=χAB,

  2. χA~χB=χAB.

Proof —

(1) Let xS. If xAB, then xA and xB. Thus we have

(χA~χB)(x)=χA(x)χB(x)=U=χAB(x). (21)

If xAB, then xA or xB. Hence we have

(χA~χB)(x)=χA(x)χB(x)==χAB(x). (22)

Therefore χA  ~  χB=χAB.

(2) For any xS, suppose xAB. Then there exist aA and bB such that x = ab. Thus we have

(χA~χB)(x)=x=yz{χA(y)χB(z)}χA(a)χB(b)=U, (23)

and so (χA~χB)(x)=U. Since xAB, we get χ AB(x) = U. Suppose xAB. Then xab for all aA and bB. If x = yz for some y, zS, then yA or zB. Hence

(χA~χB)(x)=x=yz{χA(y)χB(z)}==χAB(x). (24)

If xyz for all x, yS, then

(χA~χB)(x)==χAB(x). (25)

In any case, we have χA~χB=χAB.

Theorem 14 . —

A soft set (α, S) over U is an int-soft semigroup over U if and only if (α~α,S)  ~  (α,S).

Proof —

Assume that (α~α,S)  ~  (α,S) and let x, yS. Then

    α(xy)(α~α)(xy)α(x)α(y), (26)

and so (α, S) is an int-soft semigroup over U.

Conversely, suppose that (α, S) is an int-soft semigroup over U. Then α(x)⊇α(y)∩α(z) for all xS with x = yz. Thus

    α(x)x=yz{α(y)α(z)}=(α~α)(x) (27)

for all xS. Hence (α~α,S)  ~  (α,S).

Theorem 15 . —

For the identity soft set (χ S, S) and a soft set (β, S) over  U, the following are equivalent:

  1. (β, S) is an int-soft left ideal over U,

  2. (χS~β,S)  ~  (β,S).

Proof —

Suppose that (β, S) is an int-soft left ideal over U. Let xS. If x = yz for some y, zS, then

(χS~β)(x)=x=yz{χS(y)β(z)}x=yz{Uβ(yz)}=β(x). (28)

Otherwise, we have (χS~β)(x)=β(x). Therefore (χS~β,S)  ~  (β,S).

Conversely, assume that (χS~β,S)  ~  (β,S). For any x, yS, we have

β(xy)(χS~β)(xy)χS(x)β(y)=Uβ(y)=β(y). (29)

Hence (β, S) is an int-soft left ideal over U.

Similarly, we have the following theorem.

Theorem 16 . —

For the identity soft set (χ S, S) over U and a soft set (β, S) over U, the following assertions are equivalent:

  1. (β, S) is an int-soft right ideal over U,

  2. (β~χS,S)  ~  (β,S).

Corollary 17 . —

For the identity soft set (χ S, S) over U and a soft set (β, S) over U, the following assertions are equivalent:

  1. (β, S) is an int-soft two-sided ideal over U,

  2. (χS~β,S)  ~  (β,S) and (β~χS,S)  ~  (β,S).

Theorem 18 . —

If (α, S) and (β, S) are int-soft semigroups over  U, then so is the soft intersection (α~β,S).

Proof —

Let x, yS. Then

(α~β)(xy)=α(xy)β(xy)(α(x)α(y))(β(x)β(y))    =(α(x)β(x))(α(y)β(y))  =(α~β)(x)(α~β)(y). (30)

Thus (α~β,S) is an int-soft semigroup over U.

By similar manner, we can prove the following theorem.

Theorem 19 . —

If  (α, S) and (β, S) are int-soft left ideals (resp., int-soft right ideals) over U, then so is the soft intersection (α~β,S).

Corollary 20 . —

If  (α, S) and (β, S) are int-soft two-sided ideals over U, then so is the soft intersection (α~β,S).

Theorem 21 . —

Let  (α, S) and (β, S) be soft sets over U. If (α, S) is an int-soft left ideal over U, then so is the int-soft product (α~β,S).

Proof —

Let  x, yS. If y = ab for some a, bS, then xy = x(ab) = (xa)b and

(α~β)(y)=y=ab{α(a)β(b)}xy=(xa)b{α(xa)β(b)}xy=cb{α(c)β(b)}=(α~β)(xy). (31)

If y is not expressible as y = ab for a, bS, then (α~β)(y)=(α~β)(xy). Thus (α~β)(y)(α~β)(xy) for all x, yS, and so (α~β,S) is an int-soft left ideal over U.

Similarly, we have the following theorem.

Theorem 22 . —

Let (α, S) and  (β, S) be soft sets over U. If (β, S) is an int-soft right ideal over U, then so is the int-soft product (α~β,S).

Corollary 23 . —

The int-soft product of two int-soft two-sided ideals over U is an int-soft two-sided ideal over U.

Let (α, S) be a soft set over U. For a subset γ of U with i S(α; γ) ≠ , define a soft set (α*, S) over U by

α:SP(U),x{α(x),ifxiS(α;γ),δ,otherwise, (32)

where δ is a subset of U with δα(x).

Theorem 24 . —

If  (α, S) is an int-soft semigroup over U, then so is (α*, S).

Proof —

Let x, yS. If  x, yi S(α; γ), then xyi S(α; γ) since i S(α; γ) is a subsemigroup of S by Theorem 9. Hence we have

    α(xy)=α(xy)α(x)α(y)=α(x)α(y). (33)

If  xi S(α; γ) or yi S(α; γ), then α*(x) = δ or α*(y) = δ. Thus

    α(xy)δ=α(x)α(y). (34)

Therefore (α*, S) is an int-soft semigroup over U.

By similar manner, we can prove the following theorem.

Theorem 25 . —

If  (α, S) is an int-soft left ideal (resp., int-soft right ideal) over U, then so is (α*, S).

Corollary 26 . —

If  (α, S) is an int-soft two-sided ideal over U, then so is (α*, S).

Theorem 27 . —

If  (α, S) is an int-soft right ideal over U and (β, S) is an int-soft left ideal over U, then (α~β,S)  ~  (α  ~  β,S).

Proof —

Let xS. If x is not expressible as x = ab for a, bS, then (α~β)(x)=(α  ~  β)(x). Assume that there exist a, bS such that x = ab. Then

(α~β)(x)=x=ab{α(a)β(b)}x=ab{α(ab)β(ab)}=α(x)β(x)=(α~β)(x). (35)

In any case, we have (α~β,S)  ~  (α  ~  β,S).

If we strengthen the condition of the semigroup S, then we can induce the reverse inclusion in Theorem 27 as follows.

Theorem 28 . —

Let S be a regular semigroup. If  (α, S) is an int-soft right ideal over  U, then (α  ~  β,S)  ~  (α~β,S) for every soft set (β, S) over  U.

Proof —

Let xS. Then there exists aS such that xax = x since S is regular. Thus

    (α~β)(x)=x=yz{α(y)β(z)}. (36)

On the other hand, we have

    (α~β)(x)=α(x)β(x)α(xa)β(x) (37)

since (α, S) is an int-soft right ideal over U. Since xax = x, we obtain

    α(xa)β(x)x=yz{α(y)β(z)}=(α~β)(x). (38)

Therefore (α~β)(x)(α~β)(x), and so (α~β,S)~(α~β,S).

In a similar way we prove the following.

Theorem 29 . —

Let S be a regular semigroup. If  (β, S) is an int-soft left ideal over  U, then (α~β,S)  ~  (α~β,S) for every soft set (α, S) over  U.

Theorem 30 . —

If a semigroup S is regular, then (α  ~  β,S)=(α~β,S) for every int-soft right ideal (α, S) and int-soft left ideal (β, S) over  U.

Proof —

Assume that S is a regular semigroup and let (α, S) and (β, S) be an int-soft right ideal and an int-soft left ideal, respectively, over U. By Theorem 28, we have (α  ~  β,S)  ~  (α~β,S). Since (α~β,S)  ~  (α  ~  β,S) by Theorem 27, we have (α  ~  β,S)=(α~β,S).

Definition 31 . —

A soft set (α, S) over U is called an int-soft quasi-ideal over U if

    (α~χS,S)~(χS~  α,S)~(α,S). (39)

Obviously, every int-soft left (resp., right) ideal is an int-soft quasi-ideal over U, but the converse does not hold in general.

In fact, we have the following example.

Example 32 . —

Let S = {0, a, b, c} be a semigroup with the following Cayley table:

graphic file with name TSWJ2014-136424.e003.jpg (40)

Let (α, S) be a soft set over U defined as follows:

α:SP(U),x{γ,ifx{0,a},,ifx{b,c}, (41)

where γ is a subset of U. Then (α, S) is an int-soft quasi-ideal over U and is not an int-soft left (resp., right) ideal over U.

Theorem 33 . —

Let G be a nonempty subset of  S. Then G is a quasi-ideal of S if and only if the characteristic soft set (χ G, S) is an int-soft quasi-ideal over  U.

Proof —

We first assume that G is a quasi-ideal of S. Let a be any element of S. If aG, then

    ((χG~χS)~(χS~χG))(a)~U=χG(a). (42)

If aG, then χ G(a) = . On the other hand, assume that

    ((χG~χS)~(χS~χG))(a)=U. (43)

Then

    a=xy{χG(x)χS(y)}=(χG~χS)(a)=U,    a=xy{χS(x)χG(y)}=(χS~χG)(a)=U. (44)

This implies that there exist elements b, c, d, and e of S with a = bc = de such that χ G(b) = U and χ G(e) = U. Hence a = bc = deGSSGG, which contradicts that aG. Thus we have (χG~χS,S)  ~  (χS~χG,S)  ~  (χG,S) and so (χ G, S) is an int-soft quasi-ideal over U.

Conversely, suppose that (χ G, S) is an int-soft quasi-ideal over U. Let a be any element of GSSG. Then bx = a = yc for some b, cG and x, yS. It follows from (39) that

χG(a)((χG~χS)~(χS~χG))(a)=(χG~χS)(a)(χS~χG)(a)=(a=uv{χG(u)χS(v)})(a=uv{χS(u)χG(v)})=(a=uv{χG(u)})(a=uv{χG(v)})=U (45)

and so aG. Thus GSSGG, and hence G is a quasi-ideal of S.

Theorem 34 . —

For a semigroup S, the following are equivalent:

  1. S is regular,

  2. (α,S)=(α~χS~α,S) for every int-soft quasi-ideal (α, S) over  U.

Proof —

Assume that S is regular and let aS. Then a = a xa for some xS. Hence

(α~χS~α)(a)=a=uv{(α~χS)(u)α(v)}(α~χS)(ax)α(a)=(ax=cd{α(c)χS(d)})α(a)=(ax=cd{α(c)})α(a)=α(a), (46)

and so (α,S)  ~  (α~χS~α,S). On the other hand, since (α, S) is an int-soft quasi-ideal over U,

    (α~χS~α,S)~(α~χS,S)~(χS~α,S)~(α,S). (47)

Hence (α,S)=(α~χS~α,S).

Conversely, suppose that (2) is valid and let A be a quasi-ideal of S. Then A SAASSAA and (χ A, S) is an int-soft quasi-ideal over U. For any aA, we have

a=yz{(χA~χS)(y)χA(z)}=((χA~χS)~χA)(a)=χA(a)=U. (48)

This implies that there exist b, cS such that a=bc,(χA~χS)(b)=U and χ A(c) = U. Then

    U=(χA~χS)(b)=b=pq{χA(p)χS(q)}, (49)

and so b = st,  χ A(s) = U = χ S(t) for some s, tS. It follows that c, sA and tS so that a = bc = (st)cA SA. Hence AA SA, and thus A = A SA. Therefore S is regular.

Acknowledgment

The authors are grateful to the referee for valuable suggestions and help.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  • 1.Molodtsov D. Soft set theory—first results. Computers and Mathematics with Applications. 1999;37(4-5):19–31. [Google Scholar]
  • 2.Maji PK, Roy AR, Biswas R. An application of soft sets in a decision making problem. Computers and Mathematics with Applications. 2002;44(8-9):1077–1083. [Google Scholar]
  • 3.Maji PK, Biswas R, Roy AR. Soft set theory. Computers and Mathematics with Applications. 2003;45(4-5):555–562. [Google Scholar]
  • 4.Çağman N, Enginoğlu S. FP-soft set theory and its applications. Annals of Fuzzy Mathematics and Informatics. 2011;2:219–226. [Google Scholar]
  • 5.Çağman N, Enginoğlu S. Soft set theory and uni-int decision making. European Journal of Operational Research. 2010;207(2):848–855. [Google Scholar]
  • 6.Feng F, Li YM, Çağman N. Generalized uni-int decision making schemes based on choice value soft sets. European Journal of Operational Research. 2012;220(1):162–170. [Google Scholar]
  • 7.Feng F, Li YM, Leoreanu-Fotea V. Application of level soft sets in decision making based on interval-valued fuzzy soft sets. Computers and Mathematics with Applications. 2010;60(6):1756–1767. [Google Scholar]
  • 8.Roy AR, Maji PK. A fuzzy soft set theoretic approach to decision making problems. Journal of Computational and Applied Mathematics. 2007;203(2):412–418. [Google Scholar]
  • 9.Feng F, Li YM. Soft subsets and soft product operations. Information Sciences. 2013;232:44–57. [Google Scholar]
  • 10.Feng F. Soft rough sets applied to multicriteria group decision making. Annals of Fuzzy Mathematics and Informatics. 2011;2:69–80. [Google Scholar]
  • 11.Aktaş H, Çağman N. Soft sets and soft groups. Information Sciences. 2007;177(13):2726–2735. [Google Scholar]
  • 12.Acar U, Koyuncu F, Tanay B. Soft sets and soft rings. Computers and Mathematics with Applications. 2010;59(11):3458–3463. [Google Scholar]
  • 13.Akram M, Feng F. Soft intersection Lie algebras. Quasigroups and Related Systems. 2013;21(1):1–10. [Google Scholar]
  • 14.Alshehri NO, Akram M, Al-Ghamdi RS. Applications of soft sets in K-algebras. Advances in Fuzzy Systems. 2013;2013:8 pages.319542 [Google Scholar]
  • 15.Atagün AO, Sezgin A. Soft substructures of rings, fields and modules. Computers and Mathematics with Applications. 2011;61(3):592–601. [Google Scholar]
  • 16.Feng F, Ali MI, Shabir M. Soft relations applied to semigroups. Filomat. 2013;27:1183–1196. [Google Scholar]
  • 17.Feng F, Jun YB, Zhao X. Soft semirings. Computers and Mathematics with Applications. 2008;56(10):2621–2628. [Google Scholar]
  • 18.Jun YB. Soft BCK/BCI-algebras. Computers and Mathematics with Applications. 2008;56(5):1408–1413. [Google Scholar]
  • 19.Jun YB, Kim HS, Neggers J. Pseudo d-algebras. Information Sciences. 2009;179(11):1751–1759. [Google Scholar]
  • 20.Jun YB, Lee KJ, Khan A. Soft ordered semigroups. Mathematical Logic Quarterly. 2010;56(1):42–50. [Google Scholar]
  • 21.Jun YB, Lee KJ, Park CH. Soft set theory applied to ideals in d-algebras. Computers and Mathematics with Applications. 2009;57(3):367–378. [Google Scholar]
  • 22.Jun YB, Lee KJ, Zhan J. Soft p-ideals of soft BCI-algebras. Computers and Mathematics with Applications. 2009;58(10):2060–2068. [Google Scholar]
  • 23.Jun YB, Park CH. Applications of soft sets in ideal theory of BCK/BCI-algebras. Information Sciences. 2008;178(11):2466–2475. [Google Scholar]
  • 24.Park CH, Jun YB, Öztürk MA. Soft WS-algebras. Communications of the Korean Mathematical Society. 2008;23:313–324. [Google Scholar]
  • 25.Zhan J, Çağman N, Singin A. Applications of soft union sets to hemirings via SU-h-ideals. Journal of Intelligent and Fuzzy Systems. 2014;26(3):1363–1370. [Google Scholar]
  • 26.Zhan J, Jun YB. Soft BL-algebras based on fuzzy sets. Computers and Mathematics with Applications. 2010;59(6):2037–2046. [Google Scholar]
  • 27.Feng F, Liu XY, Leoreanu-Fotea V, Jun YB. Soft sets and soft rough sets. Information Sciences. 2011;181(6):1125–1137. [Google Scholar]
  • 28.Jun YB, Lee KJ, Roh EH. Intersectional soft BCK/BCI-ideals. Annals of Fuzzy Mathematics and Informatics. 2012;4(1):1–7. [Google Scholar]

Articles from The Scientific World Journal are provided here courtesy of Wiley

RESOURCES