Next Article in Journal
Numerical Solution of Transition to Turbulence over Compressible Ramp at Hypersonic Velocity
Next Article in Special Issue
Comparative Sensitivity Analysis of Some Fuzzy AHP Methods
Previous Article in Journal
AI-Enabled Condition Monitoring Framework for Indoor Mobile Cleaning Robots
Previous Article in Special Issue
Fuzzy-Based Unified Decision-Making Technique to Evaluate Security Risks: A Healthcare Perspective
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Exploring Hybrid H-bi-Ideals in Hemirings: Characterizations and Applications in Decision Making

1
Department of Mathematics, Abdul Wali Khan University, Mardan 23200, Pakistan
2
Department of Statistics, Abdul Wali Khan University, Mardan 23200, Pakistan
3
Department of Marine Geology, Faulty of Marine Science, King Abdulaziz University, Jeddah 21551, Saudi Arabia
4
Mathematics and Computer Science Department, Faculty of Science, Beni-Suef University, Beni-Suef 62521, Egypt
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(17), 3683; https://doi.org/10.3390/math11173683
Submission received: 10 July 2023 / Revised: 1 August 2023 / Accepted: 19 August 2023 / Published: 26 August 2023
(This article belongs to the Special Issue Fuzzy Decision Making and Applications)

Abstract

:
The concept of the hybrid structure, as an extension of both soft sets and fuzzy sets, has gained significant attention in various mathematical and decision-making domains. In this paper, we delve into the realm of hemirings and investigate the properties of hybrid h-bi-ideals, including prime, strongly prime, semiprime, irreducible, and strongly irreducible ones. By employing these hybrid h-bi-ideals, we provide insightful characterizations of h-hemiregular and h-intra-hemiregular hemirings, offering a deeper understanding of their algebraic structures. Beyond theoretical implications, we demonstrate the practical value of hybrid structures and decision-making theory in handling real-world problems under imprecise environments. Using the proposed decision-making algorithm based on hybrid structures, we have successfully addressed a significant real-world problem, showcasing the efficacy of this approach in providing robust solutions.

1. Introduction

L. A. Zadeh in 1965 [1] initiated the concept of fuzzy sets, the best framework for addressing uncertainties and imprecise information. Fuzzy set is defined by its membership function, whose values are defined on the closed interval [0, 1]. This approach extends the generalized theory of uncertainty described in [2] to a broader context. Numerous works [3,4,5] are based on the idea of fuzzy set theory, its extensions, and applications.
Modelling uncertain data is a challenge for researchers in a variety of disciplines, including economics, engineering, environmental science, sociology, and medical science. Classical methods might not always be adequate to deal with uncertainties appearing in these domains. Although mathematical methods like rough sets [6], fuzzy sets [1], and other mathematical tools [7] are frequently employed to express uncertainty, Molodtsov [8] highlighted that each has its own challenges. Molodtsov offered a novel method to model ambiguity and uncertainty as a result [8]. Many researchers contributed to extending soft sets with fuzzy set theory [9,10,11]. Fuzzy soft sets are an extension introduced by Maji et al. [12] and provide a more flexible approach to handling uncertainty. Since then there has been a rapid growth of interest in soft sets and their various applications to algebraic systems [13,14,15,16,17,18,19,20], data analysis [21], and decision making under uncertainty [22,23,24,25,26].
Hemirings are thought of as a generalization of rings and refer to an additively commutative semiring with zero members. Ideals of hemirings play a significant part in the theories of algebraic structure. K-ideals are a special type of ideal, studied by Henriksen [27], while h-ideals are a more restrictive class of ideals, proposed by Iizuka [28]. H-ideals and k-ideals have been implemented in hemirings by [29]. The generalization of the theory of h-ideals is called fuzzy h-ideals of hemirings [30]. By utilizing the fuzzy h-ideals, Zhan et al. [31] explored the h-hemiregular hemirings. Furthermore, the concepts of fuzzy h-bi-ideals and fuzzy h-quasi-ideals of hemirings are extended in [32]. A prime h-bi-ideal [33] is an extension of h-bi-ideals that has an additional property (defined in Section 2). The concept of fuzzy prime h-bi-ideals [33] refers to a fuzzified variant of prime h-bi-ideals, where degrees of membership are used to define how much an element belongs to the fuzzy prime h-bi-ideal rather than strict inclusion.
Jun et al. [34] developed the idea of a hybrid structure as a parallel circuit of fuzzy sets and soft sets by integrating the notions of soft sets and fuzzy sets. In hybrid structures, fuzzy sets are utilized to represent negative membership, while set-valued mappings are employed to represent positive membership. Algebric structures, for example, BCK/BCI algebras and semigroups are studied in relation to the concept of the hybrid structure [35,36,37,38,39]. To deal with uncertainty and imprecision, hybrid structures are implemented in hemirings by incorporating the concepts of soft sets and fuzzy sets. In order to apply the hemiring framework, it is necessary to define operations that take into account both fuzzy and soft sets [40,41]. This enables a more thorough approach to knowledge representation, problem-solving, and decision-making in uncertain situations. Asmat et al. [41] assessed the hybrid structure in hemirings and investigated several properties of hybrid h-ideals, hybrid h-bi-ideals, and hybrid h-quasi-ideals. The characterizations of h-hemiregular hemirings are discussed and several important results of a h-hemiregular hemirings are provided. This paper proposes prime hybrid h-bi-ideals which is an extension of hybrid h-bi-ideals [41] and we aim to investigate various aspects of hemirings. Also, this work has conducted a characterization of certain classes of hemirings based on these prime hybrid h-bi-ideals. Furthermore, we illustrate the importance of the defined hybrid structure in the decision-making process with the help of examples from real-world situations to explore new directions in algebraic development and tackle practical problems with improved uncertainty-handling abilities by utilising hybrid structures in hemirings.
The arrangement of paper is given as follows. The basic concepts and preliminary results concerning hemirings and hybrid structures, which will be used throughout this paper, are provided in Section 2. Section 3 provides the concepts of prime (semiprime, strongly prime) hybrid h-bi-ideals and the characterization of some classes of hemings in terms of these hybrid h-bi-ideals has been carried out. In the final part of the paper, we present a hybrid structure-based decision-making algorithm and use it to solve a problem that exists in the real world.

2. Preliminaries

We give a concise overview of the fundamental ideas and concepts employed in  hemirings.
A nonempty set N with “∔” and “⋄” as binary operations on N is said to be a semiring if ( N , ) and ( N , ) are semigroups and the following laws
φ L ( φ M φ N ) = φ L φ M φ L φ N   and   ( φ L φ M ) φ N = φ L φ N φ M φ N
are satisfied for each φ L , φ M , φ N N ,
A member 0 of a semiring is said to be zero if and only if all of its members satisfy the conditions 0 φ P = φ P 0 = φ P and 0 φ P = φ P 0 = 0 . Hemirings are semirings ( N , , ) that contain zero members and are commutative with regard to addition “∔”.
The sum and product of k and R where k N and R N are provided in a hemiring ( N , , ) by
k R = { φ P φ Q : φ P k   and   φ Q R }
k R = { φ P φ Q : φ P k   and   φ Q R } .
When a subset Q of a hemiring N is closed under addition and multiplication while Q N Q Q , the subset is said to be a bi-ideal.
Let Q N , the set Q ¯ = { ϕ P N : ϕ P φ L ϕ R = φ M ϕ R for some φ L , φ M Q , ϕ R N } is referred to as h-closure of Q .
For a bi-ideal Q of a hemiring N , if ϕ P , ϕ R N , φ L , φ M Q and ϕ P φ L ϕ R = φ M ϕ R implies ϕ P Q then Q is said to be an h-bi-ideal (H-BI) of N .
An ideal Q in N satisfying Q = Q 2 ¯ is referred to as an h-idempotent ideal of a hemiring  N .
Proposition 1 
([33]). If k and R are the H-BI of a hemiring N , following that k R ¯ is an H-BI of N .
Definition 1 
([33]). If k R ¯ Q ( k 2 ¯ Q ) implies k Q or R Q ( k Q ) for all H-BI k and R of N , following that H-BI Q of a hemiring N is known as a prime (semiprime) H-BI of N .
Definition 2 
([33]). If k R ¯ R k ¯ Q indicating k Q or R Q for all H-BI k and R of a hemiring N then the H-BI Q of N is said to be strongly prime.
A hemiring N is h-hemiregular (H-HemiR) if there exists φ L , φ M , φ N N  satisfying ϕ P ϕ P φ L ϕ P φ N = ϕ P φ M ϕ P φ N for any ϕ P N .
If there exist φ A i , φ M j , φ B i , φ N j and ϕ R N such that ϕ P Σ m i = 1 φ A i ϕ P 2 φ B i ϕ R = Σ n j = 1 φ M j ϕ P 2 φ N j ϕ R , then a hemiring N is said to be h-intra-hemiregular (H-IHemiR) for each ϕ P N .
By a fuzzy subset L of a non-empty set N , we mean a mapping
L : N [ 0 , 1 ] , from a non-empty set N within [ 0 , 1 ] unit interval.
If L and F are fuzzy subsets of N then the fuzzy subsets L F a n d L F are defined as:
( L F ) ( ϕ P ) = L ( ϕ P ) F ( ϕ P ) and ( L F ) ( ϕ P ) = L ( ϕ P ) F ( ϕ P ) for all ϕ P N .
The term “soft set” ( £ , ¥ ) over C is a mapping of £ into the set of all subsets of C i.e.,  L : ¥ ( C ) , where C is the initial universe set, ¥ is a collection of attributes that the entities in C hold, and ( C ) is the power set of C .

Basic Operations of Hybrid Structures

