Based on soft sets and 𝒩-structures, the notion of (closed) 𝒩-ideal over a BCI-algebra is introduced, and related properties are investigated. Relations between 𝒩-BCI-algebras and 𝒩-ideals are established. Characterizations of a (closed) 𝒩-ideal over a BCI-algebra are provided. Conditions for an 𝒩-ideal to be an 𝒩-BCI-algebra are considered.

1. Introduction

To solve complicated problems in economics, engineering, and environment, we cannot successfully use classical methods because of various uncertainties typical for those problems. There are three theories: theory of probability, theory of fuzzy sets, and the interval mathematics which we can consider as mathematical tools for dealing with uncertainties. But all these theories have their own difficulties. Uncertainties cannot be handled using traditional mathematical tools but may be dealt with using a wide range of existing theories such as the probability theory, the theory of (intuitionistic) fuzzy sets, the theory of vague sets, the theory of interval mathematics, and the theory of rough sets. However, all of these theories have their own difficulties which are pointed out in [1]. Maji et al. [2] and Molodtsov [1] suggested that one reason for these difficulties may be due to the inadequacy of the parametrization tool of the theory. To overcome these difficulties, Molodtsov [1] introduced the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. Molodtsov pointed out several directions for the applications of soft sets. At present, works on the 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. Chen et al. [4] presented a new definition of soft set parametrization reduction and compared this definition to the related concept of attributes reduction in rough set theory. The algebraic structure of set theories dealing with uncertainties has been studied by some authors. The most appropriate theory for dealing with uncertainties is the theory of fuzzy sets developed by Zadeh [5]. Roy and Maji [6] presented some results on an application of fuzzy soft sets in decision making problem. Feng et al. [7] provided a framework to combine fuzzy sets, rough sets, and soft sets all together, which gives rise to several interesting new concepts such as rough soft sets, soft rough sets, and soft rough fuzzy sets. Feng et al. [8] gave deeper insights into decision making based on fuzzy soft sets. Feng et al. [9] initiated the notion of soft rough sets, which can be seen as a generalized rough set model based on soft sets. Aygünoğlu et al. [10] introduced the notion of fuzzy soft group and studied its properties. Ali et al. [11] discussed new operations in soft set theory. Jun [12] applied the notion of soft set to BCK/BCI-algebras, and Jun et al. [13] considered applications of soft set theory in the ideals of d-algebras. Han et al. [14] discussed the fuzzy set theory of fated filters in R₀-algebras based on fuzzy points.

A (crisp) set A in a universe X can be defined in the form of its characteristic function μ_A : X → {0,1} yielding the value 1 for elements belonging to the set A and the value 0 for elements excluded from the set A. So far most of the generalizations of the crisp set have been conducted on the unit interval [0,1] and they are consistent with the asymmetry observation. In other words, the generalization of the crisp set to fuzzy sets relied on spreading positive information that fits the crisp point {1} into the interval [0,1]. Because no negative meaning of information is suggested, we now feel a need to deal with negative information. To do so, we also feel a need to supply mathematical tool. To attain such object, Jun et al. [15] introduced a new function, which is called negative-valued function, and constructed 𝒩-structures. They applied 𝒩-structures to BCK/BCI-algebras and discussed 𝒩-subalgebras and 𝒩-ideals in BCK/BCI-algebras. Jun et al. [16] considered closed ideals in BCH-algebras based on 𝒩-structures. Jun et al. [17] introduced the notion of 𝒩-soft sets which are a soft set based on 𝒩-structures, and then they applied it to both a decision-making problem and a BCK/BCI-algebra.

In this paper, we introduce the notion of (closed) 𝒩-ideal over a BCI-algebra based on soft sets and 𝒩-structures and investigate related properties. We establish relations between 𝒩-BCI-algebras and 𝒩-ideals. We also provide characterizations of a (closed) 𝒩-ideal over a BCI-algebra and consider conditions for an 𝒩-ideal to be an 𝒩-BCI-algebra.

