2. Materials and Methods
Definition 1 ([1]). Let be the universal set, be the parameter set (), be the power set of and Ỻ . A pair Ỻ) is called a soft set () over where is a set-valued function such that Ỻ .
Henceforth, let (U) denote the collections of all the s defined over U, (U) denote the collection of all s over U with the fixed Ỻ, where Ỻ⊆E. That is, while in (U), each soft set has Ỻ as its ; whereas in (U), the may vary.
Definition 2 ([40]). Let (F,Ỻ) be an . (F,Ỻ) is called a relative null with respect to the Ỻ, denoted by , if for all ∈Ỻ. Ỻ) is called a relative whole with respect to the Ỻ, denoted by , if for all ∈Ỻ. The relative whole with respect to is called the absolute .
We denote by
the unique
with an empty
, called the empty
. It should be noted that
and
are distinct
s [
41]. Unless stated otherwise, we consider
s with non-empty
in what follows.
Maji et al. [
34] first proposed the notion of a soft subset, referred to here as a soft M-subset—as defined below.
Definition 3 ([34]). Let (Ђ,℣) and (Q,Ͷ) be two s. (Ђ,℣) is called a soft M-subset of (Q,Ͷ), denoted by (Ђ, ℣) (Q,Ͷ), if ℣ Ͷ and Ђ(չ) = Q(չ), for all չ∈℣. (Ђ,℣) and (Q,Ͷ) are said to be soft M-equal, denoted by (Ђ,W) (Q,Ͷ), if (Ђ,℣) (Q,Ͷ) and (Q,Ͷ) (Ђ,℣).
Definition 4 ([35]). Let (Ђ,℣) and (Q,Ͷ) be two s. (Ђ,℣) is called a soft F-subset of , denoted by if ℣ and , for all չ∈℣. and are said to be soft F-equal, denoted (Ђ,W) (Q,Ͷ), if and .
It should be noted that the definitions of a soft F-subset and soft F-equality were initially introduced by Pei and Miao [
36], although several papers incorrectly attribute these definitions to Feng et al. [
37]. For this reason, the notation “F” refers to Feng.
Proposition 1 ([74]). Let (Ђ,℣) and be s. Then, (Ђ,℣) if and only if (Ђ,℣) .
If two
s satisfy such soft equivalence, then they are essentially identical, as they have the same set of parameters and approximate functions [
75]. Thus, (
Ђ,
℣) means that
, where
℣ and
are fixed subsets of
U.
Definition 5 ([74]). Let (Ђ,℣) and (Q,Ͷ) be two s. (Ђ,℣) is called a soft J-subset of (Q,Ͷ), denoted by (Ђ,℣) (Q,Ͷ), if for all չ∈℣, there exists ն∈ such that Ђ(չ) Q(ն). (Ђ,℣) and (Q,Ͷ) are said to be soft J-equal, denoted (Ђ,W) (Q,Ͷ), if (Ђ,W) (Q,Ͷ) and (Q,Ͷ) (Ђ,℣).
Proposition 2 ([75,76]). Let (Ђ,℣) and (Q,Ͷ) be two s. Then, (Ђ,℣) ⇒ (Ђ,℣) ⇒(Ђ,℣) ; however, the converse may not be true.
Definition 6 ([75]). Let (Ђ,℣) and (Q,Ͷ) be two s. (Ђ,℣) is called a soft L-subset of (Q,Ͷ), denoted by (Ђ,℣)(Q,Ͷ), if for all չ∈℣, there exists ն∈Ͷ such that Ђ(չ) = Q(ն). (Ђ,℣) and (Q,Ͷ) are said to be soft L-equal, denoted (Ђ,℣)(Q, Ͷ), if (Ђ, ℣) (Q, Ͷ) and (Q, Ͷ) (Ђ, ℣).
Proposition 3 ([75]). Let (Ђ,℣) and (Q,Ͷ) be two s. Then, (Ђ,℣) ⇒ (Ђ,℣) ⇒ (Ђ,℣) and (Ђ,℣) ⇒ (Ђ,℣) ⇒ (Ђ,℣) . However, the converse may be true.
Remark 1 ([75]). Soft J-equality is the weakest among the considered equality relations, while soft M-equality (and thus soft F-equality) is the strongest. The soft L-equality lies somewhere in between.
For further discussion on various types of soft equalities, see References [
73,
74,
75,
76,
77,
78,
79,
80,
81].
Definition 7 ([39]). Let (Ђ,℣) be an . The relative complement of an , denoted by is defined by , where is a mapping given by for all .
Definition 8 ([34]). Let (Ђ,℣) and (Q,Ͷ) be two s. The AND-product (∧-product) of the s (Ђ,℣) and (Q,Ͷ) is an defined by (Ђ,℣)∧(Q,Ͷ) = (S,℣xͶ), where S(,) = Ђ()∩Q() for all (,)∈℣x.
Definition 9 ([34]). Let (Ђ,℣) and (Q,Ͷ) be two s. The OR-product (∨-product) of the s (Ђ,℣) and (Q,Ͷ) is an defined by (Ђ,℣)∨(Q,Ͷ) = (S,℣xͶ), where S(,) = Ђ()Q() for all (,)∈℣x .
Definition 10 ([55]). Let and be s The restricted intersection of and , denoted by , is defined as =(Y,S), where Here, if , then Ђ(չ) , for all , and if , then .
Definition 11 ([55]). Let and be s The restricted union of and , denoted by , is defined as = (Y,S), where Here, if , then Ђ(չ) , for all , and if , then .
Definition 12 ([39]). Let and be s The extended intersection of and is the (Y,S), denoted by , where , and for all ,
Definition 13 ([34]). Let and be s The extended union of and is the (Y,S), denoted by , where , and for all ,
Definition 14 ([83]). Let and be s The soft binary piecewise intersection operation of and is the (Y,), denoted by where for all չ∊,
Definition 15 ([83]). Let and be s The soft binary piecewise union operation of and is the (Y,), denoted by where for all չ∊,
3. Results
This section presents a comprehensive investigation of the OR-product in the context of algebraic properties, particularly with respect to various types of soft subsets and equalities—most notably, M-subsets and M-equality. Furthermore, the results are compared with those previously established in the literature [
34,
39,
40,
48,
75,
76]. The following results can be viewed as algebraic symmetries of the OR-product, reflecting the balance, regularity, and harmony of operations within soft set theory.
Proposition 4. SE(U) is closed under OR-product. That is, if (Զ,Ỻ) and ,Ͷ) are two s over U, then their OR-product (Զ,Ỻ)∧(Պ,Ͷ) is also a over U.
Proposition 5. (U) is not closed under OR-product.
Proof. Let (Զ,Ỻ) and (Պ,Ỻ) (U). Then, (Զ,Ỻ)(Պ,Ỻ) SỺxỺ(U); that is, (Զ,Ỻ)(Պ,Ỻ)(U). □
Example 1. Let be the , Ỻ be the subset of , be the universal set, and (Զ,Ỻ) and (Պ,Ỻ) be s over such that
Let (Զ,Ỻ)(Պ,Ỻ),
ỺxỺ). Thereby, It is observed that (,ỺxỺ) SỺxỺ, which implies thatSỺ(U) is not closed under OR-product.
Note 1. Maji et al. [
34]
proposed that the associative law holds for the OR-product as regards soft M-equality (and, consequently, soft F-equality). However, in [
39]
, it was demonstrated that since, from a set-theoretic perspective, Ỻ x(Ͷ x Ѡ) (ỺxͶ)xѠ. That is, the associativity fails under soft M-equality due to the non-associativity of the Cartesian product of parameter sets. As shown in [
75]
, the associative law for the OR-product holds only in the sense of soft L-equality, rather than soft M-equality. Proposition 6 ([75]). (Զ,Ỻ)∨(Պ,Ͷ)∨(Ք,Ѡ)) ((Զ,Ỻ)∨(Պ,Ͷ))∨(Ք,Ѡ) (Generalized Soft Associative Laws).
Example 2. Let be the , , and be the subsets of , be the universal set, and , and () be s over such that
We show that and . Since from a set-theoretic point of view . Let , then Let . Thus,
Assume that . Thereby, . Suppose that . Therefore,
It is observed that.
Note 2. By Proposition 4 and Proposition 6, it can be deduced that the algebraic structure (SE(U),) forms a semigroup only in the sense of L-soft equality, not in the sense of M-soft equality. Moreover, since the OR-product is not closed in (U), it follows from Proposition 5 and Example 1 that the structure ((U),∨) cannot be a semigroup, even in the sense of the soft L-equality.
Proposition 7 ([76]). Let (Զ,Ỻ) and (Պ,Ͷ) be two s. Then, (Զ,Ỻ)∨(Պ,Ͷ)(Պ,Ͷ)∨(Զ,Ỻ) (Generalized soft commutative laws).
Proposition 8. Let (Զ,Ỻ),(Պ,Ỻ) and (Պ,Ͷ) be s. Then, (Զ,Ỻ)∨(Պ,Ͷ) (Պ,Ͷ)(Զ,Ỻ), moreover (Զ,Ỻ)∨(Պ,Ỻ) (Զ,Ỻ).
Proof. Since ỺxͶͶxỺ, it is evident that (Զ,Ỻ)∨(Պ,Ͷ)(Պ,Ͷ)(Զ,Ỻ). Suppose that (չ,ն)ỺxỺ such that չ ն and let (Զ,Ỻ)∨(Պ,Ỻ) = (H,ỺxỺ), where H(չ,ն) = Զ(չ)Պ(ն) for all (չ,ն)ỺxỺ and (Պ,Ỻ)(Զ,Ỻ) = (K,ỺxỺ), where K(չ,ն) = Պ(չ)Զ(ն) for all (չ,ն)ỺxỺ. Since Զ(չ)Պ(ն) is not necessarily equal to Պ(չ)Զ(ն), it follows that (Զ,Ỻ)(Պ,Ỻ)(Պ,Ỻ)∨(Զ,Ỻ). □
Example 3. Let be the , be the subset of , be the universal set, and and be s over such that
Let . Thereby, Let . Thus, It is observed that , which implies that OR-product is not commutative in the sense of M-equality, and even thes involved have the sames.
Proposition 9. Let (Զ,Ỻ) and (Պ,Ͷ) be two s. If (Զ,Ỻ)(Պ,Ͷ), then (Զ,Ỻ)∨(Պ,Ͷ)(Զ,Ỻ).
Example 4 illustrates that Proposition 9 cannot be reversed in general, that is, (Զ,Ỻ)(Պ,Ͷ)(Պ,Ͷ)∨(Զ,Ỻ) does not imply that (Զ,Ỻ)(Պ,Ͷ).
Example 4. Let E = {, , , } be the , Ỻ = Ͷ = {, be the subsets of E and U = {, , , , } be the universal set. Let (Զ, Ỻ) and (Պ,Ͷ) be s defined as follows:
Then,
It is observed that (Զ,Ỻ)∨(Պ,Ͷ) (Պ,Ͷ)∨(Զ,Ỻ); however, (Զ,Ỻ) (Պ,Ͷ).
Proposition 10 ([76]). Let (Զ,Ỻ) be an . Then, (Զ,Ỻ)∨.
Note 3. By Proposition 10, it follows that commutes with any whose is Ͷ under OR-product as regards soft L-equality. In addition, serves as the absorbing element of OR-product in (U) as regards L-equality.
Proposition 11. Let (Զ,Ỻ) be an . Then, (Զ,Ỻ)∨.
Note 4. By Proposition 11, we deduce that commutes with any under OR-product, and is the absorbing element for OR-product in SE(U) as regards L-equality.
Proposition 12. Let (Զ,Ỻ) be an . Then, (Զ,Ỻ)∨(Զ,Ỻ) .
Proof. Let = (S,Ỻ), where S(չ) = for all չ∈Ỻ. Then, (Զ,Ỻ)∨ (Զ,Ỻ)∨(S,Ỻ) (H,ỺxỺ), where H(չ,ն) = Զ(չ) = for all (չ,ն)ỺxỺ. Hence, (H,ỺxỺ) .
Let (Զ,Ỻ) (S,Ỻ)∨ (K,ỺxỺ), where K(չ,ն) = for all (չ,ն) ỺxỺ. Hence, (K,ỺxỺ) . □
Remark 2. Proposition 12 demonstrates that, although commutes with any whose is Ỻ under OR-product as regards soft M-equality as well; is not the absorbing element for OR-product in (U) when considered under M-equality.
Proposition 13. Let (Զ,Ỻ) and (Պ,Ͷ) be two s. If (Զ,Ỻ) =or (Պ,Ͷ) = then (Զ,Ỻ)∨(Պ,Ͷ) needs not be soft M-equal to (Պ,Ͷ)∨(Զ,Ỻ).
Proof. Without loss of generality, let (Պ,Ͷ) . Then, (Զ,Ỻ)∨, (Պ,Ͷ)(Զ,Ỻ) = (Զ,Ỻ). Since □
Example 5. Let be the , and be the subsets of , be the universal set, and and be s over such that
Let , where Let , where It is observed that .
Proposition 14 ([76]). Let (Զ,Ỻ) be an . Then, (Զ,Ỻ).
Proposition 15. Let (Զ,Ỻ) be an . Then, (Զ,Ỻ)∨(Զ,Ỻ).
Note 5. Propositions 14 and 15 show that commutes with any with Ỻ under OR-product and is the identity element for OR-product in (U) under OR-product as regards soft L-equality. Moreover, commutes with any under OR-product, and is the identity element for OR-product in SE(U) as regards L-equality, not M-equality.
Example 6. Let E = {,,} be the , Ỻ = {, be the subset of E and U = {,,,,} be the universal set. Let (Զ,Ỻ) and (Պ,E) be s defined as follows:
Then,
It is observed that (Զ,Ỻ)∨(Զ,Ỻ); however, (Զ,Ỻ)∨(Զ,Ỻ) and (Զ,Ỻ)(Զ,Ỻ).
Proposition 16. Let (Զ,Ỻ) and (Պ,Ỻ) be s. If either (Զ,Ỻ) or (Պ,Ỻ) , then it does not necessarily follow that (Զ,Ỻ)∨(Պ,Ỻ) (Պ,Ỻ)∨(Զ,Ỻ).
Example 7. Let E = {,,,} be the , Ỻ = {, be the subset of E and U = {,,,,} be the universal set. Let (Զ,Ỻ) and (Պ,Ỻ) be s defined as follows:
Then,
It is observed that (Պ,Ỻ)(Պ,Ỻ).
Proposition 17. Let (Զ,Ỻ) and (Պ,Ỻ) be s. If one of the s is , then (Զ,Ỻ)∨(Պ,Ỻ) (Պ,Ỻ)∨(Զ,Ỻ) if and only if the other is a constant function (CF), that is, a whose approximate value is the same subset of U for every parameter in Ỻ.
Proof. Without loss of generality, let (Զ,Ỻ) and (Պ,Ỻ) be s such that (Զ,Ỻ).
Necessity: Let (Զ,Ỻ)∨(Պ,Ỻ)(Պ,Ỻ)(Զ,Ỻ), that is, (Պ,Ỻ)(Պ,Ỻ)∨. Suppose that (չ,ն)ỺxỺ such that չ ն. Then, (Պ,Ỻ)(Պ,Ỻ) implies that Պ(ն) = Պ(չ), where չ ն. We observe that Պ(չ) = Պ(չ) is already satisfied for all (չ,ն)ỺxỺ such that չ ն. Thus, the condition holds automatically in this case and provides no constraint on Պ
Let (չ,ն)ỺxỺ such that չ ն. Suppose (Պ,Ỻ)(Պ,Ỻ)∨. Then, by the definition of the OR-product, this implies that Պ(ն) = Պ(չ), which simplifies to Պ(չ) = Պ(ն). Since this must hold for all for all (չ,ն)ỺxỺ with չ ն, it follow that Պ assigns the same subset of U to every parameter in Ỻ, that is, Պ is an CF.
Sufficiency: Let (Զ,Ỻ) and Պ be an CF. Let (Զ,Ỻ)∨(Պ,Ỻ)(H,ỺxỺ), where H(չ,ն) = Զ(չ)Պ(ն) =Պ(ն) = Պ(ն) for all (չ,ն)ỺxỺ. Let (Պ,Ỻ)(Զ,Ỻ) = (W, ỺxỺ), where W(չ,ն) = Պ(չ)(ն) =Պ(չ)= Պ(չ), for all (չ,ն)ỺxỺ. Since Պ is an CF, it follows that Պ(չ) = Պ(ն) for all չ, ն. Hence, H(չ,ն) = W(չ,ն) for all (չ,ն)ỺxỺ, which implies that (H, ỺxỺ)(W, ỺxỺ). Thus, (Զ,Ỻ)∨(Պ,Ỻ)(Պ,Ỻ)∨(Զ,Ỻ). □
Proposition 18. Let (Զ,Ỻ) be an . Then, (Զ,Ỻ)(Զ,Ỻ)∨.
Proof. Since , and is the unique with an empty , the result follows immediately. □
Note 6. Proposition 18 shows that commutes with any under the OR-product in SE(U), and that is the absorbing element of OR-product in SE(U) with respect to soft M-equality, soft L-equality and soft J-equality. Therefore, combining Propositions 11 and 18, we observe that both and are the absorbing elements for OR-product in SE(U) as regards L-equality. However, it is well-known that a magma can have at most one absorbing element. That is, within a binary operation on a set, two distinct absorbing elements cannot coexist. Hence, it is not possible that for (SE(U),∨) to have two different absorption elements under soft M-equality. In fact, is the unique absorbing element for the OR-product in SE(U) in the sense of soft M-equality.
Corollary 1. Let (Զ,Ỻ) and (Պ,Ͷ) be s. Then, (Զ,Ỻ)∨(Պ,Ͷ) (Պ,Ͷ)∨(Զ,Ỻ) if and only if Ỻ = Ͷ and Զ(չ)Պ(ն) = Պ(չ)Զ(ն), for all (չ,ն) Ỻx Ỻ such that չ ն.
Example 8. Let E = {,,,} be the , Ỻ = {,} be the subset of E and U =,,} be the universe set. Let (Զ,Ỻ) and (Պ,Ỻ) be the s defined as follows:
Then,
It is observed that (Զ,Ỻ)(Պ,Ỻ)(Պ,Ỻ)(Զ,Ỻ), provided that for all չն, the condition Զ(չ)Պ(ն) = Պ(չ)Զ(ն) holds.
Proposition 19. Let (Զ,Ỻ) and (Պ,Ͷ) be s. (Զ,Ỻ)∨(Պ,Ͷ) if and only if and .
Proof. Necessity: Let (Զ,Ỻ)∨(Պ,Ͷ) (Ք,ỺxͶ), where Ք(չ,ն) = Զ(չ)Պ(ն), for all (չ,ն)ỺxͶ. Let (T,ỺxͶ), where T(չ,ն) = for all (չ,ն) ỺxͶ. Since, Ք(չ,ն) = T(չ,ն) = Զ(չ)Պ(ն) =, then Զ(չ) = for all չ∈Ỻ, and Պ(ն) = for all ն. Hence, and . Sufficiency: It is obvious. □
Proposition 20. Let (Զ,Ỻ) be a . Then, (Զ,Ỻ)∨(Պ,Ͷ) if and only if or
Proposition 21. Let (Զ,Ỻ), (Պ,Ͷ), and (Ք,Ѡ) be s. If (Զ,Ỻ) (Պ,Ͷ), then (Ք,Ѡ) (Պ,Ͷ)∨(Ք,Ѡ) and (Ք,Ѡ)
Proof. Let (Զ,Ỻ)(Պ,Ͷ). Then, Ỻ⊆ and hence, ỺxѠ Ѡ. Moreover, since (Զ,Ỻ) (Պ,Ͷ), then Զ(չ)Պ(չ) for all չ∈Ỻ. Thus, Զ(չ)Ք(ն)Պ(չ)Ք(ն) for all ỺxѠ. Thus, (Ք,Ѡ) (Պ,Ͷ)∨(Ք,Ѡ). The proof of (Ք,Ѡ)(Ք,Ѡ)∨(Պ,Ͷ) is analogous and therefore omitted. □
Proposition 22. Let (Զ,Ỻ), (Պ,Ͷ), and (Ք,Ѡ) be s. If (Զ,Ỻ)∨(Ք,Ѡ)(Պ,Ͷ)∨(Ք,Ѡ) and (Ք,Ѡ), then (Զ,Ỻ) (Պ,Ͷ).
Proof. Let (Զ,Ỻ)∨(Ք,Ѡ)(Պ,Ͷ)∨(Ք,Ѡ) and (Ք,Ѡ)
Then, ỺxѠͶxѠ and Ѡ . Hence, Ỻ⊆Ͷ. Let (Զ,Ỻ)∨(Ք,Ѡ) = (Ђ,ỺxѠ), where Ђ(չ,ն) = Զ(չ)Ք(ն) and (Պ,Ͷ)(Ք,Ѡ) = (Y,ͶxѠ), where Y(չ,ն) = Պ(չ)Ք(ն), for all (չ,ն) ỺxѠ. Since Ỻ⊆Ͷ, չ∈Ỻ implies that չ∈Ͷ. By assumption, since (Ђ,ỺxѠ)(Y,ͶxѠ), then Ђ(չ,ն)Y(չ,ն) for all (չ,ն)ỺxѠ. Thus, Ђ(չ,ն) = Զ(չ)Ք (ն) Պ (չ)Ք(ն) = Y(չ,ն), implying that Զ(չ)Պ(չ) for all չ∈Ỻ. Thus, (Զ,Ỻ)(Պ,Ͷ). □
Note 7. In [
69]
, it was shown that if (Զ,Ỻ), (Պ,Ͷ), (Ք,Ѡ) and (Ђ,D) are s such that (Զ,Ỻ)(Պ,Ͷ) and (Ք,Ѡ)(Ђ,D), then then it follows that (Ք,Ѡ)(Պ,Ͷ)∨(Ђ,D). However, Proposition 23 demonstrates that this property also holds in the context of F-subsets, which are strictly stronger than J-subsets. This implies that the distributive behavior of the OR-product is preserved under a stricter inclusion relation. Proposition 23. Let (Զ,Ỻ), (Պ,Ͷ), (Ք,Ѡ) and (Ђ,D) be s. If (Զ,Ỻ)(Պ,Ͷ) and (Ք,Ѡ)(Ђ,D), then (Ք,Ѡ) (Պ,Ͷ)∨(Ђ,D) and Ք,Ѡ)(Ђ,D)∨(Պ,Ͷ).
Proof. Let (Զ,Ỻ)(Պ,Ͷ) and (Ք,Ѡ)(Ђ,D). Then, Ỻ and Ѡ. Hence, ỺxѠD. By assumption, Զ(չ)Պ(չ) for all չ∈Ỻ and Ք(ն)Ђ(ն) for all ն∈Ѡ. Thus, Զ(չ)Ք(ն) Պ(չ)Ք(ն) for all ỺxѠ. Thus, (Ք,Ѡ)(Պ,Ͷ) (Ђ,D). The proof of Ք,Ѡ)(Ђ,D)(Պ,Ͷ) is analogous and therefore omitted. □
Proposition 24. Let (Զ,Ỻ), (Պ,Ͷ), (Ք,Ѡ) and (Ђ,D) be s. Then, [(Զ,Ỻ)∨(Պ,Ͷ)] (Ք,Ѡ)∨(Ђ,D)] =M[(Զ,Ỻ)(Ք,Ѡ)]∨ (Պ,Ͷ) (Ђ,D)].
Proposition 25. Let (Զ,Ỻ) and (Պ,Ͷ) be s. Then, (Զ,Ỻ)∨(Պ,Ͷ), (Պ,Ͷ)∨(Զ,Ỻ), (Զ,Ỻ)∨(Պ,Ͷ) and (Պ,Ͷ) .
Proposition 26 ([76]). Let (Զ,Ỻ) be an . Then, in general, (Զ,Ỻ)∨(Զ,Ỻ)(Զ,Ỻ); although it holds that (Զ,Ỻ)(Զ,Ỻ)∨(Ψ,Ỻ). Moreover, if (Զ,Ỻ) is a sublattice , then (Զ,Ỻ)∨(Զ,Ỻ)(Զ,Ỻ).
Note 8. Proposition 26 demonstrates that the OR-product is not idempotent with respect to soft J-equality. However, under certain conditions, it is idempotent in the sense of soft L-subset.
Regarding soft M-equality, we have the following results:
Proposition 27. Let (Զ,Ỻ) be an . Then, (Զ,Ỻ)∨(Զ,Ỻ)(Զ,Ỻ).
Proof. OR-product is not idempotent under OR-product as regards soft M-equality since ỺxỺỺ. □
Proposition 28 ([40]). Let (Զ,Ỻ) and (Պ,Ͷ) be s. Then, =M ∨.
Note 9. In [
34]
, it was proposed that the AND-product distributes over the OR-product, and vice versa, with respect to soft M-equality. However, [
39]
demonstrated that these assertions do not hold due to the inequality of the s of the s on both sides of the distributive laws. Similarly, in [
74]
, it was suggested that the AND-product distributes over the OR-product, and vice versa, with respect to soft J-equality; yet counterexamples provided in [
75,
76]
disproved these claims. Finally, the correct formulations of the soft distributive laws were established as follows: Proposition 29 ([75,76]). Let (Զ,Ỻ), (Պ,Ͷ) and (Ք,Ѡ) be s. Then,
- (i)
(Զ,Ỻ)(Պ,Ͷ)∨(Ք,Ѡ))((Զ,Ỻ) ∧(Պ,Ͷ))∨((Զ,Ỻ) ∧(Ք,Ѡ)).
- (ii)
(Զ,Ỻ)∨(Պ,Ͷ)∧(Ք,Ѡ))((Զ,Ỻ)∨(Պ,Ͷ)) ∧((Զ,Ỻ)∨(Ք,Ѡ)).
- (iii)
((Զ,Ỻ)∧(Պ,Ͷ))∨(Ք,Ѡ)((Զ,Ỻ)∨(Ք,Ѡ)) ∧(Պ,Ͷ)∨(Ք,Ѡ)).
- (iv)
((Զ,Ỻ)∨(Պ,Ͷ))∧(Ք,Ѡ)((Զ,Ỻ) ∧(Ք,Ѡ))∨(Պ,Ͷ) ∧(Ք,Ѡ)).
Proposition 30 ([82]). Let (Զ,Ỻ) and (Պ,Ͷ) be s. Then, (Զ,Ỻ)(Պ,Ͷ)(Զ,Ỻ)∨(Պ,Ͷ).
Note 10. In ([
82]
), it is demonstrated by a counterexample that (Զ,Ỻ)(Պ,Ͷ)=
M(Զ,Ỻ)∨(Պ,Ͷ) does not imply (Զ,Ỻ)(Պ,Ͷ). Proposition 31 ([82]). Let (Զ,Ỻ) and (Պ,Ͷ) be s. (Զ,Ỻ)(Պ,Ͷ)=M(Զ,Ỻ)∨(Պ,Ͷ) if and only if Զ and Պ are the same CFs.
Corollary 2 ([82]). Let (Զ,Ỻ) be an . (Զ,Ỻ)∧(Զ,Ỻ)(Զ,Ỻ)∨(Զ,Ỻ) if and only if Զ is an CF.
5. Int-uni Decision-Making Method Applied to OR-Product
In this section, the int-uni operator and int-uni decision function, as defined by Çağman and Enginoğlu [
8], are applied for the OR-product to develop an int-uni decision-making method.
Throughout this section, all OR-products of the
s over
are assumed to be contained in the set
. The approximation function of the OR-product of
and
, denoted by
, is defined as follows:
where
for all
.
Definition 16 ([8]). Let and be over . Then, int-uni operators for OR-product, denoted by and are defined respectively as
Definition 17 ([8]). Let . Then, int-uni decision function for OR-product, denoted by int-uni are defined by
The values int-uni(, called int-uni decision set of , is a subset of .
Assume that a set of parameters and a set of options are given. The int-uni decision-making method, structured as follows, is then employed to select a collection of optimal options tailored to the problem at hand.
Step 1: Select feasible subsets from the collection of parameters.
Step 2: Construct the soft sets (s) corresponding to each selected parameter subset.
Step 3: Compute the OR-product of the constructed soft sets.
Step 4: Determine the product using the int-uni decision function.
We are now ready to demonstrate how soft set theory can be applied to the int-uni decision-making problem using the OR-product.
Example 9. The pilot recruitment process comprises multiple stages, including interviews, psychotechnical assessments, simulator evaluations, and medical examinations. Critical parameters influencing the overall evaluation include candidates’ English language proficiency, technical knowledge, competence in mathematics and physics, visual memory, and social skills. To establish a young and dynamic team of pilots, an airline company has initiated a structured recruitment program. Due to the high volume of applications, the company has implemented a two-stage evaluation framework designed to ensure both efficiency and fairness. This process is jointly administered by Mr. Ahmet from the Human Resources department and Mr. Mehmet, a member of the board of directors.
Stage One: Candidate Filtering
The primary objective of the first stage is to reduce the candidate pool to a manageable size. To this end, the company applies the int–uni decision-making method, a systematic and mathematically rigorous approach for filtering applicants. Mr. Ahmet and Mr. Mehmet evaluate candidates based on their interview performance and examination outcomes, with special attention to eliminating those who fail to demonstrate essential qualities necessary for professional pilot training. The evaluation emphasizes not only overall performance but also specifically targets candidates whose deficiencies in key parameters make them unsuitable for further consideration. This decision-making framework is operationalized through the int–uni method applied to the OR-product of soft sets, ensuring consistency, transparency, and analytical rigor in candidate elimination. During this process, Mr. Ahmet and Mr. Mehmet focus on the parameters they absolutely want to see in candidates to be eliminated. Using the int-uni decision-making method on the OR-product allows them to make well-founded and objective decisions.
Stage Two: Comprehensive Evaluation and Training
Candidates who pass the initial evaluation are invited to participate in a more comprehensive interview process in the second stage. Those who qualify are then enrolled in an intensive training program designed to prepare them for the professional responsibilities of aviation. Upon successful completion of this training, candidates are formally recognized as qualified pilots and integrated into the company’s professional pilot team.
Let denote the universal set of all candidates whose applications have been validated for the pilot recruitment process. Let the set of parameters for identifying candidates to be eliminated be where each parameter ,
corresponds to: : “Not confident and self-disciplined”
: “Insufficient mathematical knowledge and creative ability”
: “Lacking adequate English speaking proficiency”
: “Lacking adequate situational awareness”
: “Not having leadership spirit and the ability to work as part of a team”
: “Poor ability to understand technical information”
: “Unable to remain calm under pressure”
: “Having poor communication skills”
To address the pilot selection problem effectively, we apply the int-uni decision-making method based on the OR-product operation of soft sets. This approach systematically integrates the evaluations of both decision-makers, Mr. Ahmet and Mr. Mehmet, considering the parameters they deem critical for candidate elimination. The method ensures a transparent, rigorous, and fair selection process by filtering out candidates who lack essential qualifications.
The solution procedure is structured as follows:
The decision-makers select the parameters that represent the characteristics they absolutely do want in the pilot candidates who will be eliminated. These sets are defined as follows:
For Mr. Ahmet (): , meaning Mr. Ahmet does not want a pilot who is not confident and self-disciplined, who lacks adequate English speaking proficiency, and who has a poor ability to understand technical information.
For Mr. Mehmet (, meaning Mr. Mehmet does not want a pilot who has insufficient mathematical knowledge and creative ability, who does not have the leadership spirit and the ability to work as part of a team, and who is unable to remain calm under pressure.
These parameters represent undesirable qualities that make a pilot unsuitable for selection, and therefore serve as criteria for their elimination.
In the first stage, the decision makers conduct in-depth interviews with the candidates. Following these interviews, each candidate is systematically evaluated against the predetermined objectives and constraints, represented by the two designated parameter sets, and .
Mr. Ahmet and Mr. Mehmet then construct their respective soft sets (s) by identifying and assessing the specific parameters they consider essential for the elimination of candidates. Based on the parameter sets defined in Step 1, the decision-makers build the corresponding soft sets, denoted by and , respectively.
denotes the soft set constructed by Mr. Ahmet, representing the group of pilot candidates to be eliminated based on the undesirable parameters contained in . Similarly,
denotes the soft set constructed by Mr. Mehmet, representing the group of candidates to be eliminated due to undesirable parameters contained in . It is important to emphasize that, within this framework, the decision makers’ primary objective is not the direct selection of candidates but rather their systematic elimination—an approach necessitated by the exceptionally high volume of applications received.
We first determine :
Thus,
is obtained. We first determine :
is obtained. Therefore,
Thus,
Thus, in the airline company’s pilot recruitment process, out of the 21 candidates, 19 were eliminated during the first stage. The remaining candidates, advanced to the second stage, where they will undergo a comprehensive training program. Candidates who successfully complete this program will be formally admitted to the company’s professional pilot team. The outcome of this first stage reflects the set of options that simultaneously satisfy the elimination criteria established by both Mr. Ahmet and Mr. Mehmet.
By employing the int–uni decision-making method on the OR-product, the process systematically integrates the evaluators’ distinct preferences, ensuring that only the candidates meeting both decision-makers’ requirements remain. This procedure embodies a symmetry of evaluation, where decision-makers participate on equal footing and candidates are judged under balanced and transparent rules. This methodological framework not only guarantees fairness and transparency in candidate selection but also demonstrates the practical applicability of algebraic soft set operations to real-world decision-making scenarios. Unlike conventional decision-making approaches, which often treat evaluation parameters in a rigid or isolated manner, the proposed framework offers a mathematically consistent yet flexible tool for handling multi-criteria decisions under uncertainty.