Definition 3 
([34]). A hybrid structure (ḦyS) in a set of parameters Q over an initial universe set C is defined as:
Z 1 ˜ = ( ξ 1 z S , η 1 z F ) : Q ( C ) × I ,   ϕ P ξ 1 z S ( ϕ P ) , η 1 z F ( ϕ P )
where, ξ 1 z S : Q ( C ) and η 1 z F : Q I are mappings, ( C ) represents the set of all subsets of C and I = [ 0 , 1 ] .
Definition 4. 
Let us represent the set of all ḦyS in Q over C by H ( Q ) . Here, we define an order ˜ in H ( Q ) :
Z 1 ˜ , Z 2 ˜ H ( Q ) Z 1 ˜ ˜ Z 2 ˜ means ξ 1 z S ξ 2 z S and η 1 z F η 2 z F .
The hybrid intersection of two hybrid structures Z 1 ˜ and Z 2 ˜ in Q over C is defined as:
Z 1 ˜ ˜ Z 2 ˜ = { φ A , ξ 1 z S ξ 2 z S φ A , η 1 z F η 1 z F φ A ) : φ A Q .
Definition 5. 
The hybrid union of two hybrid structures Z 1 ˜ and Z 2 ˜ in Q over C is defined as:
Z 1 ˜ ˜ Z 2 ˜ = φ A , ξ 1 z S ξ 2 z S φ A , η 1 z F η 2 z F φ A : φ A Q .
The hybrid framework described by
= ξ S , η F   where   ξ S ( ϕ R ) = C   and   η F ( ϕ R ) = 0 ,   ϕ R N
is called identity hybrid mapping in Q over C .
Definition 6 
([41]). Let Z 1 ˜ and Z 2 ˜ be two ḦyS in Q over C . The hybrid h-sum Z 1 ˜    Z 2 ˜ is defined as:
Z 1 ˜ Z 2 ˜ = φ A , ξ 1 z S H ξ 2 z S φ A , η 1 z F + H η 2 z F ( φ A ) : φ A N
ξ 1 z S H ξ 2 z S φ A = φ A + φ M + φ N + φ Y = φ S + φ T + φ Y ξ 1 z S φ M ξ 2 z S φ N ξ 1 z S φ S ξ 2 z S φ T , η 1 z F + H η 2 z F ( φ A ) = φ A + φ M + φ N + φ Y = φ S + φ T + φ Y η 1 z F φ M η 2 z F φ N η 1 z F φ S η 2 z F φ T ,
Each φ A , φ M , φ N , φ S , φ T , φ Y N , where, the symbols for supremum and infimum are ⊎ and , respectively.
Definition 7. 
Let Z 1 ˜ and Z 2 ˜ be two ḦyS in a hemiring N over C .  The hybrid h-product Z 1 ˜    Z 2 ˜ is defined as
Z 1 ˜ Z 2 ˜ ( φ A ) = φ A , ξ 1 z S H ξ 2 z S φ A , η 1 z F H η 2 z F ( φ A ) : φ A N
which is concisely represented by Z 1 ˜    Z 2 ˇ = ξ 1 z S H ξ 2 z S , η 1 z F H η 2 z F , where, the definitions of ξ 1 z S H ξ 2 z S and η 1 z F H η 2 z F are given as:
ξ 1 z S H ξ 2 z S φ A = φ A + φ M φ N + φ Y = φ S φ T + φ Y ξ 1 z S φ M ξ 2 z S φ N ξ 1 z S φ S ξ 2 z S φ T if φ A is can be expressed as φ A + φ M φ N + φ Y = φ S φ T + φ Y alternatively
and
η 1 z F H η 2 z F φ A = φ A + φ M φ N + φ Y = φ S φ T + φ Y η 1 z F φ M η 2 z F φ N η 1 z F φ S η 2 z F φ T if φ A is can be expressed as φ A + φ M φ N + φ Y = φ S φ T + φ Y 1 alternatively
where, φ A , φ M , φ N , φ S , φ T , φ Y N .
Definition 8 
([41]). A hybrid h-bi-ideal (ḦyH-BI) in N upon C is defined to be a Z 1 ˜ = ( ξ 1 z S , η 1 z F ) if φ A , φ B , φ C , φ L , φ M N , we have
(1)
ξ 1 z S φ A φ B ξ 1 z S φ A ξ 1 z S φ B ,
(2)
η 1 z F φ A φ B η 1 z F φ A η 1 z F φ B ,
(3)
ξ 1 z S φ A φ B ξ 1 z S φ A ξ 1 z S φ B ,
(4)
η 1 z F φ A φ B η 1 z F φ A η 1 z F φ B ,
(5)
ξ 1 z S φ A φ B φ C ξ 1 z S φ A ξ 1 z S φ C ,
(6)
η 1 z F φ A φ B φ C η 1 z F φ A η 1 z F φ C ,
(7)
φ A φ L φ C = φ M φ C ξ 1 z S φ A ξ 1 z S φ L ξ 1 z S φ M ,
(8)
φ A φ L φ C = φ M φ C η 1 z F ( φ A ) η 1 z F φ L η 1 z F φ M .

3. Prime Hybrid H-bi-Ideals