2. Preliminaries

Let K(τ) be the class of all algebras of type τ = (2,0). An element X ∈ K(τ) is called a BCI-algebra if it satisfies the following axioms:

(a1)
((x*y)*(x*z))*(z*y) = 0,
(a2)
(x*(x*y))*y = 0,
(a3)
x*x = 0,
(a4)
x*y = y*x = 0⇒x = y

for all x, y, z ∈ X. If a BCI-algebra X satisfies

(a5)
0*x = 0 for all x ∈ X,

then we say that X is a BCK-algebra.

We can define a partial ordering ≤ on X by

(2.1)

In a BCK/BCI-algebra X, the following hold:

(b1)
x*0 = x,
(b2)
(x*y)*z = (x*z)*y,
(b3)
0*(0*(0*x)) = 0*x,
(b4)
0*(x*y) = (0*x)*(0*y)

for all x, y, z ∈ X.

A nonempty subset S of a BCK/BCI-algebra X is called a subalgebra of X if x*y ∈ S for all x, y ∈ S. A subset A of a BCK/BCI-algebra X is called an ideal of X if it satisfies

(c1)
0 ∈ A,
(c2)
(∀x, y ∈ X) (x*y ∈ A, y ∈ A⇒x ∈ A).

We refer the reader to the books [18, 19] for further information regarding BCK/BCI-algebras.

Denote by ℱ(X, [−1,0]) the collection of functions from a set X to [−1,0]. We say that an element of ℱ(X, [−1,0]) is a negative-valued function from X to [−1,0] (briefly, 𝒩-function on X). By an 𝒩-structure we mean an ordered pair (X, f) of X and an 𝒩-function f on X.

Definition 2.1 (see [15].)By a subalgebra of a BCK/BCI-algebra X based on 𝒩-function f (briefly, 𝒩-subalgebra of X) are means an 𝒩-structure (X, f) in which f satisfies the following assertion:

(2.2)

Definition 2.2 (see [15].)By an ideal of a BCK/BCI-algebra X based on 𝒩-function f (briefly, 𝒩-ideal of X) are means an 𝒩-structure (X, f) in which f satisfies the following assertion:

(2.3)

Definition 2.3 (see [15].)Let X be a BCI-algebra. An 𝒩-ideal (X, f) is said to be closed if it is also an 𝒩-subalgebra of X.

3. 𝒩-Soft BCK/BCI-Algebras and 𝒩-Soft Ideals

In what follows let E denote a set of attributes unless otherwise specified. We will use the terminology “soft machine” which means that it produces a BCK/BCI-algebra.

Definition 3.1 (see [17].)Let X be an initial universe set and E a set of attributes. By an 𝒩-soft set over X we mean a pair (f, A) where A ⊂ E and f is a mapping from A to ℱ(X, [−1,0]); that is, for each a ∈ A, f(a): = f_a is an 𝒩-function on X.

Denote by 𝒩(X, E) the collection of all 𝒩-soft sets over X with attributes from E, and we call it an 𝒩-soft class.

Definition 3.2 (see [17].)Let (f, A) and (g, B) be 𝒩-soft sets in 𝒩(X, E). Then (f, A) is called an 𝒩-soft subset of (g, B), denoted by , if it satisfies

(i)
A⊆B,
(ii)
(∀e ∈ A) (f_e⊆g_e, i.e., f_e(x) ≤ g_e(x) ∀ x ∈ X).

Definition 3.3 (see [17].)Let (f, A) be an 𝒩-soft set over a BCK/BCI-algebra X where A is a subset of E. If there exists an attribute u ∈ A for which the 𝒩-structure (X, f_u) is an 𝒩-subalgebra of X, then we say that (f, A) is an 𝒩-soft BCK/BCI-algebra related to the attribute u (briefly, N_u-soft BCK/BCI-algebra). If (f, A) is an 𝒩_u-soft BCK/BCI-algebra for all u ∈ A, we say that (f, A) is an 𝒩-soft BCK/BCI-algebra.

Definition 3.4. Let (f, A) be an 𝒩-soft set over a BCK/BCI-algebra X where A is a subset of E. If there exists an attribute u ∈ A for which the 𝒩-structure (X, f_u) is an 𝒩-ideal of X, then we say that (f, A) is an 𝒩-soft ideal of X related to the attribute u (briefly, 𝒩_u-soft ideal). If (f, A) is an 𝒩_u-soft ideal of X for all u ∈ A, we say that (f, A) is an 𝒩-soft ideal of X.

Example 3.5. Let U : = {apple, banana, carrot, peach, radish} be a universe, and consider a soft machine $ which produces the following products:

(3.1)

Then U is a BCK-algebra under the soft machine $. Consider a set of attributes

(3.2)

and let (f, A) be an 𝒩-soft set over the BCK-algebra U with the tabular representation which is given by Table 1. Then f_cat, f_cow, f_dog, f_duck, and f_fig are 𝒩-soft ideals over U. But f_hourse is not an 𝒩-soft ideal over U since

(3.3)

In general, we know that horses like carrots best of all. In the above example, we know that (f, A) is not an 𝒩-soft ideal over U based on attribute “horse.” This means that if a horse like a carrot better than the others, then (f, A) cannot be an 𝒩-soft ideal over U.

Table 1. Tabular representation of (f, A).

(f, A)	Apple	Banana	Carrot	Peach	Radish
Cat	−0.5	−0.3	−0.3	−0.3	−0.3
Cow	−0.6	−0.4	−0.6	−0.4	−0.4
Dog	−0.7	−0.7	−0.2	−0.2	−0.7
Duck	−0.3	−0.1	−0.3	−0.1	−0.1
Horse	−0.4	−0.4	−0.9	−0.6	−0.3
Pig	−0.5	−0.4	−0.1	−0.1	−0.4

Obviously, every 𝒩-soft ideal is an 𝒩-soft BCK-algebra in a BCK-algebra, but the converse is not true as seen in the following example.

Example 3.6. Let

(3.4)

be a universe, and consider a soft machine ◊ which produces the following products:

(3.5)

Then U is a BCK-algebra under the soft machine ◊. Consider a set of parameters

(3.6)

Let (g, B) be an 𝒩-soft set over the BCK-algebra U with the tabular representation which is given by Table 2. It is easy to verify that (g, B) is an 𝒩-soft BCK-algebra. But it is not an 𝒩-soft ideal over U because (g, B) is not an 𝒩_horse-soft ideal since

(3.7)

We discuss characterizations of an 𝒩-soft ideal.

Table 2. Tabular representation of (g, B).

(g, B)	Apple	Banana	Carrot	Peach	Radish
Duck	−0.2	−0.2	−0.6	−0.4	−0.2
Horse	−0.4	−0.1	−0.5	−0.1	−0.1
Pig	−0.3	−0.3	−0.7	−0.6	−0.5

Theorem 3.7. For a BCK/BCI-algebra X, let (f, A) be an 𝒩-soft set in (X, E) such that f_u(0) ≤ f_u(x) for all x ∈ X and u ∈ A. Then (f, A) is an 𝒩-soft ideal of X if and only if the following assertion is valid:

(3.8)

Proof. Suppose that (f, A) is an 𝒩-soft ideal of X. Let u ∈ A and x, y, z ∈ X be such that x*y ≤ z. Then (x*y)*z = 0, and so

(3.9)

It follows that f_u(x) ≤ ⋁{f_u(x*y), f_u(y)} ≤ ⋁{f_u(z), f_u(y)}.

Conversely, assume that (3.8) holds. Note that x*(x*y) ≤ y for all x, y ∈ X. It follows from (3.8) that

(3.10)

for all x, y ∈ X and u ∈ A. Hence (f, A) is an 𝒩_u-soft ideal of X for all u ∈ A, and so (f, A) is an 𝒩-soft ideal of X.

