1. Introduction
Fuzzy sets can be considered as an expansion and ridiculous misrepresentation of the classical sets presented by Zadeh [
1]. They tend to be best grasped with regard to set participation. Intuitionistic fuzzy sets have been presented by Atanassov [
2]. In arithmetic, BCI and BCK algebras are mathematical designs in general variable-based math, which were presented by Imai et al. [
3] in 1966; they portray fragments of propositional math including suggestions known as BCI and BCK algebras. Neggers et al. [
4] presented and explored a class of algebras which is connected with a few classes of algebras of interest, such as BCI/BCI/BCK-algebras, and which appear to have rather pleasant properties without being unnecessarily convoluted in any case.
Kim et al. [
5] presented another idea, called a BG-algebra, which is a speculation of B-algebra. Zarandi et al. [
6] considered the intuitionistic fuzzification of the idea of subalgebras and ideals in BG-algebras and explored a portion of their properties. Senapati et al. [
7] researched a few properties of the intuitionistic fuzzy ideals of BG-algebras. Ahn et al. [
8] arranged the subalgebras by the group of the level subalgebras in BG-algebras. Another kind of fuzzy subgroup was presented by Bhakat et al. [
9] utilizing the consolidated thoughts of “belongings” and the “quasi-coincidence” of fuzzy points. Summing up, the possibility of the quasi-coincident of a fuzzy point with a fuzzy subset was presented by Jun in [
10]. Basnet et al. [
11,
12] defined the 
-fuzzy ideal of a BG/d-algebra and investigated quite a few of its useful properties.
Molodstov [
13] developed the thought of soft sets in 1999 as an innovative mathematical mechanism for allocating with an ambiguity specifically devoid of the problems that are sure to plague the traditional theoretical approach. Maji et al. [
14,
15] worked on the theoretical study of intuitionistic fuzzy soft sets in detail. Balamurugan et al. (see, e.g., [
16,
17,
18]) introduced anti-intuitionistic fuzzy soft ideals, 
-bipolar fuzzy b-ideals of BG/BCK/BCI-algebras. Muhiuddin et al. (see, for e.g., [
19,
20]) introduced an m-polar fuzzy set theoretic approach to generalized ideals in BCK/BCI-algebras.
In this paper, we introduce the ideas of - of subtraction BG-algebra and investigate some of their usual properties. We introduce - and its some usual properties. In addition,  is an -. Moreover,  is an -, then  is an -. Finally, we characterize -, which is a generalization of -.
This manuscript frequently uses the following symbols and their meanings, which we present in the following, 
Table 1.
  3. -Uni-Intuitionistic Fuzzy Soft Subalgebras
Definition 10. An  is said to belong to (respectively, be quasi-coincident with) an  written as  if  or  and  or .
 Definition 11. An  is an - of  if  implies  and  implies , for all  and .
 Definition 12. An  is said to belong to (respectively, be quasi-coincident with) an  written as  (respectively, ) if  or  and  or . If  or , then .
 Definition 13. An  is an - of  if  implies  and  implies , for all  and .
 Definition 14. An  is an - if it satisfies the following conditions:
;
.
 Theorem 1.  is an  iff  is an -.
 Proof.  Let  be an . Then
 and .
Let  and  s.t , wherever . Then , and . Now  and . Therefore,  is an -.
Conversely, let 
 be an 
-
. To verify that 
 is an 
, let 
, 
 and 
. Then 
 implies 
. Therefore, 
,            i.e., 
. Therefore,
        
Again, let 
 and 
, 
. Then 
, 
 implies 
. Thus, 
, i.e., 
. Therefore,
        
Hence, (
1) and (
2) 
 is an 
.    □
 Definition 15. An  is an - of  if  implies  and  implies , for all  and .
 Theorem 2. Every - is an -.
 Proof.  Let  be a -. Let  and  such that . Then  implies  and . Thus,  and , i.e.,  and .
Since  is an -, we have 
.
Again, let  and  such that . Then  implies , and . Thus,  and , i.e.,  and .
Since  is an -, we have
.
Hence, (
3) and (
4) 
 is an 
-
.    □
 The following example shows the converse of Theorem 2 may not be true.
Example 3. Consider a subtraction BG-algebra  with the following Cayley Table 4: Define  by| − | 0 |  |  |  | 
|  | 0.52 | 0.52 | 0.56 | 0.56 | 
|  | 0.41 | 0.41 | 0.34 | 0.34 | 
 Then -, but it is not a -. As, if , , then , and , but 
 Theorem 3. An  is an - if and only if
(i) ;
(ii) ;
for all  and .
 Proof.  (i) First, let  be an -.
Case 1: Let . Then . If possible, let . Choose  as a real number such that . Therefore, . Therefore, . However,  implies  and . Then . Thus, , which fails due to the fact that  is an -. Therefore, .
Case 2: Let . Then . If possible, . Then  and . Therefore, . However, ; therefore,  and , which again fails due to the fact that  is an -. Hence, .
Converse Part:
Let 
 and 
 such that 