In this section, the concept of prime, strongly prime, semiprime, irreducible and strongly irreducible ḦyH-BI are provided with examples. The characterization of H-HemiR and H-IHemiR hemirings by these ḦyH-BI is also discussed.
Definition 9. 
A ḦyH-BI Z 1 ˜ of N over C is called a prime hybrid h-bi-ideal (PḦyH-BI) if Z 2 ˜ Z 3 ˜ ˜ Z 1 ˜ suggests Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ for every ḦyH-BI Z 2 ˜ and Z 3 ˜ of N upon C .
Example: Suppose that there are five houses in the initial universe set C given by C = { H 1 , H 2 , H 3 , H 4 , H 5 }. Let a set of parameters N = { φ A , φ B , φ C , φ D } be a set of status of houses in which φ A stands for the parameter “beautiful”, φ B stands for the parameter “cheap”, φ C stands for the parameter “in good location”, φ D stands for the parameter “in green surrounding”. We define the binary operation ⋄ and ∔ on N by the Cayley table in Table 1.
Then ( N ,∔,⋄) is a hemiring. Let Z 1 ˜ = ( ξ 1 z S , η 1 z F ) , Z 2 ˜ = ( ξ 2 z S , η 2 z F ) and Z 3 ˜ = ( ξ 3 z S , η 3 z F ) be a any ḦyH-BI in N over C which is given by Table 2, Table 3 and Table 4.
It is routine calculation to verify that if ξ 2 z S H ξ 3 z S ξ 1 z S and η 2 z F H η 3 z F η 1 z F implies ξ 2 z S ξ 1 z S or ξ 3 z S ξ 1 z S and η 2 z F η 1 z F or η 3 z F η 1 z F for all φ A , φ B , φ C , φ D in N . This implies that Z 2 ˜ Z 3 ˜ ˜ Z 1 ˜ gives Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ . Thus Z 1 ˜ is a prime ḦyH-BI of N over C .
Definition 10. 
A ḦyH-BI Z 1 ˜ of N over C is said to be strongly prime hybrid h-bi-ideal (StPḦyH-BI) if for all ḦyH-BI Z 2 ˜ and Z 3 ˜ of N over C ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) ˜ Z 1 ˜ implies Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ (see the related example in Appendix A i.e., Example A1).
Definition 11. 
A ḦyH-BI Z 2 ˜ of N over C is idempotent if Z 2 ˜ Z 2 ˜ = Z 2 ˜ .
Definition 12. 
A semiprime hybrid h-bi-ideal (briefly SPḦyH-BI) is defined to be a ḦyH-BI Z 1 ˜ in N over C satisfying Z 2 ˜ Z 2 ˜ ˜ Z 1 ˜ means Z 2 ˜ ˜ Z 1 ˜ for every single ḦyH-BI Z 2 ˜ of N upon C (see the related example in Appendix A i.e., Example A2).
Further, we demonstrate that the hybrid h-product of any two ḦyH-BI of N over C is similar to ḦyH-BI in the following proposition.
Proposition 2. 
Z 1 ˜ Z 2 ˜ is an ḦyH-BI of N over C , whereas, Z 1 ˜ = ( ξ 1 z S , η 1 z F ) and Z 2 ˜ = ( ξ 2 z S , η 2 z F ) be any ḦyH-BI of N over C .
Proof. 
Let Z 1 ˜ and Z 2 ˜ be any ḦyH-BI of N over C and φ A , φ B N . Then
ξ 1 z S H ξ 2 z S φ A = φ A φ E φ F φ C = φ U φ V φ C ξ 1 z S φ E ξ 2 z S φ F ξ 1 z S φ U ξ 2 z S φ V , η 1 z F H η 2 z F φ A = φ A φ E φ F φ C = φ U φ V φ C η 1 z F φ E η 2 z F φ F η 1 z F φ U η 2 z F φ V
and
ξ 1 z S H ξ 2 z S φ B = φ B + φ P φ Q + φ C = φ S φ T + φ C ξ 1 z S φ P ξ 2 z S φ Q ξ 1 z S φ S ξ 2 z S φ T , η 1 z F H η 2 z F φ B = φ B + φ P φ Q + φ C = φ S φ T + φ C η 1 z F φ P η 2 z F φ Q η 1 z F φ S η 2 z F φ T ,
whereas, φ E , φ F , φ U , φ V , φ P , φ Q , φ S , φ T N . At this point
ξ 1 z S H ξ 2 z S φ A φ B = φ A φ B φ L φ M φ C = φ X φ Y φ C ξ 1 z S φ L ξ 2 z S φ M ξ 1 z S φ X ξ 2 z S φ Y φ A + φ E φ F + φ C = φ U φ V + φ C φ B + φ P φ Q + φ C = φ S φ T + φ C ξ 1 z S φ E ξ 2 z S φ F ξ 1 z S φ U ξ 2 z S φ V ξ 1 z S φ P ξ 2 z S φ Q ξ 1 z S φ S ξ 2 z S φ T = φ A + φ E φ F + φ C = φ U φ V + φ C ξ 1 z S φ E ξ 2 z S φ F ξ 1 z S φ U ξ 2 z S φ V φ B + φ P φ Q + φ C = φ S φ T + φ C ξ 1 z S φ P ξ 2 z S φ Q ξ 1 z S φ S ξ 2 z S φ T = ξ 1 z S H ξ 2 z S φ A ξ 1 z S H ξ 2 z S φ B
and
η 1 z F H η 2 z F φ A φ B = φ A φ B φ L φ M φ C = φ X φ Y φ C η 1 z F φ L η 2 z F φ M η 1 z F φ X η 2 z F φ Y φ A + φ E φ F + φ C = φ U φ V + φ C φ B + φ P φ Q + φ C = φ S φ T + φ C η 1 z F φ E η 2 z F φ F η 1 z F φ U η 2 z F φ V , η 1 z F φ P η 2 z F φ Q η 1 z F φ S η 2 z F φ T = φ A + φ E φ F + φ C = φ U φ V + φ C η 1 z F φ E η 2 z F φ F η 1 z F φ U η 2 z F φ V φ B + φ P φ Q + φ C = φ S φ T + φ C η 1 z F φ P η 2 z F φ Q η 1 z F φ S η 2 z F φ T = η 1 z F H η 2 z F φ A η 1 z F H η 2 z F φ B .
To prove that φ J φ E φ K = φ F φ K , implies ξ 1 z S H ξ 2 z S φ J ξ 1 z S H ξ 2 z S φ E ξ 1 z S H ξ 2 z S φ F and η 1 z F H η 2 z F φ J η 1 z F H η 2 z F φ E η 1 z F H η 2 z F φ F . Similarly, φ J φ E φ L φ M φ K = φ F φ L φ M φ K is obtained by combining φ E φ L φ M φ K = φ P φ Q φ K ,   φ F φ S φ T φ K = φ G φ H φ K and φ J φ E φ K = φ F φ K . This results in the equation φ J φ P φ Q φ K = φ F φ L φ M φ K and φ J φ P φ Q φ S φ T φ K = φ F φ S φ T φ L φ M φ K = φ L φ M φ G φ H φ K . Due to this, φ J φ P φ Q φ S φ T φ K = φ L φ M φ G φ H φ K .
ξ 1 z S H ξ 2 z S φ E ξ 1 z S H ξ 2 z S φ F = φ E + φ L φ M + φ C = φ P φ Q + φ C ξ 1 z S φ L ξ 2 z S φ M ξ 1 z S φ P ξ 2 z S φ Q φ F + φ S φ T + φ C = φ G φ H + φ C ξ 1 z S φ S ξ 2 z S φ T ξ 1 z S φ G ξ 2 z S φ H = φ E + φ L φ M + φ C = φ P φ Q + φ C φ F + φ S φ T + φ C = φ G φ H + φ C ξ 1 z S φ L ξ 2 z S φ M ξ 1 z S φ P ξ 2 z S φ Q ξ 1 z S φ S ξ 2 z S φ T ξ 1 z S φ G ξ 2 z S φ H φ J + φ A φ B + φ K = φ X φ Y + φ K ξ 1 z S φ A ξ 2 z S φ B ξ 1 z S φ X ξ 2 z S φ Y = ξ 1 z S H ξ 2 z S φ J
and
η 1 z F H η 2 z F φ E η 1 z F H η 2 z F φ F = φ E + φ L φ M + φ C = φ P φ Q + φ C η 1 z F φ L η 2 z F φ M η 1 z F φ P η 2 z F φ Q φ F + φ S φ T + φ C = φ G φ H + φ C η 1 z F φ S η 2 z F φ T η 1 z F φ G η 2 z F φ H = φ E + φ L φ M + φ C = φ P φ Q + φ C φ F + φ S φ T + φ C = φ G φ H + φ C η 1 z F φ L η 2 z F φ M η 1 z F φ P η 2 z F φ Q , η 1 z F φ S η 2 z F φ T η 1 z F φ G η 2 z F φ H φ J + φ A φ B + φ K = φ X φ Y + φ K η 1 z F φ A η 2 z F φ B η 1 z F φ X η 2 z F φ Y = η 1 z F H η 2 z F φ J .
Now
ξ 1 z S H ξ 2 z S H ξ 1 z S H ξ 2 z S = ( ξ 1 z S H ξ 2 z S H ξ 1 z S ) H ξ 2 z S ( ξ 1 z S H ξ S H ξ 1 z S ) H ξ 2 z S ξ 1 z S H ξ 2 z S
and
η 1 z F H η 2 z F H η 1 z F H η 2 z F = ( η 1 z F H η 2 z F H η 1 z F ) H η 2 z F ( η 1 z F H η F H η 1 z F ) H η 2 z F η 1 z F H η 2 z F .
Also,
ξ 1 z S H ξ 2 z S H ξ S H ξ 1 z S H ξ 2 z S = ξ 1 z S H ( ξ 2 z S H ξ S H ξ 1 z S ) H ξ 2 z S ( ξ 1 z S H ξ S H ξ 1 z S ) H ξ 2 z S ξ 1 z S H ξ 2 z S
and
η 1 z F H η 2 z F H η F H η 1 z F H η 2 z F = η 1 z F H ( η 2 z F H η F H η 1 z F ) H η 2 z F ( η 1 z F H η F H η 1 z F ) H η 2 z F η 1 z F H η 2 z F .
Consequently, Z 1 ˜ Z 2 ˜ is likewise a ḦyH-BI of N over C .    □
The intersection of any collection of ḦyH-BI of N over C is shown to be a ḦyH-BI in the ensuing Lemma 1.
Lemma 1. 
For a collection { ( Z 1 ˜ ) o ^ : o ^ Ω } of ḦyH-BI of N over C , their intersection is also a ḦyH-BI of N over C .
Proof. 
{ ( Z 1 ˜ ) o ^ : o ^ Ω } is a collection of ḦyH-BI of N over C . We have to prove that ˜ o ^ Ω ( Z 1 ˜ ) o ^ = ( o ^ Ω ( ξ 1 z S ) o ^ , o ^ Ω ( η 1 z F ) o ^ ) is a ḦyH-BI of N over C . Let φ C , φ D N , then
o ^ Ω ( ξ 1 z S ) o ^ ( φ C φ D ) = o ^ Ω { ( ξ 1 z S ) o ^ ( φ C φ D ) : o ^ Ω and φ C , φ D N } o ^ Ω { ( ξ 1 z S ) o ^ ( φ C ) ( ξ 1 z S ) o ^ ( φ D ) } = { o ^ Ω ( ( ξ 1 z S ) o ^ ( φ C ) ) } { o ^ Ω ( ( ξ 1 z S ) o ^ ( φ D ) ) } = { o ^ Ω ( ξ 1 z S ) o ^ ( φ C ) } { o ^ Ω ( ξ 1 z S ) o ^ ( φ D ) } = ( o ^ Ω ( ξ 1 z S ) o ^ ) ( φ C ) ( o ^ Ω ( ξ 1 z S ) o ^ ) ( φ D )
and
o ^ Ω ( η 1 z F ) o ^ ( φ C φ D ) = o ^ Ω { ( η 1 z F ) o ^ ( φ C φ D ) : o ^ Ω and φ C , φ D N } o ^ Ω { ( η 1 z F ) o ^ ( φ C ) ( η 1 z F ) o ^ ( φ D ) } = { o ^ Ω ( ( η 1 z F ) o ^ ( φ C ) ) } { o ^ Ω ( ( η 1 z F ) o ^ ( φ D ) ) } = { o ^ Ω ( η 1 z F ) o ^ ( φ C ) } { o ^ Ω ( η 1 z F ) o ^ ( φ D ) } = ( o ^ Ω ( η 1 z F ) o ^ ) ( φ C ) ( o ^ Ω ( η 1 z F ) o ^ ) ( φ D ) .
o ^ Ω ( ξ 1 z S ) o ^ ( φ C φ D ) = o ^ Ω { ( ξ 1 z S ) o ^ ( φ C φ D ) : o ^ Ω and φ C , φ D N } o ^ Ω { ( ξ 1 z S ) o ^ ( φ C ) ( ξ 1 z S ) o ^ ( φ D ) } = { o ^ Ω { ( ξ 1 z S ) o ^ ( φ C ) } } { o ^ Ω { ( ξ 1 z S ) o ^ ( φ D ) } } = { o ^ Ω ( ξ 1 z S ) o ^ ( φ C ) } { o ^ Ω ( ξ 1 z S ) o ^ ( φ D ) } = ( o ^ Ω ( ξ 1 z S ) o ^ ) ( φ C ) ( o ^ Ω ( ξ 1 z S ) o ^ ) ( φ D )
and
o ^ Ω ( η 1 z F ) o ^ ( φ C φ D ) = o ^ Ω { ( η 1 z F ) o ^ ( φ C φ D ) : o ^ Ω and φ C , φ D N } o ^ Ω { ( η 1 z F ) o ^ ( φ C ) ( η 1 z F ) o ^ ( φ D ) } = { l e f t ( o ^ Ω { ( η 1 z F ) o ^ ( φ C ) } } { o ^ Ω { ( η 1 z F ) o ^ ( φ D ) } } = { o ^ Ω { ( η 1 z F ) o ^ ( φ C ) } { o ^ Ω { ( η 1 z F ) o ^ ( φ D ) ) } = ( o ^ Ω { ( η 1 z F ) o ^ ) ( φ C ) ( o ^ Ω { ( η 1 z F ) o ^ ) ( φ D ) .
o ^ Ω ( ξ 1 z S ) o ^ ( φ L φ M φ N ) = o ^ Ω { ( ξ 1 z S ) o ^ ( φ L φ M φ N ) : o ^ Ω and φ L , φ M , φ N N } o ^ Ω { ( ξ 1 z S ) o ^ ( φ L ) ( ( ξ 1 z S ) o ^ ( φ N ) } = { o ^ Ω ( ( ξ 1 z S ) o ^ ( φ L ) ) } { o ^ Ω ( ( ξ 1 z S ) o ^ ( φ N ) ) } = { o ^ Ω ( ξ 1 z S ) o ^ ( φ L ) } { o ^ Ω ( ξ 1 z S ) o ^ ( φ N ) } = ( o ^ Ω ( ξ 1 z S ) o ^ ( φ L ) ( o ^ Ω ( ξ 1 z S ) o ^ ( φ N )
and
o ^ Ω ( η 1 z F ) o ^ ( φ L φ M φ N ) = o ^ Ω { ( η 1 z F ) o ^ ( φ L φ M φ N ) : o ^ Ω and φ L , φ M , φ N N } o ^ Ω { ( η 1 z F ) o ^ ( φ L ) ( η 1 z F ) o ^ ( φ N ) } = { o ^ Ω ( ( η 1 z F ) o ^ ( φ L ) ) } { o ^ Ω ( ( η 1 z F ) o ^ ( φ N ) ) } = { o ^ Ω ( η 1 z F ) o ^ ( φ L ) } { o ^ Ω ( η 1 z F ) o ^ ( φ N ) } = ( o ^ Ω ( η 1 z F ) o ^ ( φ L ) ( o ^ Ω ( η 1 z F ) o ^ ) ( φ N ) .
o ^ Ω ( ξ 1 z S ) o ^ ( φ R ) = o ^ Ω { { ( ξ 1 z S ) o ^ ( φ R ) : o ^ Ω and φ R N } o ^ Ω { ( ξ 1 z S ) o ^ ( φ S ) o ^ Ω ( ξ 1 z S ) o ^ ( φ T ) } = { o ^ Ω ( ξ 1 z S ) o ^ ( φ S ) } { o ^ Ω ( ξ 1 z S ) o ^ ( φ T ) } = { o ^ Ω ( ξ 1 z S ) o ^ ( φ S ) } { o ^ Ω ( ( ξ 1 z S ) o ^ ( φ T ) ) } = ( o ^ Ω ( ξ 1 z S ) o ^ ) ( φ S ) ( o ^ Ω ( ξ 1 z S ) o ^ ) ( φ T )
and
o ^ Ω ( η 1 z F ) o ^ ( φ R ) = o ^ Ω { ( η 1 z F ) o ^ ( φ R ) : o ^ Ω and φ R N } o ^ Ω { ( η 1 z F ) o ^ ( φ S ) ( η 1 z F ) o ^ ( φ T ) } = { o ^ Ω ( ( η 1 z F ) o ^ ( φ S ) ) } { o ^ Ω ( ( η 1 z F ) o ^ ( φ T ) ) } = { o ^ Ω ( η 1 z F ) o ^ ( φ S ) } { o ^ Ω ( η 1 z F ) o ^ ( φ T ) } = ( o ^ Ω ( η 1 z F ) o ^ ) ( φ S ) ( o ^ Ω ( η 1 z F ) o ^ ) ( φ T ) .
   □
The result given below tells us that the intersection of a family of prime hybrid h-bi-ideals in a hemring N over C is semiprime.
Lemma 2. 
If Z 1 ˜ is a member of the family of PḦyH-BI of N over C and subsequently ˜ ι ζ ( Z 1 ˜ ) ι is a SPḦyH-BI of N over C .
Proof. 
Assume that Z 1 ˜ is an element of a collection { ( Z 1 ˜ ) ι : ι ζ } of PḦyH-BI of N over C , Lemma 1 states that ˜ ι ζ ( Z 1 ˜ ) ι is a ḦyH-BI of N over C . Consequently, we acquire that ( Z 2 ˜ Z 2 ˜ ) ˜ ( Z 1 ˜ ) ι , for all ι ζ if ( Z 2 ˜ Z 2 ˜ ) ˜ ˜ ι ζ ( Z 1 ˜ ) ι for any ḦyH-BI Z 2 ˜ of N . Since each ( Z 1 ˜ ) ι is a PḦyH-BI of N over C eventually Z 2 ˜ ˜ ( Z 1 ˜ ) ι for all ι ζ . Therefore Z 2 ˜ ˜ ˜ ι ζ ( Z 1 ˜ ) ι .    □
Definition 13. 
An irreducible (strongly irreducible) hybrid h-bi-ideal Ir(SIr)ḦyH-BI of N over C is an ḦyH-BI Z 3 ˜ in such a manner that Z 1 ˜ ˜ Z 2 ˜ = Z 3 ˜ ( Z 1 ˜ ˜ Z 2 ˜ ˜ Z 3 ˜ ) implies Z 1 ˜ = Z 3 ˜ or Z 2 ˜ = Z 3 ˜ ( Z 1 ˜ ˜ Z 3 ˜ or Z 2 ˜ ˜ Z 3 ˜ ) , whereas Z 1 ˜ , Z 2 ˜ are ḦyH-BI of N over C .
We demonstrate that every strongly irreducible semiprime ḦyH-BI of N upon C is a StPḦyH-BI in the paragraph that follows.
Theorem 1. 
Every strongly irreducible, SPḦyH-BI of N over C is a StPḦyH-BI.
Proof. 
Assume that Z 1 ˜ be a strongly irreducible, SPḦyH-BI of N over C . Let Z 2 ˜ and Z 3 ˜ are ḦyH-BI of N over C such that ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) ˜ Z 1 ˜ . Since Z 2 ˜ ˜ Z 3 ˜ ˜ Z 2 ˜ and Z 2 ˜ ˜ Z 3 ˜ ˜ Z 3 ˜ , so ( Z 2 ˜ ˜ Z 3 ˜ ) ( Z 2 ˜ ˜ Z 3 ˜ ) ˜ Z 2 ˜ Z 3 ˜ and ( Z 2 ˜ ˜ Z 3 ˜ ) ( Z 2 ˜ ˜ Z 3 ˜ ) ˜ Z 3 ˜ Z 2 ˜ . Thus ( Z 2 ˜ ˜ Z 3 ˜ ) ( Z 2 ˜ ˜ Z 3 ˜ ) ˜ ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) ˜ Z 1 ˜ . This implies that Z 2 ˜ ˜ Z 3 ˜ ˜ Z 1 ˜ , because Z 1 ˜ is a SPḦyH-BI of N . Since Z 1 ˜ is SIrḦyH-BI of N over C , Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ .    □

4. Hemirings in Which Each Hybrid H-bi-Ideal Is Strongly Prime

The hemirings in which each ḦyH-BI is semiprime are studied in this part of the paper. Furthermore, we talk about the hemirings in which each ḦyH-BI is strongly prime.
Proposition 3. 
Let φ E N and ω ( C ) , m ( 0 , 1 ] and Z 1 ˜ be a ḦyH-BI of N over C defined by Z 1 ˜ ( φ E ) = ( ξ 1 z S ( φ E ) , η 1 z F ( φ E ) ) = ( ω , m ) . Then an IrḦyH-BI Z 2 ˜ of N upon C with Z 1 ˜ ˜ Z 2 ˜ and defined by Z 2 ˜ ( φ E ) = ( ξ 2 z S ( φ E ) , η 2 z F ( φ E ) ) = ( ω , m ) .
Proof. 
Let Z 3 ˜ is a ḦyH-BI of N defined by Z 3 ˜ ( φ E ) = ( ξ 3 z S ( φ E ) , η 3 z F ( φ E ) ) = ( ω , m ) with Z 1 ˜ ˜ Z 3 ˜ . Now let , is a collection of ḦyH-BI Z 3 ˜ of N and the elements of this collection are partially ordered. Let L ˜ and is totally ordered. Then ˜ ι Ω ( Z 3 ˜ ) ι = ι Ω ( ξ 3 z S ) ι , ι Ω ( η 3 z F ) ι is a ḦyH-BI of N such that Z 1 ˜ ˜ ι Ω ( Z 3 ˜ ) ι . Clearly, when we take φ A , φ B , φ C N , we get
( ι Ω ( ξ 3 z S ) ) ( φ A φ B ) = ι Ω ( ( ξ 3 z S ) ( φ A φ B ) ι Ω { ( ξ 3 z S ) ( φ A ) ( ξ 3 z S ) ( φ B ) } = { ι Ω ( ξ 3 z S ) ( φ A ) ι Ω ( ξ 3 z S ) ( φ B ) }
and
( ι Ω ( η 3 z F ) ι ) ( φ A φ B ) = ι Ω ( ( η 3 z F ) ι ( φ A φ B ) ) ι Ω { ( η 3 z F ) ι ( φ A ) ( η 3 z F ) ι ( φ B ) } = { ι Ω ( η 3 z F ) ι ( φ A ) ι Ω ( η 3 z F ) ι ( φ B ) } .
( ι Ω ( ξ 3 z S ) ) ( φ A φ B ) = ι Ω ( ( ξ 3 z S ) ( φ A φ B ) ) ι Ω { ( ξ 3 z S ) ( φ A ) ( ξ 3 z S ) ( φ B ) } = { ι Ω ( ξ 3 z S ) ( φ A ) ι Ω ( ξ 3 z S ) ( φ B ) }
and
( ι Ω ( η 3 z F ) ι ) ( φ A φ B ) = ι Ω ( ( η 3 z F ) ι ( φ A φ B ) ) ι Ω { ( η 3 z F ) ι ( φ A ) ( η 3 z F ) ι ( φ B ) } = { ι Ω ( η 3 z F ) ι ( φ A ) ι Ω ( η 3 z F ) ι ( φ B ) } .
( ι Ω ( ξ 3 z S ) ) ( φ C ) = ι Ω ( ( ξ 3 z S ) ( φ C ) ) ι Ω { ( ξ 3 z S ) ( φ A ) ( ξ 3 z S ) ( φ B ) } = { ι Ω ( ξ 3 z S ) ( φ A ) ι Ω ( ξ 3 z S ) ( φ B ) }
and
( ι Ω ( η 3 z F ) ι ) ( φ C ) = ι Ω ( ( η 3 z F ) ι ( φ C ) ) ι Ω { ( η 3 z F ) ι ( φ A ) ( η 3 z F ) ι ( φ B ) } = { ι Ω ( η 3 z F ) ι ( φ A ) ι Ω ( η 3 z F ) ι ( φ B ) }
( ι Ω ( ξ 3 z S ) ) ( φ A φ B φ C ) = ι Ω ( ( ξ 3 z S ) ( φ A φ B φ C ) ) ι Ω { ( ξ 3 z S ) ( φ A ) ( ξ 3 z S ) ( φ C ) } = { ι Ω ( ξ 3 z S ) ( φ A ) ι Ω ( ξ 3 z S ) ( φ C ) }
and
( ι Ω ( η 3 z F ) ι ) ( φ A φ B φ C ) = ι Ω ( ( η 3 z F ) ι ( φ A φ B φ C ) ) ι Ω { ( η 3 z F ) ι ( φ A ) ( η 3 z F ) ι ( φ C ) } = { ι Ω ( η 3 z F ) ι ( φ A ) ι Ω ( η 3 z F ) ι ( φ C ) } .
Thus ˜ ι Ω ( Z 3 ˜ ) ι is a ḦyH-BI of N over C . Since Z 1 ˜ ˜ ( Z 3 ˜ ) ι for all ι Ω , we have Z 1 ˜ ˜ ˜ ι Ω ( Z 3 ˜ ) ι . Also ( ˜ ι Ω ( Z 3 ˜ ) ι ) ( φ E ) = ˜ ι Ω ( Z 3 ˜ ) ι ( φ E ) = ( ω , m ) . Thus ˜ ι Ω ( Z 3 ˜ ) ι L and ˜ ι Ω ( Z 3 ˜ ) ι is an upper bound of N . The existence of a maximalḦyH-BI Z 2 ˜ of N is declared by Zorn’s Lemma and is defined by Z 2 ˜ ( φ E ) = ( ω , m ) , also Z 1 ˜ ˜ Z 2 ˜ . Let Z a ˜ ˜ Z b ˜ = Z 2 ˜ for any ḦyH-BI Z a ˜ , Z b ˜ of N . We get Z 2 ˜ ˜ Z a ˜ and Z 2 ˜ ˜ Z b ˜ . It is obvious that Z 2 ˜ = Z a ˜ or Z 2 ˜ = Z b ˜ . We claim that Z 2 ˜ Z a ˜ and Z 2 ˜ Z b ˜ . Then Z a ˜ ( φ E ) ( δ , t ) , Z b ˜ ( φ E ) ( ω , m ) . Thus, ( Z a ˜ ˜ Z b ˜ ) ( φ E ) = ( Z a ˜ ( φ E ) ˜ Z b ˜ ( φ E ) ) ( ω , m ) , and a contradiction arises to our supposition that ( Z a ˜ ( φ E ) ˜ Z b ˜ ( φ E ) ) = Z 2 ˜ ( φ E ) = ( ω , m ) . Hence, Z 2 ˜ = Z a ˜ or Z 2 ˜ = Z b ˜ . Therefore, Z 2 ˜ is an IrḦyH-BI of N over C .
The following theorem investigates the H-HemiR and H-IHemiR hemirings for which each ḦyH-BI is semiprime.    □
Theorem 2. 
The following statements have similar results in N :
(1)
N is H-HemiR and H-IHemiR hemiring at the same time.
(2)
For each single ḦyH-BI Z 1 ˜ of N over C , Z 1 ˜ Z 1 ˜ = Z 1 ˜ .
(3)
With Z 1 ˜ and Z 2 ˜ selected at random ḦyH-BI of N over C , Z 1 ˜ ˜ Z 2 ˜ = ( Z 1 ˜ Z 2 ˜ ) ˜ ( Z 2 ˜ Z 1 ˜ ) .
(4)
Every ḦyH-BI of N over C results in an SPḦyH-BI.
(5)
Every proper ḦyH-BI of N is the intersection of irreducible SPḦyH-BI of N and the proper ḦyH-BI is likewise included in the intersection.
Proof. 
(1) ( 2 ) Understood.
(2) ( 3 ) Let Z 1 ˜ , Z 2 ˜ be ḦyH-BI of N over C . Lemma 2 suggests that Z 1 ˜ ˜ Z 2 ˜ is a ḦyH-BI. Hypothesis gives the result that Z 1 ˜ ˜ Z 2 ˜ = Z 1 ˜ ˜ Z 2 ˜ Z 1 ˜ ˜ Z 2 ˜ . Also we know that Z 1 ˜ ˜ Z 2 ˜ Z 1 ˜ ˜ Z 2 ˜ ˜ Z 1 ˜ Z 2 ˜ .
In the same way we can write Z 1 ˜ ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ . Thereby Z 1 ˜ ˜ Z 2 ˜ ˜ Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ is obtained.
Z 1 ˜ Z 2 ˜ and Z 2 ˜ Z 1 ˜ are ḦyH-BI of N over C according to the Proposition 2. As a result, Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ is a ḦyH-BI of N over C . In the light of this, we can it write as:
Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ = Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ ˜ Z 1 ˜ Z 2 ˜ Z 2 ˜ Z 1 ˜ ˜ Z 1 ˜ Z 2 ˜ Z 2 ˜ Z 1 ˜ ˜ Z 1 ˜ Z 2 ˜ Z 1 ˜ ˜ Z 1 ˜ Z 1 ˜ ˜ Z 1 ˜ .
Analogously, we obtain Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ ˜ Z 2 ˜ . Hence Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ ˜ Z 1 ˜ ˜ Z 2 ˜ . Therefore, Z 1 ˜ Z 2 ˜ ˜ Z 2 ˜ Z 1 ˜ = Z 1 ˜ ˜ Z 2 ˜ .
(3) ( 2 ) Understood.
(2) ( 4 ) Let Z 1 ˜ , Z 2 ˜ be ḦyH-BI of N over C be such that Z 1 ˜ Z 1 ˜ ˜ Z 2 ˜ . Since by (2) Z 1 ˜ Z 1 ˜ = Z 1 ˜ , so Z 1 ˜ ˜ Z 2 ˜ . Thus Z 2 ˜ is SpḦyH-BI of N over C .
(4) ( 2 ) Understood.
(4) ( 5 ) Let Z 1 ˜ ( φ S ) = ( δ , t ) be a proper ḦyH-BI of N for φ S N , δ ( C ) , t ( 0 , 1 ] , respectively. An IrḦyH-BI Z 2 ˜ of N exists under the assumption that Z 1 ˜ ˜ Z 2 ˜ α = ( δ , t ) , which produces Z 1 ˜ ˜ ˜ Z 2 ˜ α , in accordance with Proposition 3. This means that Z 1 ˜ is the intersection of all IrḦyH-BI of N which include Z 1 ˜ . Based on the assumption we have, every ḦyH-BI is a StPḦyH-BI. Finally, Z 1 ˜ is the intersection of all irreducible SPḦyH-BI of N containing Z 1 ˜ .
(5) ( 2 ) Suppose Z 1 ˜ is ḦyH-BI of N over C , in that case, Z 1 ˜ Z 1 ˜ is a ḦyH-BI of N over C as well. Hence, Z 1 ˜ Z 1 ˜ = ˜ ι Ω Z 1 ˜ i wherein every Z 1 ˜ ι is an irreducible, StPḦyH-BI of N which may be stated in the manner of Z 1 ˜ Z 1 ˜ ˜ Z 1 ˜ ι ι Ω . In the light of the fact that each Z 1 ˜ ι is semiprime, we can infer that Z 1 ˜ ˜ Z 1 ˜ ι for all ι . As a result Z 1 ˜ ˜ ˜ ι Ω Z 1 ˜ ι = Z 1 ˜ Z 1 ˜ . However, Z 1 ˜ Z 1 ˜ ˜ Z 1 ˜ is definitely valid. Consequently Z 1 ˜ Z 1 ˜ = Z 1 ˜ .    □
Theorem 3. 
For an H-HemiR and H-IHemiR hemiring N , the subsequent results are equivalent.
(1)
Z 1 ˜ has the form SIrḦyH-BI.
(2)
Z 1 ˜ exhibits StPḦyH-BI.
Proof. 
(1) ( 2 ) Considering the fact that N is an H-HemiR and H-IHemiR-hemiring, we can come up with Z 2 ˜ ˜ Z 3 ˜ = ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) by applying Theorem 2. Z 1 ˜ being SIrḦyH-BI, Z 2 ˜ ˜ Z 3 ˜ ˜ Z 1 ˜ points to Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜  with any ḦyH-BI i.e.,  Z 2 ˜  and Z 3 ˜ . As a result, ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) ˜ Z 1 ˜ suggests either Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ . Z 1 ˜ is therefore a StPḦyH-BI of N over C .
(2) ( 1 ) Considering that Z 1 ˜ is a StPḦyH-BI of N over C , the statement Z 2 ˜ ˜ Z 3 ˜ ˜ Z 1 ˜ indicates that Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ correspond to any ḦyH-BI, Z 2 ˜ and Z 3 ˜ , respectively. We can deduce from Theorem 2 that ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) = Z 2 ˜ ˜ Z 3 ˜ ˜ Z 1 ˜ since N is both H-HemiR and H-IHemiR. In light of the fact that Z 1 ˜ is StPḦyH-BI of N over C , the outcome is either Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ .    □
In the following Theorem, it is shown that every ḦyH-BI of a totally ordered, H-HemiR and H-IHemiR hemiring N is strongly prime.
Theorem 4. 
ḦyH-BI of N over C satisfies total order and N is H-HemiR and H-IHemiR if and only if each ḦyH-BI of N over C is StPḦyH-BI.
Proof. 
Let Z 1 ˜ , Z 2 ˜ and Z 3 ˜ be any ḦyH-BI of N over C arranged in the way ( Z 1 ˜ Z 2 ˜ ) ˜ ( Z 2 ˜ Z 1 ˜ ) ˜ Z 3 ˜ . Consider the case where N is H-HemiR and H-IHemiR and its elements are in total order. According to Theorem 2,
Z 1 ˜ ˜ Z 2 ˜ = ( Z 1 ˜ Z 2 ˜ ) ˜ ( Z 2 ˜ Z 1 ˜ ) ˜ Z 3 ˜ .
Z 1 ˜ ˜ Z 2 ˜ or Z 2 ˜ ˜ Z 1 ˜ , implies Z 1 ˜ ˜ Z 2 ˜ = Z 1 ˜ or Z 1 ˜ ˜ Z 2 ˜ = Z 2 ˜ . Further, Z 1 ˜ ˜ Z 3 ˜ or Z 2 ˜ ˜ Z 3 ˜ concludes as a result of assumption. Hence Z 3 ˜ is StPḦyH-BI of N over C .
Contrary to this, every ḦyH-BI of N is SPḦyH-BI since, by presumption, each ḦyH-BI of N over C is StPḦyH-BI. N is H-HemiR and H-IHemiR, as proven by Theorem 2. Additionally, take arbitrary ḦyH-BI Z 1 ˜ and Z 2 ˜ of N over C . It follows from Theorem 2 that ( Z 1 ˜ ˜ Z 2 ˜ ) = ( Z 1 ˜ Z 2 ˜ ) ˜ ( Z 2 ˜ Z 1 ˜ ) . Z 1 ˜ ˜ Z 2 ˜ is StPḦyH-BI since every single ḦyH-BI is StPḦyH-BI. Consequently, Z 1 ˜ ˜ Z 1 ˜ ˜ Z 2 ˜ or Z 2 ˜ ˜ Z 1 ˜ ˜ Z 2 ˜ . Furthermore, if Z 1 ˜ ˜ Z 1 ˜ ˜ Z 2 ˜ , then Z 1 ˜ ˜ Z 2 ˜ and if Z 2 ˜ ˜ Z 1 ˜ ˜ Z 2 ˜ , in turn Z 2 ˜ ˜ Z 1 ˜ .    □
Theorem 5. 
In a hemiring N , the statements provided here are identical.
(1)
Set of ḦyH-BI of N over C satisfies total order (TO).      
(2)
Each ḦyH-BI of N over C is SIrḦyH-BI.
(3)
Each ḦyH-BI of N upon C is IrḦyH-BI.
Proof. 
( 1 ) ( 2 ) Assume that ( Z 1 ˜ ˜ Z 2 ˜ ) ˜ Z 3 ˜ for any ḦyH-BI Z 1 ˜ , Z 2 ˜ and Z 3 ˜ of N over C . Now Z 1 ˜ ˜ Z 2 ˜ or Z 2 ˜ ˜ Z 1 ˜ by our assumption that the set of ḦyH-BI of N over C is TO. This implies that either ( Z 1 ˜ ˜ Z 2 ˜ ) = Z 1 ˜ or ( Z 1 ˜ ˜ Z 2 ˜ ) = Z 2 ˜ . Thus Z 1 ˜ ˜ Z 3 ˜ or Z 2 ˜ ˜ Z 3 ˜ . Hence Z 3 ˜ is a SIrḦyH-BI of N upon C .
(2) ( 3 ) Let ( Z 1 ˜ ˜ Z 2 ˜ ) = Z 3 ˜ where Z 1 ˜ , Z 2 ˜ and Z 3 ˜ are ḦyH-BI of N over C . We obtain that Z 3 ˜ ˜ Z 1 ˜ and Z 3 ˜ ˜ Z 2 ˜ . Again by hypothesis, either Z 1 ˜ ˜ Z 3 ˜ or Z 2 ˜ ˜ Z 3 ˜ . Thus, we can see that either Z 1 ˜ = Z 3 ˜ or Z 2 ˜ = Z 3 ˜ . Hence, Z 3 ˜ is IrḦyH-BI of N upon C .
(3) ( 1 ) Let Z 1 ˜ and Z 2 ˜ be any ḦyH-BI of N upon C then Z 1 ˜ ˜ Z 2 ˜ is a ḦyH-BI. We can write Z 1 ˜ ˜ Z 2 ˜ = Z 1 ˜ ˜ Z 2 ˜ . Thus either Z 1 ˜ ˜ Z 2 ˜ = Z 1 ˜ or Z 1 ˜ ˜ Z 2 ˜ = Z 2 ˜ by hypothesis, that is Z 1 ˜ ˜ Z 2 ˜ or Z 2 ˜ ˜ Z 1 ˜ . As a result, the set of ḦyH-BI of N upon C is totally ordered.    □

5. Proposed Hybrid Structure-Based Algorithm in Decision Making

This section introduces a novel algorithm utilizing hybrid structures to handle uncertain information in real-world decision-making scenarios. By showcasing its practical application, we aim to demonstrate the algorithm’s effectiveness and versatility, offering valuable insights for enhancing decision-making processes amid complex data uncertainties.

5.1. Tabular Representation of Hybrid Structure

Here, we describe the general tabular form before proposing a hybrid structure-based algorithm.
Let Z 1 ˜ = ξ 1 z S , η 1 z F be any ḦyS in a hemiring N over an initial universal set C . Then, Z 1 ˜ is presented as:
Z 1 ˜ = φ A , ξ 1 z S φ A , η 1 z F ( φ A ) : φ A N , where ξ 1 z S : N ( C ) and η 1 z F : N I are mappings, ( C ) represents the set of all subsets of C and I = [ 0 , 1 ] .
In general, let C = { S 1 , S 2 , S 3 , S 5 , . , S m } an initial universal set and Q = { φ A 1 , φ A 2 , φ A 3 , . . , φ A n } N , the ḦyS Z 1 ˜ of Q over C is given by
Z 1 ˜ = ( ξ 1 z S , η 1 z F ) = φ A i : ξ 1 z S , η 1 z F ( φ A 1 ) = ξ 1 z S ( φ A 1 ) , η 1 z F ( φ A 1 ) , ξ 1 z S , η 1 z F ( φ A 2 ) = { ξ 1 z S ( φ A 2 ) , η 1 z F ( φ A 2 ) , ξ 1 z S , η 1 z F ( φ A 3 ) = ξ 1 z S ( φ A 1 ) , η 1 z F ( φ A 1 ) , . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , ξ 1 z S , η 1 z F ( φ A n ) = ξ 1 z S ( φ A n ) , η 1 z F ( φ A n ) , φ A i Q .
The tabular representation of Z 1 ˜ is signified in Table 5 [35].

5.2. Proposed Algorithm

In this section, we propose a hybrid structure-based algorithm (Algorithm 1). The proposed algorithm combines both soft sets and fuzzy sets to effectively handle uncertainties and imprecision in a variety of domains, resulting in a more stable and flexible modelling framework. The proposed algorithm consists of the following steps:
Algorithm 1 Hybrid structure-based algorithm
Step 1. Input the hybrid structure in tabular form (defined in Section 5.1).
Step 2. Represent the tabular form of the soft set ξ 1 z S : N ( C ) as given in [9] and fuzzy set η 1 z F : N ( C ) in separate tables.
Step 3. Construct the priority table (PT). This table can be achieved by multiplying the tabular values of the soft set with the corresponding values of the fuzzy membership of parameters. Also calculate the row sum of each row in priority table.
Step 4. Construct the comparison table (CT) according to [42]. This can be achieved by finding the entries as differences of each row sum in priority table with those of all other rows.
Step 5. Find the row sum of each row in the comparison table to obtain the score.
Step 6. Finally, the highest score is chosen.
The flowchart in Figure 1 summarizes the step-by-step process of the proposed algorithm and logical flow towards achieving its objectives.

5.3. Example

To empirically evaluate the effectiveness of our proposed algorithm, we give an example of the selection of a school for a cochlear-implanted child from a real-life scenario. The decision of selecting a school for a child with a cochlear implant is a critical and common decision that parents of such children often face.
A cochlear implant is an electronic device that can provide partial hearing to individuals with severe to profound hearing loss. Advances in early identification, implant technology, and early intensive therapy have enabled the implanted child to study in mainstream schools. Visual distraction, background noise, or any other environmental sounds may interfere with the understanding speech for a child with an implant. So, the decision of the selection of a school for an implanted child is based on the individual needs of the child, their capacity to learn in a spoken language environment, the environment of the school, and cooperation of the teaching staff.
Suppose Mr and Mrs Ali are in search of a school for their implanted child. To complete this task, the parents visit some schools and collect the required information about different schools in their area. They choose the five schools, C = { S 1 , S 2 , S 3 , S 4 , S 5 } namely, “Beacon House” ( S 1 ) “The city school” ( S 2 ) “Pak-American” ( S 3 ), “Educators”( S 4 ) , and “Superior Montessori” ( S 5 ) who are willing to give admission to the child. The parents configure five attributes N = { φ A , φ B , φ C , φ D , φ E } , where “access” ( φ A ),“environment” ( φ B ), “learning” ( φ C ), “staff cooperation” ( φ D ), and “no of students in class” ( φ E ) as a set of parameters which they think are crucial for making the best option and ensuring their child’s adequate education. A hierarchical structure is shown in Figure 2, presenting the five selection criteria (i.e., access, environment, learning, staff cooperation, and the number of pupils in the class).
Based on these criteria, the family wants to select the best school. The following hybrid structure illustrates the information of the schools based on the chosen criteria.
( ξ 1 z S , η 1 z F ) = ξ 1 z S , η 1 z F ( φ A ) = { S 1 , S 2 , S 3 , S 5 } , 0.5 , ξ 1 z S , η 1 z F ( φ B ) = { S 1 , S 2 , S 3 } , 0.8 , ξ 1 z S , η 1 z F ( φ C ) = { S 1 , S 5 } , 0.3 , ξ 1 z S , η 1 z F ( φ D ) = { S 3 , S 4 , S 5 } , 0.4 , ξ 1 z S , η 1 z F ( φ E ) = { S 1 , S 2 } , 0.7
We define the binary operation ⋄ and ∔ on N by the Cayley table in Table 6.
Then ( N , , ) is a hemiring. For the implementation of our proposed Algorithm 1, the following steps are used.
Step 1: Based on the hybrid structure, all the possible values are estimated for the attributes, given in Table 7.
Step 2. Construct seperate tables for the soft set ξ 1 z S and fuzzy set η 1 z F .
Step 3. By multiplying the corresponding values of ξ 1 z S in Table 8 and η 1 z F in Table 9, Table 10 computes the priority table.
Step 4. In Table 11, each attribute is obtained as the difference of row sum with the all the other rows.
Step 5. Calculate the sum of each row in the comparison table to obtain the score of schools as shown in Table 12.
Step 6. From the Table 12, we can see that alternative S 1 is the best selection.
Scores of alternatives for the selection of best school for implanted child are shown in Figure 3.
In Figure 3, the bar chart serves as a visual representation of the alternative values derived from the evaluation criteria outlined in Table 12. The chart allows for a clear and concise comparison of the different schools ( S 1 , S 2 , S 3 , S 4 , and S 5 ) based on their respective scores.
At the top of the bar chart, we can observe that Beacon House School ( S 1 ) stands out with the highest score of 3.7 among all the schools. This score reflects its excellent performance in the evaluation criteria, indicating that it outperformed the other schools in the assessment.
The City School ( S 2 ) follows closely behind Beacon House School, securing the second-highest score. This suggests that The City School is also a strong competitor and performed admirably in the comparison.
However, the alternatives at the bottom of the bar chart, namely The Pak-American School ( S 3 ), The Educators School ( S 4 ), and The Superior Montessori School ( S 5 ), obtained relatively lower scores. These scores indicate that these schools had comparatively lesser acceptability or performance based on the assessment criteria.
The bar chart, as an essential part of the decision-making process, provides a visual tool to discern the varying levels of performance among the alternatives. It simplifies the comparison, allowing decision-makers to identify the top-performing school (Beacon House School) and observe the relative positions of the other schools in terms of their scores.
By incorporating a bar chart into the decision-making process, the evaluation becomes more intuitive and accessible. Decision-makers can make well-informed choices by considering the graphical representation of the schools’ performance, facilitating a clearer understanding of their respective strengths and weaknesses based on the evaluation criteria. The visual comparison aids in selecting the most appropriate school that aligns with the decision-maker’s preferences and requirements.
As compared to Asmat et al. [40,41] our proposed method has assessed the hybrid structure in hemirings and investigated several properties of hybrid h-bi-ideals. The proposed prime hybrid h-bi-ideals are an extension of hybrid h-bi-ideals and we have investigated various aspects of hemirings. Also, this work has conducted a characterization of certain classes of hemirings based on these prime hybrid h-bi-ideals. Furthermore, we have utilized the hybrid structure in the decision-making process with the help of examples from real-world situations to explore new directions in algebraic development and tackle practical problems with improved uncertainty-handling abilities by utilizing hybrid structures in hemirings. Furthermore, our proposed method distinguishes itself from the existing literature by adopting a hybrid structure-based model rather than focusing solely on algebraic structures like BCK/BCI algebras and semigroups, as seen in previous studies [35,36,37,38,39].

6. Conclusions

In summary, the paper highlights the significance of hybrid structures in mathematical and decision-making domains. This study focuses on investigating the properties of hybrid h-bi-ideals within the context of hemirings. These hybrid h-bi-ideals include prime, strongly prime, semiprime, irreducible, and strongly irreducible. By employing the hybrid h-bi-ideals, the paper provides insightful characterizations of h-hemiregular and h-intra-hemiregular hemirings. This analysis contributes to a deeper understanding of the algebraic structures associated with these types of hemirings. To this end, we present a decision-making algorithm based on hybrid structures that has been successfully applied to solve a significant real-world problem. This showcases the effectiveness of the proposed approach in providing robust solutions in situations involving imprecise or uncertain data. The practical utility of the findings is demonstrated through the successful application of the proposed decision-making algorithm to solve real-world problems under imprecise conditions.
The proposed hybrid structure-based model empowers decision-makers in complex situations with uncertainty. It helps them understand uncertainties comprehensively and make effective choices in diverse scenarios. By using both crisp and fuzzy information, it improves decision outcomes in various domains. Also, the proposed algorithm considers both quantitative and qualitative information, enhancing the decision-making process and reducing risks.
On the contrary to this, defining membership functions for fuzzy and soft sets requires extensive domain knowledge, and interpreting dual representation demands specialized expertise, making implementation and maintenance of the approach more challenging. Additionally, gathering precise and accurate data, especially for subjective or qualitative information, can be difficult. The effectiveness of the proposed hybrid structures relies on sufficient and reliable data; in situations with scarce or unreliable data, their accuracy and effectiveness may be compromised.
However, in the future, the applicability of hybrid structures may be assessed in different algebraic structures including rings, semirings, and lattices, acquiring insightful knowledge into their adaptability and efficiency. To handle complex situational decisions with multiple objectives and criteria more successfully, one could combine these hybrid structures with multi-criteria decision-making methodologies. Furthermore, comparative studies between the existing models and hybrid structures could be considered to understand their respective strengths and limitations in various decision-making scenarios.

Author Contributions

Conceptualization, A.H. and A.K.; Software, A.H., A.K., N.F. and D.M.K.; Validation, N.F., D.M.K., R.A.R.B. and M.E.; Formal analysis, A.H., A.K. and R.A.R.B.; Investigation, A.K., N.F., D.M.K. and M.E.; Resources, A.H., N.F., D.M.K., R.A.R.B. and M.E.; Data curation, A.H., N.F., R.A.R.B. and M.E.; Writing—original draft, A.H.; Writing—review editing, A.K.; Visualization, N.F., D.M.K., R.A.R.B. and M.E.; Supervision, A.K.; Project administration, D.M.K. and M.E.; Funding acquisition, R.A.R.B. All authors have read and agreed to the published version of the manuscript.

Funding

The technical and financial support—The Ministry of Education and King Abdulaziz University, DSR, Jeddah, Saudi Arabia.

Data Availability Statement

Not applicable.

Acknowledgments

This research work was funded by Institutional Fund Projects under grant no. (IFPIP: 550-150-1443). The authors gratefully acknowledge the technical and financial support provided by the Ministry of Education and King Abdulaziz University, DSR, Jeddah, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Example A1. 
Suppose that there are six houses in the initial universe set C given by C = { H 1 , H 2 , H 3 , H 4 , H 5 , H 6 }. Let a set of parameters N = { φ A , φ B , φ C , φ D } be a set of status of houses in which φ A stands for the parameter “beautiful”, φ B stands for the parameter “cheap”, φ C stands for the parameter “in good location”, φ D stands for the parameter “in green surrounding". We define the binary operation and on N by the Cayley table in Table A1.
Table A1. Cayley table for the binary operations ∔ and ⋄.
Table A1. Cayley table for the binary operations ∔ and ⋄.
φ A φ B φ C φ D φ A φ B φ C φ D
φ A φ A φ B φ C φ D φ A φ A φ A φ A φ A
φ B φ B φ A φ B φ C φ B φ A φ B φ B φ B
φ C φ C φ B φ B φ C φ C φ A φ B φ B φ B
φ D φ D φ C φ C φ B φ D φ A φ B φ B φ B
Then ( N ,∔,⋄) is a hemiring. Let Z 1 ˜ = ( ξ 1 z S , η 1 z F ) , Z 2 ˜ = ( ξ 2 z S , η 2 z F ) and Z 3 ˜ = ( ξ 3 z S , η 3 z F ) be a any ḦyH-BI in N over C which is given by Table A2, Table A3 and Table A4.
Table A2. Tabular representation of ḦyH-BI Z 1 ˜ = ( ξ 1 z S , η 1 z F ) .
Table A2. Tabular representation of ḦyH-BI Z 1 ˜ = ( ξ 1 z S , η 1 z F ) .
N ξ 1 z S η 1 z F
φ A { H 1 , H 2 , H 3 , H 4 , H 5 , H 6 } 0.2
φ B { H 1 , H 2 , H 3 , H 4 , H 6 } 0.4
φ C { H 1 , H 2 , H 3 } 0.7
φ D { H 1 } 0.8
Table A3. Tabular representation of ḦyH-BI Z 2 ˜ = ( ξ 2 z S , η 2 z F ) .
Table A3. Tabular representation of ḦyH-BI Z 2 ˜ = ( ξ 2 z S , η 2 z F ) .
N ξ 2 z S η 2 z F
φ A { H 1 , H 2 , H 3 , H 4 } 0.2
φ B { H 1 , H 2 , H 3 } 0.3
φ C { H 1 , H 2 } 0.6
φ D { H 1 } 0.8
Table A4. Tabular representation of ḦyH-BI Z 3 ˜ = ( ξ 3 z S , η 3 z F ) .
Table A4. Tabular representation of ḦyH-BI Z 3 ˜ = ( ξ 3 z S , η 3 z F ) .
N ξ 3 z S η 3 z F
φ A { H 1 , H 3 , H 4 , H 6 } 0.3
φ B { H 3 , H 4 , H 5 } 0.5
φ C { H 4 , H 5 } 0.7
φ D { H 5 } 0.9
It is a routine calculation to verify that if ξ 2 z S H ξ 3 z S ( ξ 3 z S H ξ 2 z S ) ξ 1 z S and η 2 z F H η 3 z F ( η 3 z F H η 2 z F ) η 1 z F implies ξ 2 z S ξ 1 z S or ξ 3 z S ξ 1 z S and η 2 z F η 1 z F or η 3 z F η 1 z F for all φ A , φ B , φ C , φ D in N . This implies that ( Z 2 ˜ Z 3 ˜ ) ˜ ( Z 3 ˜ Z 2 ˜ ) ˜ Z 1 ˜ gives Z 2 ˜ ˜ Z 1 ˜ or Z 3 ˜ ˜ Z 1 ˜ . Thus, Z 1 ˜ is a strongly prime ḦyH-BI of N over C .
Example A2. 
Suppose that there are six houses in the initial universe set C given by C = { H 1 , H 2 , H 3 , H 4 , H 5 , H 6 }. Let a set of parameters N = { φ A , φ B , φ C , φ D } be a set of status of houses in which φ A stands for the parameter “beautiful”, φ B stands for the parameter “cheap”, φ C stands for the parameter “in good location”, φ D stands for the parameter “in green surrounding". We define the binary operation and on N by the Cayley table in Table A5.
Table A5. Cayley table for the binary operations ∔ and ⋄.
Table A5. Cayley table for the binary operations ∔ and ⋄.
φ A φ B φ C φ D φ A φ B φ C φ D
φ A φ A φ B φ C φ D φ A φ A φ A φ A φ A
φ B φ B φ A φ B φ C φ B φ A φ B φ B φ B
φ C φ C φ B φ B φ C φ C φ A φ B φ B φ B
φ D φ D φ C φ C φ B φ D φ A φ B φ B φ B
Then ( N ,∔,⋄) is a hemiring. Let Z 1 ˜ = ( ξ 1 z S , η 1 z F ) and Z 2 ˜ = ( ξ 2 z S , η 2 z F ) be a any ḦyH-BI in N over C which is given by Table A6 and Table A7.
Table A6. Tabular representation of ḦyH-BI Z 1 ˜ = ( ξ 1 z S , η 1 z F ) .
Table A6. Tabular representation of ḦyH-BI Z 1 ˜ = ( ξ 1 z S , η 1 z F ) .
N ξ 1 z S η 1 z F
φ A { H 1 , H 2 , H 3 , H 4 , H 5 , H 6 } 0.2
φ B { H 1 , H 2 , H 3 , H 4 } 0.4
φ C { H 1 , H 2 } 0.7
φ D { H 1 } 0.8
Table A7. Tabular representation of ḦyH-BI Z 2 ˜ = ( ξ 2 z S , η 2 z F ) .
Table A7. Tabular representation of ḦyH-BI Z 2 ˜ = ( ξ 2 z S , η 2 z F ) .
N ξ 2 z S η 2 z F
φ A { H 2 , H 3 , H 4 , H 6 } 0.3
φ B { H 1 , H 2 , H 3 } 0.5
φ C { H 1 } 0.7
φ D { H 1 } 0.8
It is a routine calculation to verify that if ξ 2 z S H ξ 2 z S ξ 1 z S and η 2 z F H η 2 z F η 1 z F implies ξ 2 z S ξ 1 z S and η 2 z F η 1 z F for all φ A , φ B , φ C , φ D in N . This implies that ( Z 2 ˜ Z 2 ˜ ) ˜ Z 1 ˜ gives Z 2 ˜ ˜ Z 1 ˜ . Thus, Z 1 ˜ is a semiprime ḦyH-BI of N over C .

References

  1. Zadeh, L.A. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Fuzzy sets. Towards a generalized theory of uncertainity. Inf. Sci. 2005, 172, 1–40. [Google Scholar] [CrossRef]
  3. Debois, D.; Prade, H. Fuzzy Set and Systems: Theory and Applications; Academic Press: New York, NY, USA, 1990. [Google Scholar]
  4. Klir, G.J.; Folger, T.A. Fuzzy Sets, Uncertainity and Information; Printice Hall, Inc.: Hoboken, NJ, USA, 1968. [Google Scholar]
  5. Zimmerman, H.J. Fuzzy Set Theory and Its Applications; Acedemic Publishers: Cambridge, MA, USA, 1991. [Google Scholar]
  6. Pawlak, Z. Rough sets. Int. J. Inf. Comput. Sci. 1962, 11, 34–352. [Google Scholar]
  7. Gorzalzany, M.B. A method of inference in approximate reasoning based on interval-valued fuzzy sets. Fuzzy Sets Syst. 1987, 21, 1–17. [Google Scholar] [CrossRef]
  8. Molodtsov, D. Soft set theory-first results. J. Intell. Fuzzy Syst. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  9. PMaji, K.; Biswas, R.; Roy, A.R. Fuzzy soft sets. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  10. Majumdar, P.; Samanta, S.K. Generalised fuzzy soft sets. Comput. Math. Appl. 2010, 59, 1425–1432. [Google Scholar] [CrossRef]
  11. Yang, X.B.; Lin, T.Y.; Yang, J.Y.; Li, Y.; Yu, D.J. Combination of interval-valued fuzzy set and soft set. Comput. Math. Appl. 2009, 58, 521–527. [Google Scholar] [CrossRef]
  12. Roy, A.R.; Maji, P.K. A fuzzy soft set theoretic approach to decision making problems. J. Comput. Appl. Math. 2007, 203, 412–418. [Google Scholar] [CrossRef]
  13. Aktas, H.; Çagman, N. Soft sets and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef]
  14. Feng, F.; Jun, Y.B.; Zhao, X.Z. Soft semirings. Comput. Math. Appl. 2008, 56, 2621–2628. [Google Scholar] [CrossRef]
  15. Jun, Y.B.; Park, C.H. Applications of soft sets in ideal theory of BCK/BCI-algebras. Inf. Sci. 2008, 178, 2466–2475. [Google Scholar] [CrossRef]
  16. Jun, Y.B.; Lee, K.J.; Zhan, J. Soft p-ideals of soft BCI-algebras. Comput. Math. Appl. 2009, 58, 2060–2068. [Google Scholar] [CrossRef]
  17. Jun, Y.B.; Lee, K.J.; Park, C.H. Fuzzy soft set theory applied to BCK/BCI-algebras. Comput. Math. Appl. 2010, 59, 3180–3192. [Google Scholar] [CrossRef]
  18. Jun, Y.B.; Lee, K.J.; Khan, A. Soft ordered semigroups. Math. Log. Q. 2010, 56, 42–50. [Google Scholar] [CrossRef]
  19. Jun, Y.B.; Song, S.Z.; So, K.S. Soft set theory applied to p-ideals of BCI-algebras related to fuzzy points. Neural Comput. Appl. 2011, 20, 1313–1320. [Google Scholar] [CrossRef]
  20. Zhan, J.; Jun, Y.B. Soft BL-algebras based on fuzzy sets. Comput. Math. Appl. 2010, 59, 2037–2046. [Google Scholar] [CrossRef]
  21. Ali, M.I. A note on soft sets, rough soft sets and fuzzy soft sets. Appl. Soft Comput. 2011, 11, 3329–3332. [Google Scholar]
  22. Liu, Z.; Qin, K.; Pei, Z. Method for Fuzzy Soft Sets in Decision-Making Based on an Ideal Solution. Symmetry 2017, 9, 246. [Google Scholar] [CrossRef]
  23. Rehman, U.U.; Mahmood, T. Picture Fuzzy N-Soft Sets and Their Applications in Decision-Making Problems. Fuzzy Inf. Eng. 2021, 13, 335–367. [Google Scholar] [CrossRef]
  24. Feng, F.; Jun, Y.B.; Liu, X.Y.; Li, L.F. An adjustable approach to fuzzy soft set based decision making. J. Comput. Appl. Math. 2010, 234, 10–20. [Google Scholar] [CrossRef]
  25. Qin, H.; Ma, X.; Wang, J. A Novel Approach to Decision Making Based on Interval-Valued Fuzzy Soft Set. Symmetry 2021, 13, 2274. [Google Scholar] [CrossRef]
  26. Khan, A.; Yang, M.; Haq, M.; Shah, A.A.; Arif, M. A New Approach for Normal Parameter Reduction Using σ-Algebraic Soft Sets and Its Application in Multi-Attribute Decision Making. Mathematics 2022, 10, 1297. [Google Scholar] [CrossRef]
  27. Henriksen, M. Ideals in semirings with commutative addition. Am. Math. Soc. Not. 1958, 6, 321. [Google Scholar]
  28. Iizuka, K. On Jacobson radical of a semiring. Tohoku Math. J. 1959, 11, 409–421. [Google Scholar] [CrossRef]
  29. LaTorre, D.R. On h-ideals and k-ideals in hemirings. Publ. Math. 1965, 12, 219–226. [Google Scholar] [CrossRef]
  30. Jun, Y.B.; Öztürk, M.A.; Song, S.Z. On fuzzy h-ideals in hemirings. Inform. Sci. 2004, 162, 211–226. [Google Scholar] [CrossRef]
  31. Zhan, J.; Dudek, W.A. Fuzzy h-ideals of hemirings. Inform. Sci. 2007, 177, 876–886. [Google Scholar] [CrossRef]
  32. Yin, Y.; Li, H. The characterizations of h-hemiregular hemirings and h-intra-hemiregular hemirings. Inform. Sci. 2008, 178, 3451–3464. [Google Scholar] [CrossRef]
  33. Anjum, R. Some Studies in Fuzzy Hemirings. Ph.D. Thesis, Department of Mathematics, Quaid-i-Azam University, Islamabad, Pakistan, 2011. [Google Scholar]
  34. Anis, S.; Khan, M.; Jun, Y.B. Hybrid ideals in semigroups. Cogent Math. 2017, 4, 1352117. [Google Scholar] [CrossRef]
  35. Jun, Y.B.; Song, S.Z.; Muhiuddin, G. Hybrid structures and applications. Ann. Commun. Math. 2018, 1, 11–25. [Google Scholar]
  36. Muhiuddin, G.; Kadi, D.A.; Mahboob, A. Hybrid structures applied to ideals in BCI-Algebras. J. Math. 2020, 2020, 2365078. [Google Scholar] [CrossRef]
  37. Muhiuddin, G.; Kadi, D.A.; Mahboob, A. Ideal theory of BCK/BCI-Algebras based on hybrid structures. J. Math. Comput. Sci. 2021, 23, 136–144. [Google Scholar] [CrossRef]
  38. Elavarasan, B.; Porselvi, K.; Jun, Y.B. Hybrid generalized bi-ideals in semigroups. Int. J. Math. Comp. 2019, 14, 601–612. [Google Scholar]
  39. Elavarasan, B.; Jun, Y.B. Regularity of semigroups in terms of hybrid ideals and hybrid bi-ideals. Kragujev. J. Math. 2022, 46, 857–864. [Google Scholar] [CrossRef]
  40. Hadi, A.; Khan, A.; Jun, Y.B. Hemirings characterized by their hybrid h-ideals. Bull. Sect. Log. 2022, 3, 100–112. [Google Scholar]
  41. Khan, A.; Hadi, A.; Ibrar, M.; Jun, Y.B. Hybrid structures applied to hemirings. J. Intell. Fuzzy Syst. 2019, 37, 4873–4889. [Google Scholar] [CrossRef]
  42. Tripathy, B.K.; Sooraj, T.R.; Mohanty, R.K. A New Approach to Fuzzy Soft Set Theory and Its Application in Decision Making. In Computational Intelligence in Data Mining—Volume 2: Proceedings of the International Conference on CIDM, 5–6 December 2015; Springer: New Delhi, India, 2016. [Google Scholar]
Figure 1. Flow diagram of the proposed algorithm.
Figure 1. Flow diagram of the proposed algorithm.
Mathematics 11 03683 g001
Figure 2. Hierarchical structure for the selection of school for implanted child.
Figure 2. Hierarchical structure for the selection of school for implanted child.
Mathematics 11 03683 g002
Figure 3. Scores of alternatives for the selection of best school for implanted child.
Figure 3. Scores of alternatives for the selection of best school for implanted child.
Mathematics 11 03683 g003
Table 1. Cayley table for the binary operations ∔ and ⋄.
Table 1. Cayley table for the binary operations ∔ and ⋄.
φ A φ B φ C φ D φ A φ B φ C φ D
φ A φ A φ B φ C φ D φ A φ A φ A φ A φ A
φ B φ B φ A φ B φ C φ B φ A φ B φ B φ B
φ C φ C φ B φ B φ C φ C φ A φ B φ B φ B
φ D φ D φ C φ C φ B φ D φ A φ B φ B φ B
Table 2. Tabular representation of ḦyH-BI Z 1 ˜ = ( ξ 1 z S , η 1 z F ) .
Table 2. Tabular representation of ḦyH-BI Z 1 ˜ = ( ξ 1 z S , η 1 z F ) .
N ξ 1 z S η 1 z F
φ A { H 1 , H 2 , H 3 , H 4 , H 5 } 0.2
φ B { H 1 , H 2 , H 3 , H 4 } 0.4
φ C { H 1 , H 2 } 0.7
φ D { H 1 } 0.8
Table 3. Tabular representation of ḦyH-BI Z 2 ˜ = ( ξ 2 z S , η 2 z F ) .
Table 3. Tabular representation of ḦyH-BI Z 2 ˜ = ( ξ 2 z S , η 2 z F ) .
N ξ 2 z S η 2 z F
φ A { H 1 , H 2 , H 3 , H 4 } 0.3
φ B { H 1 , H 2 , H 3 } 0.5
φ C { H 1 , H 2 } 0.7
φ D { H 1 } 0.9
Table 4. Tabular representation of ḦyH-BI Z 3 ˜ = ( ξ 3 z S , η 3 z F ) .
Table 4. Tabular representation of ḦyH-BI Z 3 ˜ = ( ξ 3 z S , η 3 z F ) .
N ξ 3 z S η 3 z F
φ A { H 1 , H 3 , H 4 , H 5 } 0.2
φ B { H 3 , H 4 , H 5 } 0.3
φ C { H 4 , H 5 } 0.6
φ D { H 4 } 0.8
Table 5. The tabular description of hybrid structure.
Table 5. The tabular description of hybrid structure.
N ξ 1 z S η 1 z F
φ A 1 ξ 1 z S ( φ A 1 ) η 1 z F ( φ A 1 )
φ A 2 ξ 1 z S ( φ A 2 ) η 1 z F ( φ A 2 )
...
...
φ A n ξ 1 z S ( φ A n ) η 1 z F ( φ A n )
Table 6. Cayley tableof the binary operations ⋄ and ∔.
Table 6. Cayley tableof the binary operations ⋄ and ∔.
φ A φ B φ C φ D φ E φ A φ B φ C φ D φ E
φ A φ A φ B φ C φ D φ E φ A φ A φ A φ A φ A φ A
φ B φ B φ D φ B φ C φ B φ B φ A φ B φ C φ D φ E
φ C φ C φ B φ C φ D φ C φ C φ A φ C φ C φ C φ E
φ D φ D φ C φ D φ B φ D φ D φ A φ D φ C φ B φ E
φ E φ E φ B φ C φ D φ E φ E φ A φ E φ E φ E φ A
Table 7. Tabular representation of hybrid structure.
Table 7. Tabular representation of hybrid structure.
N ξ 1 z S η 1 z F
φ A { S 1 , S 2 , S 3 , S 5 } 0.5
φ B { S 1 , S 2 , S 3 } 0.8
φ C { S 1 , S 5 } 0.3
φ D { S 3 , S 4 , S 5 } 0.4
φ E { S 1 , S 2 } 0.7
Table 8. Tabular representation of ξ 1 z S : N ( C ) .
Table 8. Tabular representation of ξ 1 z S : N ( C ) .
S 1 S 2 S 3 S 4 S 5
φ A 11101
φ B 11100
φ C 10001
φ D 00111
φ E 11000
Table 9. Tabular representation of η 1 z F : N [ 0 , 1 ] .
Table 9. Tabular representation of η 1 z F : N [ 0 , 1 ] .
η 1 z F
φ A 0.5
φ B 0.8
φ C 0.3
φ D 0.4
φ E 0.7
Table 10. Priority table (PT).
Table 10. Priority table (PT).
φ A φ B φ C φ D φ E Row-Sum
S 1 0.5 0.8 0.3 0 0.7 2.3
S 2 0.5 0.8 0.3 00 1.6
S 3 0.5 000 0.7 1.2
S 4 00 0.3 0.4 0.7 1.4
S 5 0.5 0.8 000 1.3
Table 11. Comprison Table (CT).
Table 11. Comprison Table (CT).
S 1 S 2 S 3 S 4 S 5
S 1 0 0.7 1.1 0.9 1.0
S 2 0.7 0 0.4 0.2 0.3
S 3 1.1 0.4 0 0.2 0.1
S 4 0.9 0.2 0.2 0 0.1
S 5 1.0 0.3 0.1 0.1 0
Table 12. Score of alternatives.
Table 12. Score of alternatives.
AlternativesScore
S 1 3.7
S 2 0.2
S 3 1.8
S 4 0.9
S 5 1.3
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Hadi, A.; Khan, A.; Faiz, N.; Khan, D.M.; Bantan, R.A.R.; Elgarhy, M. Exploring Hybrid H-bi-Ideals in Hemirings: Characterizations and Applications in Decision Making. Mathematics 2023, 11, 3683. https://doi.org/10.3390/math11173683

AMA Style

Hadi A, Khan A, Faiz N, Khan DM, Bantan RAR, Elgarhy M. Exploring Hybrid H-bi-Ideals in Hemirings: Characterizations and Applications in Decision Making. Mathematics. 2023; 11(17):3683. https://doi.org/10.3390/math11173683

Chicago/Turabian Style

Hadi, Asmat, Asghar Khan, Nosheen Faiz, Dost Muhammad Khan, Rashad A. R. Bantan, and Mohammed Elgarhy. 2023. "Exploring Hybrid H-bi-Ideals in Hemirings: Characterizations and Applications in Decision Making" Mathematics 11, no. 17: 3683. https://doi.org/10.3390/math11173683

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop