1. Introduction
Imai and Iseki presented the BCK- and BCI-algebra ideas in 1966 [
1,
2]. BCK-algebra and BCI-algebra are mathematical plans of the BCK and BCI frameworks in combinatory logic. Various articles on the hypothesis of “BCK/BCI-algebras” have been distributed from that point forward, with an emphasis on the “BCK/BCI ideals”.
Neggers and Kim [
3] originally introduced the concept of B-algebra by extending the notion of a BCK-/BCI-algebras. Jun et al. presented BH-algebra, which is a development of B-algebra, in [
4]. BG-algebra was considered by Kim and Kim [
5]. They also presented the concept of BN-algebra [
6] and provided some equivalent conditions related to BN-algebra. Hwang et al. defined BV-algebra and showed that it is logically equivalent to BT-algebra, BM-algebra, 0-commutative B-algebra, and BV-algebra in [
7]. The term BP-algebra was created by Ahn and Han [
8], who also demonstrated that the quadratic BP-algebra is identical to multiple quadratic algebras. Andrzej Walendziak [
9] developed the concept of BF-algebra, as well as the concepts of ideals and normal ideals of BF-algebras.
In 1934, Marty [
10] created the theory of a hyperstructure and provided a description of a hypergroup. A set in an algebraic hyperstructure is formed by multiplying two elements, whereas an element in a classical algebraic structure is formed by multiplying two elements. Several authors later investigated hyperstructure in various algebraic structures, such as hyperfields [
11], n-ary semihypergroups [
12], ordered semihypergroups [
13], Γ-semihypergroups [
14], etc. More hyperstructure theories are studied in [
15,
16,
17,
18,
19,
20,
21,
22,
23].
In Reference [
24], Jun et al. applied a hyperstructure to BCK algebra and introduced the concept of hyper-BCK algebra, which is the generalization of BCK algebra. They then applied the same methodology to BCC-algebra in [
25]. Muhiuddin et al., as well as other authors, adapted the hyperstructure theory to a variety of algebraic structures [
26,
27,
28,
29,
30,
31,
32,
33].
This article is organized as follows:
Section 2 presents the concepts that are essential to these findings. In
Section 3, we define hyper-BF-algebras and hyper-BF ideals, as well as provide theorems pertaining to these concepts. We extensively discuss some of their related properties and provide numerous examples to support these new ideas. As a generalization of other classes of hyper-BCK/BCI-algebras, we introduce brand-new concepts known as hyper-B-algebra, hyper-BG-algebra, and hyper-BH-algebra, and provide detailed examples of each. Additionally, in the case of hyper-BF-algebra, every hyper-BF ideal is a weak hyper-BF ideal, but the opposite is not true. Additionally, we demonstrate that the intersection of a family of weak hyper-BF ideals yields a weak hyper-BF ideal.
Section 4 concludes the investigation.
3. Hyper-BF-Algebras
In this section, we will discuss our main findings. For a hypergroupoid , we consider the following assertions for all :
- (c1)
- (c2)
- (c3)
- (c4)
and .
- (c5)
- (c6)
- (c7)
Now, in support of our new notions, we need to construct the following examples:
We define a hypergroupoid that satisfies (c1) and (c2).
Example 1. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1) and (c2). We define a hypergroupoid that satisfies (c1) and (c2), but not (c3).
Example 2. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1) and (c2), but not (c3). We define a hypergroupoid that satisfies (c1), (c2), and (c3).
Example 3. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1), (c2), and (c3). We define a hypergroupoid that satisfies (c1) and (c2), but not (c4).
Example 4. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1) and (c2), but not (c4). We define a hypergroupoid that satisfies (c1), (c2), and (c4).
Example 5. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1), (c2), and (c4). We define a hypergroupoid that satisfies (c1) and (c2), but not (c5).
Example 6. We define a hyperoperation “∘
” on by. Then is a hypergroupoid that satisfies (c1) and (c2), but not (c5). We define a hypergroupoid that satisfies (c1), (c2), and (c5).
Example 7. If is an algebra of , we can define the hyperoperation “∘” in 𝔉 and specify the . Then is a hypergroupoid that satisfies (c1), (c2), and (c5).
We define a hypergroupoid that satisfies (c1) and (c2), but not (c6).
Example 8. The hypergroupoid in Example 6 satisfies (c1) and (c2), but not (c6).
We define a hypergroupoid that satisfies (c1), (c2), and (c6).
Example 9. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1), (c2), and (c6). We define a hypergroupoid that satisfies (c1) and (c2), but not (c7).
Example 10. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1) and (c2), but not (c7). We define a hypergroupoid that satisfies (c1), (c2), and (c7).
Example 11. Let . Consider the following table:Then is a hypergroupoid that satisfies (c1), (c2), and (c7). Proposition 2. Suppose that 𝔉 is furnished with a hyperoperation denoted by “∘” and a fixed value of “0”.
If satisfies (c5), then is a singleton set .
If fulfills the equation then is a singleton set .
Proof. - (1).
Let
and
Then
and
. Thus,
It follows that , so that is a singleton set.
- (2).
By assumption, , . Let and Then and . Then . Thus, , . Hence, , is a singleton set.
□
Proposition 2 (1) shows that condition (c5) is not a proper condition in hyper-theory. Thus, we provide the following definition.
Definition 5. If “∘” is a hyperoperation and 0 is a constant in a set with conditions (c1), (c2), and (c7), then 𝔉 is known as the hyper-B-algebra related to the hyperorder ≪ (i.e., ≪-hyper-B-algebra).
Example 12. It is straightforward to verify that hypergroupoid in Example 1 is the hyper-B-algebra.
Definition 6. A set equipped with a hyperoperation “∘” and a constant “0” satisfying conditions (c1), (c2), (c3), and (c4) is known as a hyper-BH-algebra related to the hyperorder ≪ (i.e., ≪-hyper-BH-algebra).
Example 13. Hypergroupoid in Example 5 satisfies (c1), (c2), (c3), and (c4). Thus, it is a hyper-BH-algebra.
Definition 7. If “∘” is a hyperoperation and 0 is a constant in a set with conditions (c1), (c2), (c3), and (c6), then 𝔉 is known as a hyper-BG-algebra related to the hyperorder ≪ (i.e., ≪-hyper-BG-algebra).
Example 14. Hypergroupoid in Example 9 satisfies (c1), (c2), (c3), and (c6). Thus, it is a hyper-BG-algebra.
Definition 8. A set equipped with a hyperoperation “∘” and a constant “0”, satisfying conditions (c1), (c2), and (c3), is known as a hyper-BF-algebra related to the hyperorder ≪ (i.e., ≪-hyper-BF-algebra).
Example 15. Let . Consider the following table:Clearly, is a hypergroupoid. As 𝔉 satisfies (c1), (c2), and (c3), it is straightforward to show that it is a hyper-BF-algebra. Proposition 3. If 𝔉 is a ≪-hyper-BF-algebra, then
- (1)
- (2)
- (3)
- (4)
.
Proof. - (1).
By Definition of hyper-BF-algebras, Taking and , , by condition (c2).
- (2).
Assume that . By Proposition 3 (1) and the assumption, . Therefore, .
- (3).
Assume that . By condition (c3), the assumption, and condition (c2), . Henceforth, .
- (4).
, , by (c1), (c3), and (c2). Hence, .
□
Proposition 4. Let be a hyper-BF-algebra. For every we have the following assertions.
- (1)
- (2)
- (3)
- (4)
⟹
Proof. - (1).
By condition (c1), , . Then , such that . Hence, .
- (2).
By condition (c2),
, we have
- (3).
By condition (c3),
, we have
- (4).
Assume that . Then , such that , by condition (c1). Hence, .
□
Remark 1. The converse of Proposition 4 (4) is not true. In Example 11, let and . Then , but .
Proposition 5. Let be a hyper-BF-algebra with . Then is a singleton set.
Proof. Case 1. . By and (c2), , . Thus, is a singleton set.
Case 2. . Assume that , such that is not a singleton set. Then , such that , where . By Proposition 3, and . Since or , . Thus, is a singleton set.
Case 3. . If , then by (c2), . Thus, is a singleton set. If , then with and . Suppose that is not a singleton set. Then there exists , such that . By Proposition 3, and . If or , then is a singleton set. Therefore, or , because and . Without loss of generality, and . Then . Therefore, , which is a contradiction. Hence, is a singleton set. □
Proposition 6. If is a hyper-B-algebra, then is a hyper-BG-algebra.
Proof. Let
be a hyper-B-algebra. Then
,
by (c7), (c1), and (c2). Hence,
is a hyper-BG-algebra. □
Definition 9. A hyper-BF-algebra is called a hyper-BG-algebra (resp., a hyper-BH-algebra), if it satisfies (c6) (resp., (c4)).
Definition 10. Let represent a hyper-BF-algebra, and let S represent the subset of 𝔉 that includes the value 0. If S is a hyper-BF-algebra for the hyperoperation “” on 𝔉, it is a hyper-subalgebra of 𝔉.
Proposition 7. Let (hyper-BF-algebra) be such that for all . In this case, the element 0 belongs to S.
Proof. Let ( and ), . As , we have , as required. □
Proposition 8. Let (hyper-BF-algebra) be such that for all . In this case, element 0 belongs to S.
Proof. Let and . As , so , as required. □
Theorem 1. Let be a hyper-BF-algebra and . Then S is a hyper-subalgebra of .
Proof. is obvious.
Let
. Then
by Proposition 8. For any
, we have
. Hence,
and so (c3) is valid in
S. We may also show that axioms (c1) and (c2) are valid in
S. Thus,
S is a hyper-subalgebra of 𝔉. □
Example 16. - (1)
We define a hyperoperation “∘” on 𝔉 by , using as the BF-algebra. Then is a hyper-BF-algebra. If S is a subalgebra of a BF-algebra , then it is a hyper-subalgebra of .
- (2)
In Example 6, let be the hyper-BF-algebra, and let . Then S is a hyper-subalgebra.
- (3)
Let be the hyper-BF-algebra in Example 3, and and , respectively. Thus, is a hyper-subalgebra of 𝔉, but is not a hyper-subalgebra of 𝔉 because .
Definition 11. Let be a hyper-BF-algebra and . Then I is called a hyper-BF ideal of 𝔉 if:
- (HI1)
,
- (HI2)
and imply , .
Example 17. Let . Consider the following table:Clearly, is a hyper-BF-algebra. Verifying that the set is the hyper-BF ideal of 𝔉 is routine. Proposition 9. Let be a hyper-BF-algebra. Then I is a hyper-BF ideal ⇔
- (HFI1)
;
- (HFI2)
, , ;
- (HFI3)
(), , ), for some .
Proof. (⟹) Suppose that I is a hyper-BF ideal. Then trivially, (HFI1) holds. Moreover,
and
implies
. By contrapositive,
⇒
or
. Then
Since
, so
. It follows from (c2) that
. Therefore,
,
such that
. Then
. It follows that
,
such that
. Thus,
,
,
and, hence, (HFI2) holds. By (
1),
, such that
. Then
, by (c1). Therefore,
,
,
, for some
. Thus, (HFI3) holds.
(⟸) This is enough to show (
1). By (HFI3),
,
,
, for some
. Moreover, by (HFI2), we have
,
. Then
and
,
, such that
. It follows that
and
,
, such that
. Hence,
and
. □
Proposition 10. If is a family of hyper-BF ideals of a hyper-BF-algebra , then is a hyper-BF ideal of 𝔉.
Proof. Let . Clearly, . Assume that and . Then and . From (HI2), so that , ending the proof. □
Definition 12. Let be a hyper-BF-algebra and let . By the hyper-BF ideal generated by A, written , we mean the intersection of all hyper-BF ideals, which contain A.
Definition 13. Let be a hyper-BF-algebra and . Then I is called a weak hyper-BF ideal of 𝔉 if:
- (HI1)
,
- (WHI1)
and imply .
Example 18. - (1)
Let be the hyper-BF-algebra in Example 16 (1). Then every ideal I of a BF-algebra in Example 16 (1) is a weak hyper-BF ideal of 𝔉.
- (2)
Let be the hyper-BF-algebra in Example 16 (2) and let for every . Then I is a weak hyper-BF ideal of 𝔉.
- (3)
Let be the hyper-BF-algebra in Example 16 (3). Then and are weak hyper-BF ideals of 𝔉.
Theorem 2. Every hyper-BF ideal of hyper-BF-algebra is a weak hyper-BF ideal of 𝔉.
Proof. Assume that , and . Then , , and , by Proposition 4 (4). Then, by the definition of the hyper-BF ideal, we have and . □
Remark 2. In general, weak hyper-BF ideals of hyper-BF-algebra 𝔉 may not be hyper-BF ideals of 𝔉. The following illustration validates this statement.
Example 19. Let . Consider the following table:Clearly, is a hyper-BF-algebra. It is straightforward to verify that the set is a weak hyper-BF ideal but is not a hyper-BF ideal as Proposition 11. If is a class of weak hyper-BF ideals of a hyper-BF-algebra , then is a weak hyper-BF ideal of 𝔉.
Proof. Let . Clearly, . Assume that and . Then and . It follows from (WHI1) that so that , ending the proof. □