. Then 
 and 
. Therefore, 
. By (
5), 
, let 
. Then 
 implies 
. Therefore,
        
Again, let 
. Then 
 implies 
. Thus, 
. Therefore,
        
From Equations (
6) and (
7), we have
        
Therefore,  is an -.
 First, let  be an -.
Case 1: Let . Then . If possible, let . Then let  be a real number such that . Thus, . Therefore, . However, . Then  and . Thus, . Thus, , which fails due to the fact that  is an -. Therefore, .
Case 2: Let . Then . If possible, , then  and . Therefore, . However, . Then  and , which again fails due to the fact that  is an -. Hence, .
Converse Part:
Then 
 and 
. Therefore, 
. By (
9), 
. Let 
. Then 
. Thus, 
. Therefore,
        
Again, let 
. Then 
. Therefore, 
, i.e., 
. Therefore,
        
From (
10) and (
11), we have
        
Therefore, 
 is an 
-
. Hence, (
8) and (
12) 
 is an 
-
.    □
 Theorem 4. An  is an -, and if , then  is also an -.
 Proof.  Let 
 be an 
-
 of 
 and 
 and 
. Let 
. Then 
 and 
. Therefore, 
. In addition, 
. Thus, 
. Since 
 is an 
-
, we have either 
. Thus, 
. Therefore,
        
Thus,  is -.
Again, let 
. Then 
 and 
. Therefore, 
 and also 
. Thus, 
. Since 
 is an 
-
, we have either 
 or 
. Thus, 
. Therefore,
        
Thus, 
 is 
-
. Hence, (
13) and (
14) 
 is an 
-
.    □
 Definition 16. Let  be an  of  and . Then let , , , where , , and  is -level set, -level set, and -level set of . Clearly, , and , , , where , , and  is  are the -level set, -level set, and -level set of . Clearly, 
 Theorem 5. An  is an - if and only if the sets  and  are subalgebras of .
 Proof.  Suppose  is an -. Then . Let  and  s.t  where . Then . Using Theorem, , . Thus,  i.e., . Therefore, . Hence,  is a subalgebra of .
Next, let  and  such that  where . Then . Using Theorem , . Thus, , i.e., . Therefore, . Hence,  is a subalgebra of .
Conversely, 
 is an 
 and 
 where 
 and 
 where 
 are subalgebras of 
. To prove 
 is an 
-
, suppose 
 is not an 
-
, there exists 
 s.t at least one of 
 and 
 hold. Suppose 
 holds. Let 
. Then 
 and
        
Therefore, . So, , i.e., .
Thus, 
, which contradicts (
15). Hence,
        
Next, let 
 hold. Let 
 Then 
 and
        
Therefore, 
. Thus, 
, i.e., 
. Therefore, 
, which contradicts (
17). Hence,
        
Hence, (
16) and (
18) 
 is an 
-
.    □
   4. Homomorphism of -Uni-Intuitionistic Fuzzy Soft Ideals
Definition 17. Let  and  be two subtraction BG-algebras. Then  is said to be a homomorphism if , for all 
 Definition 18. A  of  is an - of  if  and , for all  and .
 Definition 19. An  is an - if it fulfils the succeeding conditions:
(i) .
(ii) .
 Theorem 6. Let  be a homomorphism and  be two subtraction BG-algebras. If  is an -, then  is an -.
 Proof.  Let  be defined as . Let  be an - of  and let  s.t . Then  and .
Case 1: Let 
 and 
 and 
 and 
 and 
 or 
 or 
 or 
.
Case 2: Let 
 and 
 and 
 and 
 and 
 or 
 or 
 or 
.
Hence (
19) and (
20) 
 is an 
-
.    □
 Theorem 7. Let  be an onto homomorphism and  be two subtraction BG-algebras. If  is an  s.t  is an -, then  is an -.
 Proof.  Let  and  s.t .  and . Therefore, ,  and . Since h is onto, there exists  s.t , .
Let 
. Then 
 and 
 imply 
 and 
. Thus, 
 and 
, i.e., 
. It follows that 
 or 
 imply 
 or 
. Thus, 
 or 
, i.e., 
. Therefore,
        
Let 
. Then 
 and 
 imply 
 and 
. Thus, 
 and 
, i.e., 
. It follows that 
 or 
 imply 
 or 
. Thus, 
 or 
, i.e., 
. Therefore,
        
Hence, (
21) and (
22) 
 is also an 
-
.    □
   5. -Uni-Intuitionistic Fuzzy Soft h-Ideals
Definition 20. An  is said to belong to (respectively, be quasi-coincident with) an  written as  (respectively, ) if  or  and  or . If  or , then .
 Definition 21. An  is an - if it satisfies the following conditions:
(i) ;
(ii) ,
for every  and .
 Definition 22. An  is an - if it satisfies the following conditions:
(i) ;
(ii) ,
for every  and .
 Theorem 8. An  is an - if and only if it satisfies:
(i) ;
(ii) ;
for any , and .
 Proof.  (i) First, let  be an -.