Lemma 3.8 (see [17].)Every 𝒩-soft BCK/BCI-algebra (f, A) over a BCK/BCI-algebra X satisfies the following inequality:

(3.11)

Theorem 3.9. Let (f, A) be an 𝒩-BCK/BCI-algebra of a BCK/BCI-algebra X. Then (f, A) is an 𝒩-soft ideal of X if and only if it satisfies (3.8).

Proof. Necessity is by Theorem 3.7. Conversely, assume that assertion (3.8) is valid. Since x*(x*y) ≤ y for all x, y ∈ X, it follows that f_u(x) ≤ ⋁{f_u(x*y), f_u(y)} for all x, y ∈ X and u ∈ A. Combining this and Lemma 3.8, we know that (f, A) is an 𝒩-soft ideal of X.

Proposition 3.10. Every 𝒩-soft ideal (f, A) of a BCI-algebra X satisfies the following inequality:

(3.12)

Proof. Let (f, A) be an 𝒩-soft ideal of a BCI-algebra X. Then

(3.13)

for all x ∈ X and u ∈ A.

The following example shows that there exists an attribute u ∈ A such that an 𝒩_u-soft ideal of a BCI-algebra may not be an 𝒩_u-soft BCI-algebra.

Example 3.11. Let U = ℚ − {0} be a universe where ℚ is the set of all rational numbers. Let ★ be a soft machine which is established by

(3.14)

Then U is a BCI-algebra under the soft machine ★. Let (f, A) be an 𝒩-soft set in 𝒩(U, E) which is defined by

(3.15)

Then (f, A) is an 𝒩-soft ideal over U, but it is not an 𝒩-soft BCI-algebra over U since

(3.16)

Definition 3.12. Let (f, A) be an 𝒩-soft set over a BCI-algebra X, where A is a subset of E. If there exists an attribute u ∈ A for which the 𝒩-structure (X, f_u) is a closed 𝒩-ideal of X, then we say that (f, A) is a closed 𝒩-soft ideal over X related to the attribute u (briefly, closed 𝒩_u-soft ideal). If (f, A) is a closed 𝒩_u-soft ideal over X for all u ∈ A, we say that (f, A) is a closed 𝒩-soft ideal over X.

Example 3.13. Suppose there are five colors in the universe U, that is,

(3.17)

Let ⊎ be a soft machine to mix two colors according to order in such a way that we have the following results:

(3.18)

Then U is a BCI-algebra under the soft machine ⊎. Consider a set of attributes

(3.19)

and let (f, A) be an 𝒩-soft set over U with the tabular representation which is given by Table 3. Then (f, A) is a closed 𝒩-soft ideal over U.

Table 3. Tabular representation of (f, A).

(f, A)	White	Blackish	Reddish	Green	Yellow
Beautiful	−0.9	−0.6	−0.4	−0.3	−0.3
Fine	−0.6	−0.4	−0.6	−0.5	−0.4
Moderate	−0.7	−0.3	−0.5	−0.4	−0.3

Theorem 3.14. A closed 𝒩-soft ideal of a BCI-algebra X related to an attribute is an 𝒩-soft BCI-algebra over X related to the same attribute.

Proof. Let (f, A) be a closed 𝒩-soft ideal over a BCI-algebra X related to an attribute u ∈ A. Then f_u(0*x) ≤ f_u(x) for all x ∈ X. It follows that

(3.20)

for all x, y ∈ X. Hence (f, A) is an 𝒩_u-soft BCI-algebra over X.

We provide a characterization of a closed 𝒩-soft ideal.

Theorem 3.15. For an 𝒩-soft ideal (f, A) over a BCI-algebra X, the following are equivalent:

(1)
(f, A) is closed,
(2)
(f, A) is an 𝒩-soft BCI-algebra over X.

Proof. (1) ⇒ (2). It follows from Theorem 3.14.

