1. Introduction
Fuzzy set theory was launched in 1965 by Zadeh [
1] as a generalization of the theory of classical sets. In a classical set, an element is either a member of the set or it is not a member of it, whereas in a fuzzy set, the membership of an element is a real number of the closed unit interval. So, in a fuzzy set, the sum of degree of belongingness of an element with its degree of non-belongingness is equal to one. Soon after their launch, fuzzy sets became an object of extensions by themselves. In 1983, Atanassov [
2] generalized fuzzy sets to intuitionistic fuzzy sets (IFS). An IFS has two non-negative functions: the membership function and the non-membership function in a way that the sum of the degree of membership of an element with its degree of non-membership is in the unit real interval. Both fuzzy sets and intuitionistic fuzzy sets have their own restrictions related to the functions of membership and non-membership. To eliminate these restrictions by using reference parameters, Riaz and Hashmi [
3] in 2019 found a new extension of fuzzy sets and called it
linear Diophantine fuzzy sets (
). Using the corresponding reference parameters to the membership and non-membership fuzzy relations, S. Ayub et al. [
4] established a robust fusion of
s and binary relations and introduced linear Diophantine fuzzy relations.
Imai and Iséki [
5,
6] introduced
-algebras in 1966 as an extension of the principles of set-theoretic difference and propositional calculus. Later, detailed study on the theory of
-algebras was published, with specific focus appearing to be placed on the ideal theory of
-algebras. For example, Khalid and Ahmad [
7] studied
h-ideals of BCI-algebras and Muhiuddin et al. [
8,
9] studied hybrid ideals of
-algebras.
In 1971, Rosenfeld [
10] studied the first connection between the theories of algebraic structures and fuzzy sets. He introduced the concepts of fuzzy subgroups of a group. Since then, fuzzy algebraic structures have been firmly established as a fruitful area of research. Fuzzification was applied to
-algebras. For example, Jun et al. [
11,
12] investigated soft ideals of
-algebras, Al-Masarwah and Ahmad [
13,
14] discussed multipolar fuzzy ideals of
-algebras. Some applications of BCK-algebras can be found, e.g., in [
15,
16]. For more related details, we refer to [
17,
18,
19,
20].
The connection between algebraic structures and linear Diophantine fuzzy sets was launched by Kamaci [
21] in 2021. He studied finite linear Diophantine fuzzy substructures of some algebraic structures such as groups, rings, and fields. In 2022, Al-Tahan et al. [
22] studied linear Diophantine fuzzy subpolygroups of a polygroup. Inspired by the recent work on linear Diophantine fuzzy substructures (subhyperstructures) and by the previous work related to fuzzy algebraic structures, our paper studies linear Diophantine fuzzy sets in
-algebras. The remainder of it is structured as follows. In
Section 2, we present basic definitions related to
-algebra and to LDFSs. In
Section 3, we define linear Diophantine fuzzy subalgebras and linear Diophantine fuzzy ideals in
BCK/BCI-algebras, present some examples, and investigate their properties. In
Section 4, we define the notion of
LDF commutative ideal of
BCK-algebras and study some connections between
LDF subalgebras,
LDF ideals and
LDF commutative ideals.
2. Preliminaries
In this section, we present some basic results and examples related to linear Diophantine fuzzy sets [
3,
4] and to
BCK/BCI-algebras [
23].
An algebra of type is said to be a BCI-algebra if , the following conditions hold:
,
,
,
) and .
If a -algebra satisfies the condition: , , then is a -algebra.
Every -algebra satisfies the following properties:
,
,
and ,
,
,
,
,
,
,
where ⇔ . Note that is a partially ordered set.
A subset of is said to be a of if and it is called an of Z if and implies . Furthermore, Z is called commutative ideal of if and , and implies .
Zadeh [
1], in 1965, introduced the fuzzy set as an extension of the crisp set. In 1983, Atanassov [
2] extended fuzzy set to intuitionistic fuzzy set. Recently, Riaz and Hashmi [
3] introduced linear Diophantine fuzzy set (
) as a new extension of fuzzy set. Due to the use of reference parameters in
, the proposed model of
has more efficiency and flexibility in comparison to other generalizations of the fuzzy set.
Definition 1 ([
1])
. Let E be a universal set, , and be a membership function. Then is a fuzzy set. Definition 2 ([
2])
. Let E be a universal set, , and be the membership and non-membership functions, respectively. Then is an intuitionistic fuzzy set. Here, for all . Definition 3 ([
3])
. Let E be a universal set, , are degrees of membership and non-membership respectively, and are reference parameters. The degrees satisfy and for all . Then a linear Diophantine fuzzy set () on E is described as follows. Example 1. Let be a universal set and define on as follows: , , , and . Then is an on .
Remark 1. A fuzzy set A on a universal set E with a membership function μ is a special case of linear Diophantine fuzzy set. This is easily seen asis an on E. Definition 4 ([
3])
. Let E be a universal set and be s on E. Then- (1)
The intersection of and is defined as - (2)
The union of and is defined as - (3)
is subset of , denoted by , if for all . i.e., , , , and for all ,
- (4)
if and ,
- (5)
The complement of is defined as
Here, “∨” and “∧” represent the maximum and minimum respectively.
Example 2. Let be a universal set and define the s on respectively as follows: Then the on is defined as follows:
and .
3. Linear Diophantine Fuzzy Ideals
In this section, linear Diophantine fuzzy subalgebras and linear Diophantine fuzzy ideals in BCK/BCI-algebras are described and characterized.
Definition 5. A of is called a LDF subalgebra (briefly, LDFSub) if :
- (L1)
- (L2)
,
- (L3)
- (L4)
Example 3. Consider a -algebra defined by Table 1: Now define a LDFS on as: It is straightforward to show that is a LDFSub of .
Lemma 1. If is a LDFSub of , then Proof. Let
. Then we have
and
Therefore, . □
Definition 6. A LDFS of is called a LDF ideal () if , the following conditions hold.
- (L5)
and ,
- (L6)
- (L7)
Example 4. Consider a -algebra defined by Table 2: Now define a LDFS on as: It is easy to show that is a LDFI of .
Lemma 2. Let be a LDFI of and such that . Then Proof. Let
such that
. Then we have
and
Therefore, □
Lemma 3. Let be a LDFI of and such that . Then Proof. Let
such that
. Then we have
and
Therefore, □
Theorem 1. Every LDFI of BCK-algebra is a LDFSub of .
Proof. Let
be any
LDFI of
and
. Since
, it follows that
in
. Lemma 2 asserts that
and
. Thus, we have
and
Therefore, is a LDFSub of . □
Remark 2. The converse of Theorem 1 is not true in general. See Example 5.
Example 5. Consider a -algebra with Table 3: Now define a LDFS on as: It is easy to verify that is a LDFSub of but it is not a LDFI of because .
Theorem 2. Let be a LDFSub of . Then is a LDFI ⇔ such that implies and .
Proof. (⇒) Follows from Lemma 3.
(⇐) Let be a LDFSub of such that , implies and . As , so by hypothesis Moreover, Lemma 1 asserts that ∀. Therefore, is a LDFI of . □
4. Linear Diophantine Fuzzy Commutative Ideals
In this section, we define the notion of LDF commutative ideal of BCK-algebras. Moreover, we study some connections between LDF subalgebras, LDF ideals, and LDF commutative ideals.
In this section, will stand for a BCK-algebra unless it is otherwise specified.
Definition 7. A LDFS is called a LDF commutative ideal LDFCI if it satisfies and the following conditions :
- (L8)
and ,
- (L9)
and
Example 6. Consider a -algebra of Example 3. Now define a LDFS on as: Some computations show that is a LDFCI of .
Theorem 3. Every LDFCI of BCK-algebra is a LDFI of .
Proof. Let
be any
LDFCI of
and
. Having
a
-algebra implies that
and hence,
. Then we obtain
and
Therefore, is a LDFI of . □
Corollary 1. Every LDFCI of is a LDFSub of .
Proof. The proof follows from Theorems 1 and 3. □
Remark 3. In general, the converse of Theorem 3 does not hold. See Example 7.
Example 7. Consider a -algebra defined by Table 4: Now define a LDFS on as: It is easy to verify that is a LDFI of but it is not a LDFCI of because .
Theorem 4. Let be a LDFI of . Then is a LDFCI ⇔, Proof. (⇒) Let
be a
LDFCI of
. Then
, we have
,
,
and
Taking
, so
and
(⇐) Let
be a
LDFI such that
,
. By assumption, we have
and
Therefore, is a LDFCI of . □
Theorem 5. Every LDFI of a commutative BCK-algebra is a LDFCI.
Proof. Let
be a
LDFS of
. Then
, we have
It follows that . As is a LDFI of , so by Lemma 3, and . Hence, is a LDFCI of . □