Case 1: Let . Then . If possible, let . Then let  be a real number such that . Thus, , for some , i.e., . However, . Then  and . Thus, , i.e., . Therefore, . Hence, , which contradicts the fact that  is an - of . Therefore, .
Case 2: Let . Then . If possible, let . Then , and . So, . However, . Then  implies . Hence, , which again fails due to the fact that  is an -. Therefore, .
Converse part:
Let 
 and 
 s.t 
. Then 
 and 
. Therefore, 
. By (
23), we have 
.
Let 
. Then 
. Therefore, 
.
        
Next, let 
. Then 
. Therefore, 
. Thus, 
.
        
From (
24) and (
25), we have
        
Therefore,  is an -.
(ii) First, let  be an -.
Case 1: Let . Then . If possible, let . Then let  be a real number such that . Thus, , for some , i.e., . However, . Then  and . Thus, , i.e., . Therefore, . Hence, , which contradicts the fact that  is an -. Therefore, .
Case 2: Let . Then . If possible, let . Then  and . Thus, . However, . Then , i.e., . Hence, , which contradicts the fact that  is an -. Therefore, .
Converse part:
Let 
 and 
 s.t 
. Then 
 and 
. Therefore, 
. By (
27), we have 
. Now, let 
. Then 
. Thus, 
,
        
Next, let 
, 
. Then 
. Thus, 
,
        
From (
28) and (
29), we have
        
Therefore, 
 is an 
-
. Hence, (
26) and (
30) 
 is an 
-
.
□
 An - is always an - of , but not conversely, which can be seen from the following example.
Example 4. Consider a subtraction BG-algebra  with the following Cayley Table 5: Define  by| − | 0 |  |  |  | 
|  | 0.41 | 0.29 | 0.41 | 0.41 | 
|  | 0.69 | 0.54 | 0.69 | 0.69 | 
 Then -, but it is not an -, since , but .
 Theorem 9. An  is an - and if , then  is also an -.
 Proof.  Let 
 be an 
-
. Then 
 and 
. Let 
. Then we have 
. Thus, 
, i.e., 
. Thus, 
. Since 
 is an 
-
, either 
. Thus, 
. Therefore,
        
Thus,  is -.
Again, let . Then we have  and .
Thus, 
, i.e., 
. Thus, 
. Since 
 is an 
-
, either 
. Thus, 
. Therefore,
        
Thus, 
 is 
-
. Hence, (
31) and (
32) 
 is also an 
-
.    □
 Theorem 10. Let  be an  if and only if  is a h-ideal of  for all .
 Proof.  Suppose that  is an -.
(i) Let 
 and 
. Then 
 and 
. It follows from (
23) that 
. Thus, 
. Thus, 
 is an h-ideal of 
.
Conversely, suppose that 
 is an h-ideal of 
, for all 
. If (
23) is not true, then there exist 
 and 
 such that 
. Hence, we can see that 
 such that 
. Then 
 and 
. In addition, 
 is an h-ideal of 
 which implies 
. Thus, 
, which is a contradiction. Therefore, (
23) is valid, and 
 is an 
-
 of 
.
(ii) Let 
. Then 
. It follows from (
27) that 
. Thus, 
. Thus 
 is an h-ideal of 
.
Conversely, suppose that 
 is an h-ideal of 
 for all 
. If (
23) is not true, then there exists 
 and 
 such that 
. Hence, we can see that 
 such that 
. Thus, 
 and 
. In addition, 
 is an h-ideal of 
 which implies that 
. Thus, 
, which is a contradiction. Therefore, (
27) is valid, and 
 is an 
-
 of 
.
□
 Theorem 11. Let  be an . Then  is an - if and only if , and  is an h-ideal of , for all . We call , and -level h-ideals of .
 Proof.  Suppose that  is an  -. To prove  and  is a h-ideal of , let , for . Then  implies  and . Thus,  is an -, i.e., , for any  and .
Now we have the following cases.
Case 1: Let  and let . Then . It follows that . Thus, , i.e., .
Next, let . Then . It follows that . Thus, , i.e., .
Case 2: Let  and let . Then . It follows that . So, , i.e., .
Next, let . Then . Thus, , i.e., . Hence, .
Case 3: Let  and let . Then . Thus, , i.e., .
Next, let . Then . Thus, , i.e., . Hence, .
Case 4:  and let . Then . Thus, , i.e., . Hence, .
Next, let . Then . Thus, , i.e., . Hence, . Therefore,  is an h-ideal of . Similarly, we can prove  is a h-ideal of .
Conversely, let  be an  s.t  and  is an h-ideal of  for all . To show  is an -. Suppose  is not an -. Then there exists  s.t at least one of  and  holds.
Suppose 
 holds, then select 
 s.t
        
Then 
 is an h-ideal. Therefore, 
, which contradicts (
33).
Next, let 
 hold, then select 
 s.t
        
Then 
 is an h-ideal. Therefore, 
, which contradicts (
34). Hence, 
 and 
. Thus, 
 is an 
-
.    □