(2) ⇒ (1). Suppose that (f, A) is an 𝒩-soft BCI-algebra over X. Then f_u(0) ≤ f_u(x) for all x ∈ X and u ∈ A, and so

(3.21)

Thus (f, A) is a closed 𝒩_u-soft ideal over X for all u ∈ A, and therefore (f, A) is a closed 𝒩-soft ideal over X.

We consider a condition for an 𝒩-soft ideal to be closed.

Theorem 3.16. Given an attribute u ∈ A, if an 𝒩_u-soft ideal (f, A) over a BCI-algebra X satisfies the following assertion:

(3.22)

then (f, A) is a closed 𝒩_u-soft ideal over X.

Proof. For all x, y ∈ X, we have (x*y)*x = 0*y. Hence

(3.23)

Thus (f, A) is an 𝒩_u-soft BCI-algebra over X. It follows from Theorem 3.15 that (f, A) is a closed 𝒩_u-soft ideal over X.

Corollary 3.17. If an 𝒩-soft ideal (f, A) over a BCI-algebra X satisfies the following assertion:

(3.24)

then (f, A) is a closed 𝒩-soft ideal over X.

Definition 3.18 (see [17].)Let (f, A) and (g, B) be two 𝒩-soft sets in (X, E). The union of (f, A) and (g, B) is defined to be the 𝒩-soft set (h, C) in (X, E) satisfying the following conditions:

(i)
C = A ∪ B,
(ii)
for all x ∈ C,
(3.25)
In this case, we write .

Lemma 3.19 (see [15].)If (X, f) and (X, g) are 𝒩-ideals of a BCK/BCI -algebra X, then the union (X, f ∪ g) of (X, f) and (X, g) is an 𝒩-ideal of X.

Theorem 3.20. If (f, A) and (g, B) are 𝒩-soft ideals over a BCK/BCI-algebra X, then the union of (f, A) and (g, B) is an 𝒩-soft ideal over X.

Proof. Let be the union of (f, A) and (g, B). Then C = A ∪ B. For any x ∈ C, if x ∈ A∖B (resp., x ∈ B∖A), then (X, h_x) = (X, f_x) (resp., (X, h_x) = (X, g_x)) is an 𝒩-ideal of X. If A∩B ≠ ∅, then (X, h_x) = (X, f_x ∪ g_x) is an 𝒩-ideal of X for all x ∈ A∩B by Lemma 3.19. Therefore (h, C) is an 𝒩-soft ideal over a BCK/BCI-algebra X.

Definition 3.21 (see [17].)Let (f, A) and (g, B) be two 𝒩-soft sets in (X, E). The intersection of (f, A) and (g, B) is the 𝒩-soft set (h, C) in (X, E), where C = A ∪ B and for every x ∈ C,

(3.26)

In this case, we write .

Theorem 3.22. Let (f, A) and (g, B) be 𝒩-soft ideals over a BCK/BCI-algebra X. If A and B are disjoint, then the intersection of (f, A) and (g, B) is an 𝒩-soft ideal over X.

Proof. Let be the intersection of (f, A) and (g, B). Then C = A ∪ B. Since A∩B = ∅, if x ∈ C, then either x ∈ A∖B or x ∈ B∖A. If x ∈ A∖B, then (X, h_x) = (X, f_x) is an 𝒩-ideal of X. If x ∈ B∖A, then (X, h_x) = (X, g_x) is an 𝒩-ideal of X. Hence (h, C) is an 𝒩-soft ideal over a BCK/BCI-algebra X.

The following example shows that Theorem 3.22 is not valid if A and B are not disjoint.

Example 3.23. Let U be an initial universe set that consists of “white,” “blackish,” “reddish,” “green” and “yellow.” Consider a soft machine “¥’’ which produces the following products:

(3.27)

Then U is a BCI-algebra under the soft machine ¥. Consider sets of attributes:

(3.28)

Let (f, A) and (g, B) be 𝒩-soft sets over U with the tabular representations which are given by Tables 4 and 5, respectively. Then (f, A) and (g, B) are 𝒩-soft ideals over U. But we have

(3.29)

and so

is not an 𝒩-soft ideal over U.

Table 4. Tabular representation of (f, A).

(f, A)	White	Blackish	Reddish	Green	Yellow
Beautiful	−0.8	−0.6	−0.5	−0.4	−0.4
Fine	−0.7	−0.6	−0.3	−0.5	−0.3
Smart	−0.9	−0.8	−0.2	−0.2	−0.6

Table 5. Tabular representation of (g, B).

(g, B)	White	Blackish	Reddish	Green	Yellow
Smart	−0.8	−0.7	−0.5	−0.6	−0.5
Chaste	−0.6	−0.5	−0.1	−0.1	−0.3

4. Conclusions

We have introduced the notion of (closed) 𝒩-ideal over a BCI-algebra based on soft sets and 𝒩-structures. We have investigated several properties and established relations between 𝒩-BCI-algebras and 𝒩-ideals. We have provided characterizations of a (closed) 𝒩-ideal over a BCI-algebra and considered conditions for an 𝒩-ideal to be an 𝒩-BCI-algebra. Based on these results, we will apply the 𝒩-structure to the other type of ideals/filters in BCK/BCI-algebras, MV-algebras, MTL-algebras, R₀-algebras BL-algebras, and so forth, in the future study.

Acknowledgment

The authors wish to thank the anonymous reviewers for their valuable suggestions.

References

1 Molodtsov D., Soft set theory—first results, Computers & Mathematics with Applications. (1999) 37, no. 4-5, 19–31, https://doi.org/10.1016/S0898-1221(99)00056-5, 1677178, ZBL0936.03049.
10.1016/S0898-1221(99)00056-5
Web of Science® Google Scholar
2 Maji P. K., Roy A. R., and Biswas R., An application of soft sets in a decision making problem, Computers & Mathematics with Applications. (2002) 44, no. 8-9, 1077–1083, https://doi.org/10.1016/S0898-1221(02)00216-X, 1937568, ZBL1044.90042.
10.1016/S0898-1221(02)00216-X
Web of Science® Google Scholar
3 Maji P. K., Biswas R., and Roy A. R., Soft set theory, Computers & Mathematics with Applications. (2003) 45, no. 4-5, 555–562, https://doi.org/10.1016/S0898-1221(03)00016-6, 1968545, ZBL1032.03525.
10.1016/S0898-1221(03)00016-6
Web of Science® Google Scholar
4 Chen D., Tsang E. C. C., Yeung D. S., and Wang X., The parameterization reduction of soft sets and its applications, Computers & Mathematics with Applications. (2005) 49, no. 5-6, 757–763, https://doi.org/10.1016/j.camwa.2004.10.036, 2135211, ZBL1074.03510.
10.1016/j.camwa.2004.10.036
Web of Science® Google Scholar
5 Zadeh L. A., Fuzzy sets, Information and Computation. (1965) 8, 338–353, 0219427, ZBL0139.24606.
Google Scholar
6 Roy A. R. and Maji P. K., A fuzzy soft set theoretic approach to decision making problems, Journal of Computational and Applied Mathematics. (2007) 203, 412–418, https://doi.org/10.1016/j.cam.2006.04.008, ZBL1128.90536.
10.1016/j.cam.2006.04.008
Web of Science® Google Scholar
7 Feng F., Li C., Davvaz B., and Ali M. I., Soft sets combined with fuzzy sets and rough sets: a tentative approach, Soft Computing. (2010) 14, 899–911, https://doi.org/10.1007/s00500-009-0465-6, ZBL1201.03046.
10.1007/s00500-009-0465-6
Web of Science® Google Scholar
8 Feng F., Jun Y. B., Liu X., and Li L., An adjustable approach to fuzzy soft set based decision making, Journal of Computational and Applied Mathematics. (2010) 234, no. 1, 10–20, https://doi.org/10.1016/j.cam.2009.11.055, 2601279.
10.1016/j.cam.2009.11.055
Web of Science® Google Scholar
9 Feng F., Liu X., Leoreanu-Fotea V., and Jun Y. B., Soft sets and soft rough sets, Information Sciences. (2011) 181, no. 6, 1125–1137, https://doi.org/10.1016/j.ins.2010.11.004, 2765314, ZBL1211.68436.
10.1016/j.ins.2010.11.004
Web of Science® Google Scholar
10 Aygünoğlu A. and Aygün H., Introduction to fuzzy soft groups, Computers & Mathematics with Applications. (2009) 58, no. 6, 1279–1286, https://doi.org/10.1016/j.camwa.2009.07.047, 2554361.
10.1016/j.camwa.2009.07.047
Web of Science® Google Scholar
11 Ali M. I., Feng F., Liu X., Min W. K., and Shabir M., On some new operations in soft set theory, Computers & Mathematics with Applications. (2009) 57, no. 9, 1547–1553, https://doi.org/10.1016/j.camwa.2008.11.009, 2509967, ZBL1186.03068.
10.1016/j.camwa.2008.11.009
Web of Science® Google Scholar
12 Jun Y. B., Soft BCK/BCI-algebras, Computers & Mathematics with Applications. (2008) 56, no. 5, 1408–1413, https://doi.org/10.1016/j.camwa.2008.02.035, 2437308, ZBL1184.06014.
10.1016/j.camwa.2008.02.035
Web of Science® Google Scholar
13 Jun Y. B., Lee K. J., and Park C. H., Soft set theory applied to ideals in d-algebras, Computers & Mathematics with Applications. (2009) 57, no. 3, 367–378, https://doi.org/10.1016/j.camwa.2008.11.002, 2488608.
10.1016/j.camwa.2008.11.002
Web of Science® Google Scholar
14 Han J. S., Jun Y. B., and Kim H. S., Fuzzy-fated filters of R₀-algebras, Discrete Dynamics in Nature and Society. (2011) 2011, 19, 980315, 2830769.
10.1155/2011/980315
Web of Science® Google Scholar
15 Jun Y. B., Lee K. J., and Song S. Z., 𝒩-ideals of BCK/BCI-algebras, Journal of Chungcheong Mathematical Society. (2009) 22, 417–437.
Google Scholar
16 Jun Y. B., Öztürk M. A., and Roh E. H., 𝒩-structures applied to closed ideals in BCH-algebras, International Journal of Mathematics and Mathematical Sciences. (2010) 2010, 9, 943565, 2600890, ZBL1186.06011.
10.1155/2010/943565
Google Scholar
17 Jun Y. B., Song S. Z., and Lee K. J., The combination of soft sets and 𝒩-structures with applications, Computers & Mathematics with Applications. In press.
Google Scholar
18 Huang Y. S., BCI-Algebra, 2006, Science Press, Beijing, China.
Google Scholar
19 Meng J. and Jun Y. B., BCK-Algebras, 1994, Kyung Moon Sa Co., Seoul, Republic of Korea, 1297121.
Google Scholar

Citing Literature

All articles

Ideal Theory in BCK/BCI-Algebras Based on Soft Sets and 𝒩-Structures

Abstract

1. Introduction

2. Preliminaries

3. 𝒩-Soft BCK/BCI-Algebras and 𝒩-Soft Ideals

4. Conclusions

Acknowledgment

References

Citing Literature

References

Information

About Wiley Online Library

Help & Support

Opportunities

Connect with Wiley

Ideal Theory in BCK/BCI-Algebras Based on Soft Sets and 𝒩-Structures

Abstract

1. Introduction

2. Preliminaries

3. 𝒩-Soft BCK/BCI-Algebras and 𝒩-Soft Ideals

4. Conclusions

Acknowledgment

References

Citing Literature

References

Related

Information