Next Article in Journal
Effect of the Dzyaloshinskii–Moriya Interaction on Magnonic Activity in Ferromagnetic Nanotubes
Next Article in Special Issue
On the Symmetric Structure of Neutrosophic Rhotrices: Index Characterization, Invertibility, and Decision-Making Applications
Previous Article in Journal
Honeysuckle Pest Detection with a Pyramid Attention Network for Multi-Dimensional Feature Fusion
Previous Article in Special Issue
m-Polar Picture Fuzzy Bi-Ideals and Their Applications in Semigroups
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Double-Framed Bipolar Fuzzy Soft Sets and Algorithmic Approaches with Symmetry for Multi-Criteria Decision-Making Under Uncertainty

by
Shadya M. Mershkhan
1 and
Baravan A. Asaad
1,2,*
1
Department of Mathematics, College of Science, University of Zakho, Zakho 42002, Iraq
2
Department of Computer Science, College of Science, Cihan University-Duhok, Duhok 42001, Iraq
*
Author to whom correspondence should be addressed.
Symmetry 2026, 18(1), 119; https://doi.org/10.3390/sym18010119
Submission received: 16 November 2025 / Revised: 26 December 2025 / Accepted: 4 January 2026 / Published: 8 January 2026

Abstract

The bipolar fuzzy set and bipolar soft set have inspired the development of a new framework called double-framed bipolar fuzzy soft sets (DFBFSSs). This structure represents positive and negative membership information through ordered pairs, enabling a balanced treatment of uncertainty, imprecision, and bi-directional information in complex decision-making scenarios. The fundamental concepts and operations of DFBFSSs are rigorously defined and analyzed. The double-framed formulation is symmetric: exchanging the frames preserves the structure of DFBFSSs. This symmetry enables balanced handling of opposing or complementary information. The key properties of the proposed set show improved handling of uncertainty over existing fuzzy and soft set models. In addition, a decision-making algorithm based on DFBFSSs is developed and applied to a real-world problem to validate the framework’s feasibility. Comparative analysis confirms the method’s robustness and advantages in uncertain, dual-information settings.

1. Introduction

In the social sciences, biological sciences, applied sciences, and physical sciences, there are numerous decision-making problems that frequently include datasets with imprecise and unclear information [1]. Fuzzy set theory was introduced by Zadeh in 1965 as mathematically rigorous approach to handling uncertainty and vagueness, properties that are inherent to everyday life [2]. In classical sets, an item can either belong to the set or not belong to the set, but fuzzy set can account for degrees of membership. They can be defined by degrees of membership between 0 and 1, which quantify the uncertainty or imprecision involved in belonging to a fuzzy sets. Given the lack of precise data in such domains, this flexibility is the reason why fuzzy sets have been widely utilized in a range of disciplines including decision-making [3,4], control system [5], pattern recognition [6,7], artificial intelligence [8,9], and supplier selection [10]. Additional resources are accessible for more research in a variety of fields, including decision-making, in [11,12,13,14,15,16,17,18,19,20,21].
Zhang [22] bipolarized fuzzy sets in 1998, and introduced so-called bipolar-valued fuzzy sets that are ale to model cases when an element can have both positive and negative characteristics. A bipolar-valued fuzzy set is used to describe the membership degrees of each element with the help of two values; one with the positive membership degree while the other with the negative membership degree. The dual structure in dual rating system handles both positive and negative ratings, which is suited to those applications where contradicting evaluation happens, such as sentiment classification or multiple factor risk assessment.
In 1999, Molodtsov introduced soft set theory as a mathematical framework for modeling uncertainty and vagueness [23]. Unlike fuzzy sets, which focus on partial membership, soft sets provide a parameterized description of objects, making them a foundational tool for decision-making under imprecision. This seminal work has inspired extensive research into both their theoretical structure and practical applications across various fields [24,25,26,27,28,29,30]. Soft sets handle uncertainty using parameters instead of membership degrees, making them ideal for situations with undefined criteria. They can be used independently or alongside models like fuzzy sets. The bipolar soft set extends this by integrating both positive and negative information, offering a balanced approach to uncertainty. This dual representation makes it a powerful tool for multi-criteria decision-making and handling inconsistent data [31,32].
Maji et al. [27] extended soft set theory to handle fuzzy membership degrees and led to fuzzy soft sets. The integration of these two models enable a more nuanced treatment of uncertainty, incorporating not only parameterized vagueness-seen in fuzzy logic- but also gradations of membership - evident in the second model. By showing how soft sets are closely related to fuzzy sets, this result highlighted soft sets’ common ancestry with Zadeh’s pioneering work.
In response to problems with bipolar uncertainty, where information consists of both positive and negative components (for example: pros and cons, agreement and disagreement, or risk and benefits), bipolar soft sets were introduced. The soft set and fuzzy soft set could hardly describe such two-sided data. Motivated by bipolar fuzzy sets [33], Abdullah et al. [34] proposed bipolar fuzzy soft sets, integrating the parameterized framework of soft sets and bipolarity to address complex, multidimensional uncertainty. It has been shown to be invaluable in areas such as medical diagnosis, investment analysis, and decision making, where both pro and con arguments need to be weighed at the same time. The bipolarism enables more complex problems to be solved by better modeling of bipolar information and has expanded the area of soft computing. Some recent work includes the development of multi-criteria decision-making frameworks using advanced bipolar fuzzy soft set extensions, which are available in [35,36,37,38].
Inspired by these concerns in this work, a new model called double-framed bipolar fuzzy soft set (DFBFSS) is defined as the combination of bipolar fuzzy set and bipolar soft set as its elements are represented by order pairs of positive and negative memberships grades with their negations. Fundamental ideas like subset relations, equality, complement, null, absolute, intersection and union operations are given in depth, along with numerical examples that help stake the principles. An idea of decision-making problem and general algorithm to solve it are introduced by an application of double-framed bipolar fuzzy soft sets along with a numerical example to demonstrate the applicability of the proposed model. A comparative study of the proposed approach with a few others existing is also given to validate the proposed decision-making process.
The proposed DFBFSS framework is a comprehensive generalization of established soft computing models, as it systematically reduces to them under specific constraints. By setting all negative and negation membership grades to zero, the DFBFSS simplifies to a standard fuzzy soft set (FSS), which models only positive membership. A further constraint, restricting these positive memberships to binary values { 0 , 1 } , reduces it to the classical, crisp soft set (SS). Alternatively, by merely eliminating the negation frames while retaining positive and negative memberships, the model directly becomes a bipolar fuzzy soft set (BFSS). This nested relationship solidifies the DFBFSS as a flexible and unifying superset, backward compatible with prior theories while offering superior expressiveness for complex uncertainty. The following Figure 1 justifies this generalization as follows:

1.1. Objectives

  • To model complex uncertainty by using double-framing to represent both positive and negative aspects of information separately.
  • To create a richer data encoding that allows information to be viewed from two competing perspectives, improving the handling of incomplete or uncertain data.
  • To enable balanced multi-criteria decisions (e.g., benefit vs. cost) by providing a framework to reconcile and jointly evaluate competing objectives.
  • To establish a robust decision mechanism that systematically evaluates both the positive and negative parameters of a situation.
  • To apply DFBFSSs to real-world scenarios characterized by contradictory facts or dual objectives, such as risk assessment.
  • To enhance decision-making in dual-objective systems, like environmental assessments (economy vs. ecology) and financial planning (profit vs. sustainability).

1.2. Research Gap and Motivation

The inspiration for DFBFSSs arises from the need to model complex decisions with conflicting, uncertain information. Unlike models that only use positive and negative memberships, the key innovation of DFBFSSs is the explicit inclusion of the negations of these membership grades. This crucial addition captures a more complete spectrum of expert judgment—such as the distinction between “not good” and “bad”—dramatically enhancing the model’s expressiveness. By separately framing membership and its negation within a double-frame structure, DFBFSSs reduce information loss and ambiguity, enabling nuanced, balanced, and more reliable decision-making in areas like healthcare, finance, and resource management where subtle trade-offs are essential.

1.3. Symmetry in the Positive–Negative Dual Framework

The double-framed architecture of DFBFSSs inherently displays a structural symmetry arising from the two parallel components that encode positive and negative membership information. Swapping these components defines an involutive transformation that preserves the overall structural behavior of the model and the fundamental operations defined on it. This symmetry highlights the balanced role of the two frames and reinforces the suitability of DFBFSSs for representing dual, mutually reflective information within complex systems.

1.4. Main Contributions

The goal of this paper is to introduce DFBFSSs as a novel, generalized framework for improving multi-criteria decision-making (MCDM) under uncertainty and conflicting criteria.
  • Generalization of Models: DFBFSSs unify and extend traditional soft set models by integrating bipolarity, fuzziness, and double-framing to capture graded positive and negative assessments.
  • Theoretical Foundation: We formally define DFBFSSs, establish their set-theoretic operations and algebraic properties, and build a theoretical basis for future work.
  • Practical Application: We develop an MCDM algorithm based on DFBFSSs and demonstrate its effectiveness through a case study, proving its utility in real-world decision scenarios.
  • Comparative Analysis: We compare the DFBFS model with existing approaches, highlighting its advantages and demonstrating its viability as a superior decision-making tool. Together, these contributions establish the DFBFS framework as a significant advancement for robust and nuanced MCDM in complex, ambiguous environments.

1.5. Structure of the Paper

This paper is structured into some sections. Section 2 is about the essential definitions of fuzzy sets, soft sets etc., and their generalized version in which we refer to some aspects related to DFBFSSs. A new framework of DFBFSSs, including its basic definitions and a few preliminary results, is presented in Section 3. This part also investigates set-theoretic operations and algebraic structures between DFBFSSs. Section 4 illustrates the use of DFBFSSs in MCDM through an algorithm used for the assessment and selection of best alternatives in decision problems. An application to model selection for searching a residential apartment to illustrate this algorithm is presented in Section 5. Results achieved by the two proposed algorithms and the reliability of results considering different techniques are compared and discussed in Section 6. Finally, Section 7 gives the summary and conclusions of the paper, including a discussion of DFBFS models’ limitations, hints for future works and possible applications of the DFBFS model and their integration with other new suggested techniques.
This paper develops a theoretical model for double-framed bipolar fuzzy soft sets (DFBFSSs) and organizes its theoretical foundations, applications, and comparative studies in a comprehensive manner, highlighting its usefulness for multi-criteria decision-making (MCDM). As is common in foundational fuzzy-set research, the focus is on theoretical model development, and real-world datasets are not included at this stage; their applicability can be demonstrated in future work.

2. Preliminaries

In order to construct the desired model, it will be helpful to keep in mind the following definitions. keep in mind the following definitions. Λ represents the universal set, Υ an entire set of parameters and Γ , ¬ Γ Υ throughout this work.
Definition 1
([39]). Let Υ = { ρ 1 , ρ 2 , , ρ n } be a set of parameters. Then the NOT set of Υ denoted by ¬ Υ is defined by ¬ Υ = { ¬ ρ 1 , ¬ ρ 2 , , ¬ ρ n } where ¬ ρ i = not ρ i for i = 1 , 2 , , n .
Definition 2
([27]). A fuzzy soft set (FSS) is represented as a pair ( ð , Γ ) , where ð : Γ F P ( Λ ) and F P ( Λ ) is the collection of all fuzzy subsets of Λ.
Definition 3
([22]). A bipolar fuzzy set (BFS) ¯ in Λ is an object having form ¯ = { ( ς , + ( ς ) , ( ς ) ) : ς Λ } where + ( ς ) : Λ [ 0 , 1 ] and ( ς ) : Λ [ 1 , 0 ] are indicated by the positive and negative information, respectively.
Definition 4
([31]). A triple ( , ˘ , Γ ) is called a bipolar soft set (BSS), where : Γ P ( Λ ) and ˘ : ¬ Γ P ( Λ ) , such that ( ρ ) ˘ ( ¬ ρ ) = for all ρ Γ and ¬ ρ ¬ Γ .
Definition 5
([40]). A fuzzy bipolar soft set (FBSS) is represented as a triple triple ( ð , ð ˘ , Γ ) , where ð : Γ F P ( Λ ) and ð ˘ : ¬ Γ F P ( Λ ) such that 0 ð ( ρ ) ( ς ) + ð ˘ ( ¬ ρ ) ( ς ) 1 .
Definition 6
([34]). Define ϑ : Γ B F ( Λ ) , where B F ( Λ ) is the collection of all bipolar fuzzy subsets of Λ. Then a pair ( ϑ , Γ ) is said to be a bipolar fuzzy soft set (BFSS) and defined by ( ϑ , Γ ) = { ( ρ , ( ς , ϱ + ( ς ) , ϱ ( ς ) ) ) : ρ Γ a n d ς Λ } where ϱ + : Λ [ 0 , 1 ] and ϱ : Λ [ 1 , 0 ] are indicated by the positive and negative information, respectively.

3. Double-Framed Bipolar Fuzzy Soft Sets (DFBFSS)

This section is focused on examining the DFBFSS concept and its basic operations as well as discussing its connection with DFBFSSs.
Definition 7.
A triple ( ϑ , ξ , Γ ) is called a DFBFSS over Λ where ϑ : Γ B F ( Λ ) , ξ : ¬ Γ B F ( Λ ) . A mathematical form of ( ϑ , ξ , Γ ) is defined by
( ϑ , ξ , Γ ) = { ( ρ , ϑ ( ρ ) , ξ ( ¬ ρ ) ) : ρ Γ and ¬ ρ ¬ Γ } = ρ , { ( ς , ϱ + ( ς ) , ϱ ( ς ) ) } , { ( ς , η + ( ς ) , η ( ς ) ) } : ρ Γ and ς Λ ,
such that
0 ϱ + ( ς ) + η + ( ς ) 1 ,
and
1 ϱ ( ς ) + η ( ς ) 0 ,
where ϱ + , η + : Λ [ 0 , 1 ] and ϱ , η : Λ [ 1 , 0 ] . The degree of satisfaction of an element ς with the property corresponding to the bipolar fuzzy set ϱ is shown by the positive and negative memberships degree ϱ + ( ρ ) ( ς ) and ϱ + ( ¬ ρ ) ( ς ) , respectively, whereas the degree of satisfaction of η with an implicit feature of η is indicated by the positive and negative membership degree η + ( ρ ) ( ς ) and η ( ¬ ρ ) ( ς ) , respectively, with respect to ϑ and ξ.
Example 1.
Let Λ = { ς 1 , ς 2 , ς 3 } be the set of three smart phones under consideration, Υ = { ρ 1 = cheap, ρ 2 = good storage capacity, ρ 3 = high camera quality} be the set of parameters, ¬ Υ = { ¬ ρ 1 = expensive, ¬ ρ 2 = poor storage capacity, ¬ ρ 3 = low camera quality} and Γ = { ρ 1 , ρ 2 } Υ . Then
( ϑ , Γ ) = ϑ ( ρ 1 ) = ( ς 1 , 0.6 , 0.2 ) ( ς 2 , 0.3 , 0.4 ) ( ς 3 , 0.8 , 0.3 ) ϑ ( ρ 2 ) = ( ς 1 , 0.3 , 0.5 ) ( ς 2 , 0.7 , 0.1 ) ( ς 3 , 0.2 , 0.2 ) ,
and
( ξ , ¬ Γ ) = ξ ( ¬ ρ 1 ) = ( ς 1 , 0.3 , 0.6 ) ( ς 2 , 0.5 , 0.2 ) ( ς 3 , 0.1 , 0.6 ) ξ ( ¬ ρ 2 ) = ( ς 1 , 0.5 , 0.3 ) ( ς 2 , 0.2 , 0.4 ) ( ς 3 , 0.4 , 0.1 ) .
A representative DFBFSS ( ϑ , ξ , Γ ) is presented in Table 1.
To formalize the symmetry introduced in Section 1.3, we define the frame-swap operator S acting on a DFBFSS F by interchanging its positive and negative components. For each ς Λ ,
S ( F ) ( ς ) = ( negative component of F ( ς ) , positive component of F ( ς ) ) .
This operator is involutive, i.e., S ( S ( F ) ) = F , and preserves the main operations of DFBFSSs, providing a formal tool to study the duality and symmetry inherent in this framework.
We emphasize that symmetry is not merely descriptive in the proposed framework, but is formalized as an algebraic invariance via a frame-swap automorphism acting on the class of DFBFSSs.
Definition 8.
Let F = ( ϑ , ξ , Γ ) be a double-framed bipolar fuzzy soft set. The frame-swap operator S is defined by
S ( F ) = ( ξ , ϑ , Γ ) .
Proposition 1 (Symmetry Automorphism of DFBFSSs).
The frame-swap operator S is an involutive automorphism on the class of DFBFSSs, that is,
S 2 = id .
Moreover, S commutes with the basic operations of complement, union, and intersection.
Proof. 
By definition,
S ( S ( ϑ , ξ , Γ ) ) = S ( ξ , ϑ , Γ ) = ( ϑ , ξ , Γ ) ,
hence S 2 = id . For each basic operation ∘, a direct verification shows that
S ( F 1 F 2 ) = S ( F 1 ) S ( F 2 ) ,
which proves invariance under frame swapping.
Therefore, the collection of DFBFSSs together with the frame-swap operator S forms a structure invariant under a nontrivial involutive automorphism. □
Remark 1.
Neither BFSs nor BFSSs admit a frame-swap automorphism preserving all operations, since negation information is not explicitly encoded as an independent evaluative dimension.
Definition 9.
An absolute DFBFSS, denoted by ( Λ ¨ , Φ ¨ , Γ ) , is a DFBFSS ( ϑ , ξ , Γ ) such that ( ϑ , ξ , Γ ) = ρ , { ( ς , 1 , 1 ) } , { ( ς , 0 , 0 ) } : ρ Γ and ς Λ .
Definition 10.
A null DFBFSS, denoted by ( Φ ¨ , Λ ¨ , Γ ) , is a DFBFSS ( ϑ , ξ , Γ ) such that ( ϑ , ξ , Γ ) = ρ , { ( ς , 0 , 0 ) } , { ( ς , 1 , 1 ) } : ρ Γ and ς Λ .
Definition 11.
The DFBFS complement of ( ϑ , ξ , Γ ) , denoted by either ( ϑ , ξ , Γ ) c or ( ϑ c , ξ c , Γ ) , is defined by
( ϑ , ξ , Γ ) c = ( ϑ c , ξ c , Γ ) = ρ , { ( ς , 1 ϱ + ( ς ) , 1 ϱ ( ς ) ) } , { ( ς , 1 η + ( ς ) , 1 η ( ς ) ) } : ρ Γ and ς Λ .
Example 2.
In Example 1, the DFBFS complement of DFBFSS ( ϑ , ξ , Γ ) is presented in Table 2.
Definition 12 (Subset).
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) DFBFSSs. We say that ( ϑ , ξ , Γ ) is an DFBFS subset of ( ϑ 1 , ξ 1 , ß ) , denoted as ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , if
1. 
Γ ß .
2. 
ϑ ( ρ ) ϑ 1 ( ρ )   ( i . e . ,   ϱ ϑ + ( ς ) ϱ ϑ 1 + ( ς ) , ϱ ϑ ( ς ) ϱ ϑ 1 ( ς ) ) and
ξ ( ¬ ρ ) ξ 1 ( ¬ ρ )   ( i . e . ,   η ξ + ( ς ) η ξ 1 + ( ς ) , η ξ ( ς ) η ξ 1 ( ς ) )   ρ Γ , ς Λ and ¬ ρ ¬ Γ .
Example 3.
Let Λ = { ς 1 , ς 2 , ς 3 } be the set of three horses under consideration Υ = { ρ 1 = excellent health, ρ 2 = fully trained, ρ 3 = high price, ρ 4 = high speed} be the set of parameters and ¬ Υ = { ¬ ρ 1 = poor health, ¬ ρ 2 = untrained, ¬ ρ 3 = low price, ¬ ρ 4 = low speed}. Suppose that Γ = { ρ 1 } and ß = { ρ 1 , ρ 2 } are subsets of Υ. Then the representative DFBFSSs ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) are presented in Table 3 and Table 4, respectively.
Then (1.) Γ ß , (2.) ρ Γ , ς Λ and ¬ ρ ¬ Γ , we have ϑ ( ρ ) ϑ 1 ( ρ ) and ξ ( ¬ ρ ) ξ 1 ( ¬ ρ ) . Therefore, ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
Definition 13 (Equal).
Two DFBFSSs ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) are said to be DFBFS equal if ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ , ξ , Γ ) and ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) . We write ( ϑ 1 , ξ 1 , ß ) = ( ϑ , ξ , Γ ) .

4. Operations on DFBFSSs

Definition 14
(OR). The DFBFS OR-operation of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) is a DFBFSS ( , Ω , ) , denoted by ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , and is defined as ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( , Ω , Γ × ß ) where ( γ , ȷ ) Γ × ß , ( ¬ γ , ¬ ȷ ) ¬ Γ × ¬ ß and ς Λ ,
( γ , ȷ ) = ( ϱ ϑ + ( ς ) ϱ ϑ 1 + ( ς ) , ϱ ϑ ( ς ) ϱ ϑ 1 ( ς ) ) a n d Ω ( ¬ γ , ¬ ȷ ) = ( η ξ + ( ς ) η ξ 1 + ( ς ) , η ξ ( ς ) η ξ 1 ( ς ) ) .
Example 4.
In Example 3, ( , Ω , Γ × ß ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) . The representative DFBFSS ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) is presented in Table 5.
Definition 15
(AND). The DFBFS AND-operation of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) is a DFBFSS ( , Ω , ) , denoted by ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , and is defined by ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( , Ω , Γ × ß ) where ( γ , ȷ ) Γ × ß , ( ¬ γ , ¬ ȷ ) ¬ Γ × ¬ ß and ς Λ ,
( γ , ȷ ) = ( ϱ ϑ + ( ς ) ϱ ϑ 1 + ( ς ) , ϱ ϑ ( ς ) ϱ ϑ 1 ( ς ) ) a n d Ω ( ¬ γ , ¬ ȷ ) = ( η ξ + ( ς ) η ξ 1 + ( ς ) , η ξ ( ς ) η ξ 1 ( ς ) ) .
Example 5.
In Example 3, ( , Ω , Γ × ß ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) . The representative DFBFSS ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) is presented in Table 6.
Proposition 2.
If ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) are two DFBFSSs over Λ, then
1. 
( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
2. 
( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
Proof. 
1. From Definitions 11 and 14, ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( c , Ω c , Γ × ß ) , where ( γ , ȷ ) c = ϑ ( γ ) c ϑ 1 ( ȷ ) c and Ω ( ¬ γ , ¬ ȷ ) c = ξ ( ¬ γ ) c ξ 1 ( ¬ ȷ ) c for all ( γ , ȷ ) Γ × ß and ( ¬ γ , ¬ ȷ ) ¬ Γ × ¬ ß .
  • Now, ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c = ( c , Ω c , Γ × ß ) where ( γ , ȷ ) c = ϑ ( γ ) c ϑ 1 ( ȷ ) c and Ω ( ¬ γ , ¬ ȷ ) c = ξ ( ¬ γ ) c ξ 1 ( ¬ ȷ ) c for all ( γ , ȷ ) Γ × ß and ( ¬ γ , ¬ ȷ ) ¬ Γ × ¬ ß . Thus, ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
2.
Its proof is similar to part 1.
Definition 16
(Extended union). The DFBFS extended union of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) , denoted by ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , is a DFBFSS ( , Ω , ) where = Γ ß and ρ :
( ρ ) = ϑ ( ρ ) if ρ Γ ß ϑ 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Example 6.
In Example 3, ( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , where = Γ ß = { ρ 1 , ρ 2 } . The representative DFBFSS ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) is presented in Table 7.
Definition 17
(Extended intersection). The DFBFS extended intersection of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) , denoted by ( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , is a DFBFSS ( , Ω , ) , where = Γ ß and ρ :
( ρ ) = ϑ ( ρ ) if ρ Γ ß ϑ 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Example 7.
In Example 3, ( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , where = Γ ß = { ρ 1 , ρ 2 } . The representative DFBFSS ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) is presented in Table 8.
Definition 18
(Restricted union). The DFBFS restricted union of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) , denoted by ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) , is a DFBFSSs ( , Ω , ) , where = Γ ß and ρ ,
( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) .
Example 8.
In Example 3, ( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) where = A B = { ρ 1 } . The representative DFBFSS ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) is presented in Table 9.
Definition 19
(Restricted intersection). The DFBFS restricted intersection of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) , denoted by ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) , is a DFBFSSs ( , Ω , ) , where = Γ ß and ρ ,
( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) .
Example 9.
In Example 3, ( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) , where = A B = { ρ 1 } . The representative DFBFSS ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) is presented in Table 10.
Proposition 3.
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) , ( ϑ 2 , ξ 2 , ) D F B F S S ( Λ ) . Then
1. 
( Λ ¨ , Φ ¨ , Γ ) c = ( Φ ¨ , Λ ¨ , Γ ) and ( Φ ¨ , Λ ¨ , Γ ) c = ( Λ ¨ , Φ ¨ , Γ ) .
2. 
( Φ ¨ , Λ ¨ , Γ ) ¨ ( ϑ , ξ , Γ ) = ( Φ ¨ , Λ ¨ , Γ ) and ( Φ ¨ , Λ ¨ , Γ ) ¨ ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
3. 
( Λ ¨ , Φ ¨ , Γ ) ( ϑ , ξ , Γ ) = ( Φ ¨ , Λ ¨ , Γ ) and ( Φ ¨ , Λ ¨ , Γ ) ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
4. 
( Φ ¨ , Λ ¨ , Γ ) ¨ ( ϑ , ξ , Γ ) .
5. 
( ϑ , ξ , Γ ) ¨ ( Λ ¨ , Φ ¨ , Γ ) .
6. 
( ( ϑ , ξ , Γ ) c ) c = ( ϑ , ξ , Γ ) .
7. 
If ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , then ( ϑ 1 , ξ 1 , ß ) c   ¨   ( ϑ , ξ , Γ ) c .
8. 
If ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , then ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß ) .
9. 
If ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , then ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) = ( ϑ , ξ , Γ ) .
10. 
If ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) and ( ϑ 1 , ξ 1 , ß )   ¨   ( ϑ 2 , ξ 2 , ) , then ( ϑ , ξ , Γ )   ¨   ( ϑ 2 , ξ 2 , ) .
Proof. 
(1) Let, for simplicity ( Λ ¨ , Φ ¨ , Γ ) = ( 1 , 1 ) , ( 0 , 0 ) . Then
  • ( Λ ¨ , Φ ¨ , Γ ) c = ( 1 1 , 1 ( 1 ) ) , ( 1 0 , 1 0 ) = ( 0 , 0 ) , ( 1 , 1 ) = ( Φ ¨ , Λ ¨ , Γ ) and ( Φ ¨ , Λ ¨ , Γ ) c = ( Λ ¨ , Φ ¨ , Γ ) is similar to above.
The proofs of 2–5 can be directly proven from their definitions.
(6)
Let, for simplicity, ( ϑ , ξ , Γ ) = ( ϱ + , ϱ ) , ( η + , η ) . Then ( ϑ , ξ , Γ ) c = ( 1 ϱ + , 1 ϱ ) , ( 1 η + , 1 η ) and
( ( ϑ , ξ , Γ ) c ) c = 1 ( 1 ϱ + ) , 1 ( 1 ϱ ) , 1 ( 1 η + ) , 1 ( 1 η ) = ( ϑ , ξ , Γ ) .
(7)
Since ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , it follows that Γ ß and ϑ ( ρ ) ϑ 1 ( ρ ) and ξ ( ¬ ρ ) ξ 1 ( ¬ ρ )   ρ Γ . Then, ( ϑ 1 c , ξ 1 c , ß ) ¨ ( ϑ c , ξ c , Γ ) . Hence, ( ϑ 1 , ξ 1 , ß ) c   ¨   ( ϑ , ξ , Γ ) c .
(8)
Since ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , it follows that Γ ß and ϑ ( ρ ) ϑ 1 ( ρ ) and ξ ( ¬ ρ ) ξ 1 ( ¬ ρ )   ρ Γ . Put ( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) . Then = Γ ß and ρ = ß ,
( ρ ) = ϑ 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Then ( , Ω , ) = ( ϑ 1 , ξ 1 , ß ) . Thus ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß ) .
(9)
Since ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) , it follows that Γ ß , ϑ ( ρ ) ϑ 1 ( ρ ) and ξ ( ¬ ρ ) ξ 1 ( ¬ ρ )   ρ Γ . Put ( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) . Then = Γ ß and ρ = Γ ,
( ρ ) = ϑ ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) .
Then ( , Ω , ) = ( ϑ , ξ , Γ ) . Thus ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) = ( ϑ , ξ , Γ ) .
(10)
Since ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) and ( ϑ 1 , ξ 1 , ß )   ¨   ( ϑ 2 , ξ 2 , ) , it follows that Γ ß , ß and ϑ ( ρ ) ϑ 1 ( ρ ) , ϑ 1 ( ρ ) ϑ 2 ( ρ ) and ξ ( ¬ ρ ) ξ 1 ( ¬ ρ ) , ξ 1 ( ¬ ρ ) ξ 2 ( ¬ ρ )   ρ Γ . Therefore, Γ , ϑ ( ρ ) ϑ 2 ( ρ ) and ξ ( ¬ ρ ) ξ 2 ( ¬ ρ ) . Hence, ( ϑ , ξ , Γ )   ¨   ( ϑ 2 , ξ 2 , ) .   □
Proposition 4.
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) D F B F S S ( Λ ) . Then the De-Morgan’s law of  ( ϑ , ξ , Γ )  and  ( ϑ 1 , ξ 1 , ß )  is as follows:
1. 
( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
2. 
( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
3. 
( ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c     ( ϑ 1 , ξ 1 , ß ) c .
4. 
( ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c     ( ϑ 1 , ξ 1 , ß ) c .
Proof. 
1. By Definitions 11 and 16, we obtain ( , Ω , ) c = ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c
c ( ρ ) = ϑ c ( ρ ) if ρ Γ ß ϑ 1 c ( ρ ) if ρ ß Γ ϑ c ( ρ ) ¨ ϑ 1 c ( ρ ) if ρ Γ ß ,
  • and
    Ω c ( ¬ ρ ) = ξ c ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 c ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ c ( ¬ ρ ) ¨ ξ 1 c ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
    Then ( , Ω , ) c = ( ϑ , ξ , Γ ) c ¨ ( ϑ 1 , ξ 1 , ß ) c . Thus ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
2.
By Definitions 11 and 17, we obtain ( , Ω , ) c = ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c
c ( ρ ) = ϑ c ( ρ ) if ρ Γ ß ϑ 1 c ( ρ ) if ρ ß Γ ϑ c ( ρ ) ¨ ϑ 1 c ( ρ ) if ρ Γ ß ,
and
Ω c ( ¬ ρ ) = ξ c ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 c ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ c ( ¬ ρ ) ¨ ξ 1 c ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Then ( , Ω , ) c = ( ϑ , ξ , Γ ) c ¨ ( ϑ 1 , ξ 1 , ß ) c . Thus ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c   ¨   ( ϑ 1 , ξ 1 , ß ) c .
3.
By Definitions 11 and 16, we obtain ( , Ω , ) c = ( ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ) c .
c ( ρ ) = ϑ c ( ρ ) ¨ ϑ 1 c ( ρ ) and Ω c ( ¬ ρ ) = ξ c ( ¬ ρ ) ¨ ξ 1 c ( ¬ ρ ) .
Then ( , Ω , ) c = ( ϑ , ξ , Γ ) c     ( ϑ 1 , ξ 1 , ß ) c . Thus ( ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ) c = ( ϑ , ξ , Γ ) c     ( ϑ 1 , ξ 1 , ß ) c .
The proof of part 4 is in a similar fashion of number 3.
Proposition 5.
Let ( ϑ , ξ , Γ ) D F B F S S ( Λ ) . Then
1. 
( ϑ , ξ , Γ )     ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
2. 
( ϑ , ξ , Γ )     ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
3. 
( ϑ , ξ , Γ )   ¨   ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
4. 
( ϑ , ξ , Γ )   ¨   ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
Proof. 
1. Let ( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ , ξ , Γ ) , where = Γ Γ ϕ and ρ . Then
( ρ ) = ϑ ( ρ ) ¨ ϑ ( ρ ) = ϑ ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ ( ¬ ρ ) = ξ ( ¬ ρ ) .
  • Hence, ( ϑ , ξ , Γ )     ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
2.
Let ( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ , ξ , Γ ) , where = Γ Γ ϕ and ρ = Γ . Then
( ρ ) = ϑ ( ρ ) ¨ ϑ ( ρ ) = ϑ ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ ( ¬ ρ ) = ξ ( ¬ ρ ) .
Hence, ( ϑ , ξ , Γ )     ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
3.
Let ( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ , ξ , Γ ) , where = Γ Γ and ρ = Γ , then
( ρ ) = ϑ ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) .
Hence, ( ϑ , ξ , Γ )   ¨   ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
4.
Let ( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ , ξ , Γ ) , where = Γ Γ and ρ = Γ , then
( ρ ) = ϑ ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) .
Therefore, ( ϑ , ξ , Γ )   ¨   ( ϑ , ξ , Γ ) = ( ϑ , ξ , Γ ) .
Proposition 6.
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) D F B F S S ( Λ ) . Then the absorption of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) is as follows:
1. 
( ϑ , ξ , Γ )   ¨   ( ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ) = ( ϑ , ξ , Γ ) .
2. 
( ϑ , ξ , Γ )   ¨   ( ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ) = ( ϑ , ξ , Γ ) .
3. 
( ϑ , ξ , Γ )     ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) = ( ϑ , ξ , Γ ) .
4. 
( ϑ , ξ , Γ )     ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) = ( ϑ , ξ , Γ ) .
Proof. 
(1) Let ( , Ω , ) be a DFBFS restricted intersection of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) where = Γ ß ϕ . Then
( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) ,
where = Γ ß ϕ . Define if ρ = Γ ß ,   ( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) .
Let ( Q , K , μ ) be a DFBFSS extended union of ( ϑ , ξ , Γ ) and ( , Ω , ) which is
( Q , K , μ ) = ( ϑ , ξ , Γ )   ¨   ( , Ω , )
defined by
Q ( ρ ) = ϑ ( ρ ) if ρ Γ = ( ρ ) if ρ Γ = ϑ ( ρ ) ¨ ( ρ ) if ρ Γ ,
and
K ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ = Ω ( ¬ ρ ) if ¬ ρ ¬ ¬ Γ = ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ .
L.H.S: There are three cases:
Case 1: If ρ Γ , then
Q ( ρ ) = ϑ ( ρ ) if ρ Γ = ϑ ( ρ ) if ρ Γ Q ( ρ ) = ϑ ( ρ ) ,
and
K ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ = ξ ( ¬ ρ ) if ¬ ρ ¬ ¬ Γ K ( ¬ ρ ) = ξ ( ¬ ρ ) .
Thus ( Q , K , μ ) = ( ϑ , ξ , Γ ) .
Case 2: If ρ Γ = Γ ß Γ = , then
Q ( ρ ) = ϑ ( ρ ) if ρ Γ = if ρ Q ( ρ ) = ,
and
K ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ ¬ Γ = if ¬ ρ K ( ¬ ρ ) = .
Thus ( Q , K , μ ) = ( Φ ¨ , Λ ¨ , Γ ) .
Case 3: If ρ Γ , then
Q ( ρ ) = ϑ ( ρ ) ¨ ( ρ ) if ρ Γ a n d = Γ ß = ϑ ( ρ ) ¨ ( ϑ ( ρ ) ¨ ξ ( ρ ) ) = ϑ ( ρ ) since ( ϑ ( ρ ) ¨ ξ ( ρ ) ) ϑ ( ρ ) = ϑ ( ρ ) Q ( ρ ) = ϑ ( ρ ) ,
and
K ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ a n d ¬ = ¬ Γ ¬ ß = ξ ( ¬ ρ ) ¨ ( ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) ) = ξ ( ¬ ρ ) since ( ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) ) ξ ( ¬ ρ ) = ξ ( ¬ ρ ) K ( ρ ) = ξ ( ¬ ρ ) .
Thus, ( Q , K , μ ) = ( ϑ , ξ , Γ ) .
In above three cases, it is satisfied. Consequently, ( ϑ , ξ , Γ )   ¨   ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) = ( ϑ , ξ , Γ ) .
The proof of 2 is similar to the proof of 1.
(3) Let ( , Ω , ) be a DFBFS extended intersection of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) , where = Γ ß . Then
( , Ω , ) = ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
( ρ ) = ϑ ( ρ ) if ρ Γ ß ϑ 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Let ( Q , K , μ ) be a DFBFSS restricted union of ( ϑ , ξ , Γ ) and ( , Ω , ) which is
( Q , K , μ ) = ( ϑ , ξ , Γ )     ( , Ω , ) .
Since μ = Γ = Γ ( Γ ß ) = Γ , we have Q ( ρ ) = ϑ ( ρ ) and K ( ¬ ρ ) = ξ ( ¬ ρ ) . Thus ( Q , K , μ ) = ( ϑ , ξ , Γ ) . Hence, ( ϑ , ξ , Γ )     ( ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) ) = ( ϑ , ξ , Γ ) .
The proof of 4 is similar to the proof of 3.   □
Theorem 1.
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) D F B F S S ( Λ ) . Then the commutativity of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) is as follows:
1. 
( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß )   ¨   ( ϑ , ξ , Γ ) .
2. 
( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß )   ¨   ( ϑ , ξ , Γ ) .
3. 
( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß )     ( ϑ , ξ , Γ ) .
4. 
( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß )     ( ϑ , ξ , Γ ) .
Proof. 
(1) To prove that ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß )   ¨   ( ϑ , ξ , Γ ) . Let ( , Ω , ) be a DFBFSS extended union of ( ϑ , ξ , Γ ) and ( ϑ 1 , ξ 1 , ß ) , where = Γ ß ,. Then
( , Ω , ) = ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ,
defined by
( ρ ) = ϑ ( ρ ) if ρ Γ ß
= ϑ 1 ( ρ ) if ρ ß Γ
= ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß
= ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ
= ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
There are three cases for that
Case 1: If ρ Γ ß , from Equations (2) and (5), we obtain
( ρ ) = ϑ ( ρ ) if ρ Γ ß , Ω ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Case 2: If ρ ß Γ , from Equations (3) and (6)
( ρ ) = ϑ 1 ( ρ ) if ρ ß Γ , Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ .
Case 3: If ρ Γ ß
( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß = ß Γ = ϑ 1 ( ρ ) ¨ ϑ ( ρ ) ,
and
Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß a n d ¬ = ¬ Γ ¬ ß = ξ 1 ( ¬ ρ ) ¨ ξ ( ¬ ρ ) .
Based on the three situations mentioned above, it is determined that
( ρ ) = ϑ 1 ( ρ ) if ρ ß Γ = ϑ ( ρ ) if ρ Γ ß = ϑ 1 ( ρ ) ¨ ϑ ( ρ ) if ρ ß Γ ,
and
Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß = ξ 1 ( ¬ ρ ) ˜ ξ ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ .
Therefore, ( , Ω , ) = ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ , ξ , Γ ) , where = ß Γ . Hence,
( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ , ξ , Γ ) .
The proof of 2 is similar to the proof of 1.
(3) Let ( , Ω , ) = ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) , where = Γ ß ϕ and ρ , we have
( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) and Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) .
Let ( Q , K , μ ) = ( ϑ 1 , ξ 1 , ß )     ( ϑ , ξ , Γ ) , where μ = Γ ß ϕ and ρ μ , we have
Q ( ρ ) = ϑ 1 ( ρ ) ¨ ϑ ( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) and K ( ¬ ρ ) = ξ 1 ( ¬ ρ ) ¨ ξ ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) .
from Equations (12) and (13), we obtain ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) = ( ϑ 1 , ξ 1 , ß )     ( ϑ , ξ , Γ ) .
The proof of 4 is similar to the proof of 3.   □
Theorem 2.
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) , ( ϑ 2 , ξ 2 , ) D F B F S S ( Λ ) . Then the associative property of ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) and ( ϑ 2 , ξ 2 , ) is as follows:
1. 
( ϑ , ξ , Γ ) ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ( ϑ 2 , ξ 2 , ) .
2. 
( ϑ , ξ , Γ ) ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ( ϑ 2 , ξ 2 , ) .
3. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ϑ 2 , ξ 2 , ) .
4. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ϑ 2 , ξ 2 , ) .
Proof. 
(1) Let ( , Ω , D ) be a DFBFS restricted intersection of ( ϑ 1 , ξ 1 , ß ) and ( ϑ 2 , ξ 2 , ) such that ( , Ω , D ) = ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) , where D = Γ ϕ and ρ defined as:
( ρ ) = ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) and Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) .
Let ( Q , K , μ ) be a DFBFS restricted intersection of ( ϑ , ξ , Γ ) and ( , Ω , D ) such that
( Q , K , μ ) = ( ϑ , ξ , Γ ) ( , Ω , D ) ,
which is defined by
Q ( ρ ) = ϑ ( ρ ) ¨ ( ρ ) and K ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) ,
where ρ μ = Γ and ¬ ρ ¬ μ = ¬ Γ ¬ .
Q ( ρ ) = ϑ ( ρ ) ¨ ( ρ ) = ϑ ( ρ ) ¨ ( ϑ 1 ( ρ ) ϑ 2 ( ρ ) ) = ( ϑ ( ρ ) ¨ ϑ 1 ( ρ ) ) ϑ 2 ( ρ ) ,
and
K ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ( ξ 1 ( ¬ ρ ) ξ 2 ( ¬ ρ ) ) = ( ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) ) ξ 2 ( ¬ ρ ) .
Then,
( ϑ , ξ , Γ ) ¨ ( , Ω , D ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ( ϑ 2 , ξ 2 , ) .
Hence,
( ϑ , ξ , Γ ) ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ( ϑ 2 , ξ 2 , ) .
The proof of 2 is similar to the proof of 1.
(3) Suppose that ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) = ( 1 , Ω 1 , ß ) . For all ρ ß , we have the following.
1 ( ρ ) = ϑ 1 ( ρ ) if ρ ß ϑ 2 ( ρ ) if ρ ß ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) if ρ ß ,
and
Ω 1 ( ¬ ρ ) = ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ¬ ß ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ .
Assume that ( ϑ , ξ , Γ ) ¨ ( 1 , Ω 1 , ß ) = ( 2 , Ω 2 , Γ ( ß ) for all ρ Γ ( ß ) , we have the following.
2 ( ρ ) = ϑ ( ρ ) if ρ Γ ß 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ 1 ( ρ ) if ρ Γ ß ,
and
Ω 2 ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ( ß ) Ω 1 ( ¬ ρ ) if ¬ ρ ¬ ( ß ) ¬ Γ ξ ( ¬ ρ ) ¨ Ω 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ( ß ) .
On the other hand, let ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) = ( 3 , Ω 3 , Γ ß )
3 ( ρ ) = ϑ ( ρ ) if ρ Γ ß ϑ 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω 3 ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Suppose that ( 3 , Ω 3 , Γ ß ) ¨ ( ϑ 2 , ξ 2 , ) = ( 4 , Ω 4 , ( Γ ß ) ) = ( 4 , Ω 4 , Γ ( ß ) ) . for all ρ Γ ( ß ) , we have the following.
4 ( ρ ) = 3 ( ρ ) if ρ Γ ß ϑ 2 ( ρ ) if ρ Γ ß ϑ 2 ( ρ ) ¨ 3 ( ρ ) if ρ ( Γ ß ) ,
and
Ω 4 ( ¬ ρ ) = Ω 3 ( ¬ ρ ) if ¬ ρ ¬ ( Γ ß ) ¬ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ¬ ( Γ ß ) ξ 2 ( ¬ ρ ) ¨ Ω 3 ( ¬ ρ ) if ¬ ρ ¬ ( Γ ß ) ¬ .
This implies that
4 ( ρ ) = ϑ ( ρ ) if ρ Γ ß 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ 1 ( ρ ) if ρ Γ ( ß ) ,
and
Ω 4 ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ( ß ) Ω 1 ( ¬ ρ ) if ¬ ρ ¬ ( ß ) ¬ Γ ξ ( ¬ ρ ) ¨ Ω 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ( ß ) .
Since ( 2 , Ω 2 , Γ ( ß ) and ( 4 , Ω 4 , Γ ( ß ) ) are the same set-valued mapping for all ρ Γ ß , the proof is completed.
The proof of part 4 can be proved with the same method of part 3.   □
Theorem 3.
Let ( ϑ , ξ , Γ ) , ( ϑ 1 , ξ 1 , ß ) and ( ϑ 2 , ξ 2 , ) D F B F S S . Then
1. 
( ϑ , ξ , Γ ) ( ( ϑ 1 , ϑ 1 , ß ) ( ϑ 2 , ϑ 2 , ) ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ( ( ϑ , ξ , Γ ) ( ϑ 2 , ξ 2 , ) ) where , { , } and { , ¨ , ¨ , } .
2. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) ) .
3. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ( ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) ) .
4. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ( ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) ) .
5. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) ) .
6. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ( ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) ) .
7. 
( ϑ , ξ , Γ ) ¨ ( ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) ( ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) ) .
Proof. 
(1) Let ( , Ω , D ) be a DFBFS extended union of ( ϑ 1 , ξ 1 , ß ) and ( ϑ 2 , ξ 2 , ) . Then
( , Ω , D ) = ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) ,
where D = ß and is defined by:
( ρ ) = ϑ 1 ( ρ ) if ρ ß = ϑ 2 ( ρ ) if ρ ß = ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) if ρ ß ,
and
Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ = ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ¬ ß = ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ .
Let ( Q , K , μ ) be a DFBFS restricted intersection of ( ϑ , ξ , Γ ) and ( , Ω , D ) which is
( Q , K , μ ) = ( ϑ , ξ , Γ ) ( , Ω , D ) ,
defined by
Q ( ρ ) = ϑ ( ρ ) ¨ ( ρ ) and K ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) ,
where ρ μ = Γ D and ¬ ρ ¬ μ = ( ¬ Γ ) ( ¬ D ) .
From left hand side:
Q ( ρ ) = ϑ ( ρ ) ¨ ( ρ ) and K ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ Ω ( ¬ ρ ) ,
and this implies that ρ Γ and ρ D .
If ρ D = ß , then from (16), there are three cases:
Case 1: If ρ ß , then
( ρ ) = ϑ 1 ( ρ ) if ρ ß , Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ .
Cases 2: If ρ ß , then
( ρ ) = ϑ 2 ( ρ ) if ρ ß , Ω ( ¬ ρ ) = ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ¬ ß .
Cases 3: If ρ ß , then
( ρ ) = ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) if ρ ß , Ω ( ¬ ρ ) = ξ 1 ( ¬ ρ ) ˜ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ .
Based on the above three cases, we obtain, from (18) that
Q ( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ , ρ ß = ϑ ( ρ ) ¨ ϑ 2 ( ρ ) if ρ Γ , ρ ß = ϑ ( ρ ) ¨ ( ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) ) if ρ Γ , ρ ß = ( ϑ ( ρ ) ¨ ϑ 1 ( ρ ) ) ¨ ( ϑ ( ρ ) ¨ ϑ 2 ( ρ ) ) ,
and
K ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ , ¬ ρ ¬ ß ¬ = ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ Γ , ¬ ρ ¬ ¬ ß = ξ ( ¬ ρ ) ¨ ( ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) ) if ¬ ρ ¬ Γ , ¬ ρ ¬ ß ¬ = ( ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) ) ¨ ( ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) ) .
As a result,
Q ( ρ ) = ( ϑ ( ρ ) ¨ ϑ 1 ( ρ ) ) ¨ ( ϑ ( ρ ) ¨ ϑ 2 ( ρ ) ) ,
and
K ( ¬ ρ ) = ( ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) ) ¨ ( ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) ) .
Therefore,
( Q , K , μ ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ( ϑ , ξ , Γ ) ( ϑ 2 , ξ 2 , ) ) .
Also,
( ϑ , ξ , Γ ) ( , Ω , D ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ( ϑ , ξ , Γ ) ( ϑ 2 , ξ 2 , ) ) .
Thus,
( ϑ , ξ , Γ ) ( ( ϑ 1 , ξ 1 , ß ) ¨ ( ϑ 2 , ξ 2 , ) ) = ( ( ϑ , ξ , Γ ) ( ϑ 1 , ξ 1 , ß ) ) ¨ ( ( ϑ , ξ , Γ ) ( ϑ 2 , ξ 2 , ) .
(6) Suppose that ( ϑ 1 , ξ 1 , ß ) ( ϑ 2 , ξ 2 , ) = ( 1 , Ω 1 , ß ) . Forall ρ ß , we have the following.
1 ( ρ ) = ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) and Ω 1 ( ¬ ρ ) = ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) .
Assume that ( ϑ , ξ , Γ ) ¨ ( 1 , Ω 1 , ß ) = ( 2 , Ω 2 , Γ ( ß ) ) = ( 2 , Ω 2 , μ D ) where μ = Γ ß and D = Γ . For all ρ μ D , we have the following.
2 ( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ μ D ϑ ( ρ ) ¨ ϑ 2 ( ρ ) if ρ D μ ϑ ( ρ ) ¨ ( ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) ) if ρ μ D ,
and
Ω 2 ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ μ ¬ D ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ D ¬ μ ξ ( ¬ ρ ) ¨ ( ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) ) if ¬ ρ ¬ μ ¬ D ,
On the other hand, let ( ( ϑ , ξ , Γ ) ¨ ( ϑ 1 , ξ 1 , ß ) ) = ( 3 , Ω 3 , Γ ß )
3 ( ρ ) = ϑ ( ρ ) if ρ Γ ß ϑ 1 ( ρ ) if ρ ß Γ ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ Γ ß ,
and
Ω 3 ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß ξ 1 ( ¬ ρ ) if ¬ ρ ¬ ß ¬ Γ ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ß .
Let ( ϑ , ξ , Γ ) ¨ ( ϑ 2 , ξ 2 , ) = ( 4 , Ω 4 , Γ ) .
4 ( ρ ) = ϑ ( ρ ) if ρ Γ ϑ 2 ( ρ ) if ρ Γ ϑ ( ρ ) ¨ ϑ 2 ( ρ ) if ρ Γ ,
and
Ω 4 ( ¬ ρ ) = ξ ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ ¬ Γ ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ Γ ¬ .
Let ( 3 , Ω 3 , Γ ß ) ( 4 , Ω 4 , Γ ) = ( 5 , Ω 5 , μ D ) , where μ = Γ ß and D = Γ .
For all ρ μ D , we have the following.
5 ( ρ ) = 3 ( ρ ) ¨ 4 ( ρ ) and Ω 5 ( ¬ ρ ) = Ω 3 ( ¬ ρ ) ¨ Ω 4 ( ¬ ρ ) .
In this case, we obtain the following:
5 ( ρ ) = 3 ( ρ ) if ρ μ D 4 ( ρ ) if ρ D μ 3 ( ρ ) ¨ 4 ( ρ ) if ρ μ D ,
and
Ω 5 ( ¬ ρ ) = Ω 3 ( ¬ ρ ) if ¬ ρ ¬ μ ¬ D Ω 4 ( ¬ ρ ) if ¬ ρ ¬ D ¬ μ Ω 3 ( ¬ ρ ) ¨ Ω 4 ( ¬ ρ ) if ¬ ρ ¬ μ ¬ D ,
then
5 ( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ μ D ϑ ( ρ ) ¨ ϑ 2 ( ρ ) if ρ D μ ( ( ϑ ( ρ ) ¨ ϑ 1 ( ρ ) ) ¨ ( ϑ ( ρ ) ¨ ϑ 2 ( ρ ) ) if ρ μ D ,
and
Ω 5 ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ μ ¬ D ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ D ¬ μ ( ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) ) ¨ ( ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) ) if ¬ ρ ¬ μ ¬ D ,
Therefore,
5 ( ρ ) = ϑ ( ρ ) ¨ ϑ 1 ( ρ ) if ρ μ D ϑ ( ρ ) ¨ ϑ 2 ( ρ ) if ρ D μ ϑ ( ρ ) ¨ ( ϑ 1 ( ρ ) ¨ ϑ 2 ( ρ ) ) if ρ μ D ,
and
Ω 5 ( ¬ ρ ) = ξ ( ¬ ρ ) ¨ ξ 1 ( ¬ ρ ) if ¬ ρ ¬ μ ¬ D ξ ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) if ¬ ρ ¬ D ¬ μ ξ ( ¬ ρ ) ¨ ( ξ 1 ( ¬ ρ ) ¨ ξ 2 ( ¬ ρ ) ) if ¬ ρ ¬ μ ¬ D .
Since ( 2 , Ω 2 , μ D ) and ( 5 , Ω 5 , μ D ) are the same set-valued mapping for all ρ μ D , the proof is completed. The remaining parts can be proven with the same method.   □
Definition 20 (Comparison Table).
The comparison table of DFBFSS is a square table with an equal number of rows and columns (square table), both of which are labeled with the universe’s object names ( ρ 1 , ρ 2 , ρ 3 ,…, ρ n ) and the entries l i j , where l i j is the number of parameters for which
  • the positive membership value of l i is less than or equal to the positive membership value of l j ,
  • the negative membership value of l i is greater than or equal to the negative membership value of l j ,
  • the negation of positive membership value of ¬ l i is greater than or equal to the positive membership value of ¬ l j , and
  • the negation of negative membership value of ¬ l i is less than or equal to the negative membership value of ¬ l j .
Definition 21.
Positive ( P i ) and negative ( N i ) information scores with their negations ( ¬ P i ) and ( ¬ N i ) , respectively, are computed where
P i = r i c i ,
¬ P i = ( ¬ r i ) ( ¬ i ) ,
N i = r i c i ,
and
¬ N i = ( ¬ r i ) ( ¬ i ) .
Adjusted Positive ( A P S i ) and negative ( A N S i ) information scores with their negations are computed where
A P S i = ( P i ) ( ¬ P i ) ,
and
A N S i = ( N i ) ( ¬ N i ) .
Adjusted final score ( A F S i ) is computed where
A F S i = A P S i A N S i .

5. Application

The proliferation of these rental apartments is a by-product of population growth that adds unprecedented bigger into urban areas.This increase in demand has made the apartment selection process more important. But families are increasingly getting pushed away, as the seek proximity to schools, access to public transportation and affordable rents. But when demand is high, finding apartments with the most sought-after factors car be difficult, leaving families to weigh compromises like higher rents or longer commutes. This discrepancy between demand and supply only magnifies the hunt for apartments that align with these key factors.
Algorithm. The algorithm and stepwise procedure of DFBFSS for choosing the best option is provided as:
Step 1:
The algorithm begins by accepting a Double-Frame Bipolar Fuzzy Soft Set (DFBFSS) ( ϑ , ξ , Γ ) , where ( ϑ ) is the set of alternatives, ( ξ ) the set of criteria, and ( Γ ) the mapping that assigns to each alternative-criterion pair a tuple of four membership values: positive membership ϱ + , its negation η + , negative membership ϱ , and its negation η . These values, derived from expert judgment or data, are then systematically organized into a decision matrix (tabular form), with rows representing alternatives, columns representing criteria, and each cell containing the corresponding four-dimensional membership tuple. This matrix serves as the structured input, clearly presenting both supporting and opposing evaluations alongside their respective negations for all considered factors.
Step 2:
Normalizing is required if the criteria are not on the same scale. This involves normalizing the decision matrix based on the characteristics of each criterion by using the Definition 11, i.e., for each non-benefit criterion, the normalization operation applies the complement definition to each membership component—for example, transforming the original positive membership ϱ + into 1 ϱ + or a structurally equivalent complement, ensuring all criteria contribute uniformly within the bipolar fuzzy framework while preserving the relational logic between a membership and its negation. Benefit criteria remain unchanged, as their original values are already aligned with the desired direction of preference.
Step 3:
In this step, comparison tabular for functions F and G is computed using Definition 20. The following three steps are found using Definition 21.
Step 4:
Positive ( P i ) and negative ( N i ) information scores with their negations ( ¬ P i ) and ( ¬ N i ) are computed.
Step 5:
Adjusted positive ( A P S i ) and negative ( A N S i ) information scores with their negations are computed.
Step 6:
Adjusted Final score ( A F S i ) is computed.
Step 7:
Find k where A F S k = max 1 i n A F S i .
Step 8:
For k = 1 , 2 , , n , A F S k is the best choice to be chosen.
The overall structure of the proposed decision-making algorithm is illustrated in Figure 2.
The illustrative example used in this study is intentionally simplified to clearly demonstrate the operational mechanism of the proposed DFBFSS framework. Such synthetic examples are standard in the development of new fuzzy set models, where the primary objective is to validate structural behavior and decision consistency before large-scale empirical deployment.
The following section declares a numerical example on the above algorithm in order to verify the feasibility of the proposed method procedure.

6. Numerical Example

A family is searching for a residential apartment and assess their options based on some criteria. Let Λ = { ς 1 , ς 2 , ς 3 , ς 4 , ς 5 , ς 6 } be a set of six apartments. Consider Υ = { ρ 1 = affordability monthly rent, ρ 2 = accessibility to public transport, ρ 3 = schools proximity and ρ 4 = noise levels} be a set of parameters. Also, let the negation set of Υ be ¬ Υ = { ¬ ρ 1 = unaffordability monthly rent, ¬ ρ 2 = no public transport, ¬ ρ 3 = school remoteness and ¬ ρ 4 = quietness levels}. Following a thorough discussion, the family members determine that each apartment will be evaluated using a favorable subset Γ = { ρ 1 , ρ 3 , ρ 4 } of Υ .
Step 1: Input ( D F B F S S )   ( ϑ , ξ , Γ ) (see Table 11) and choice parameters for family (see Table 12, Table 13, Table 14 and Table 15).
Step 2: Normalization is needed in this step as the criteria are not in the same scale (see Table 16, Table 17, Table 18 and Table 19).
Step 3: In this step, comparison tabular for ϱ + , ϱ with their negations ¬ η + and ¬ η , respectively, is used (see Table 20, Table 21, Table 22 and Table 23).
Step 4: Positive and negative information scores with their negations are computed in this step (see Table 24, Table 25, Table 26 and Table 27).
Step 5: Adjusted positive and negative information scores with their negations are computed in this step (see Table 28 and Table 29).
Step 6: Table for adjusted final score (AFS): (See Figure 3)
Step 7: From Table 30, fifth apartment A F S 5 is chosen to the best one among all.

7. Comparative Analysis

The DFBFSS seems to be an enhancement and an interconnection between bipolar fuzzy sets BFS and bipolar soft sets BSS, which serve as foundations for the proposed method. In this section, the suggested set is compared with certain existing ones in order to further confirm the correctness of the suggested approaches such as bipolar fuzzy soft set (BFSS) [34], fuzzy bipolar soft set (FBSS) [40] and fuzzy soft set (FSS) [27]. The details are demonstrated in Table 31 and Figure 4.
Unlike SS, FSS, and BFSS models, the proposed DFBFSS framework explicitly distinguishes between membership, counter-membership, and their negations, enabling symmetric handling of conflicting information.
The following comparative analysis in Table 32 elucidates the theoretical and practical advancements of the DFBFSS framework by benchmarking it against its direct predecessors, clearly demonstrating how its unique capacity to model four-dimensional judgment leads to more nuanced and robust decision outcomes.
Table 32 provides a direct comparison between the proposed DFBFSS-based decision-making method and existing models such as SS, FSS, and BFSS. Unlike these approaches, which rely on single- or two-dimensional evaluations, the DFBFSS framework incorporates four complementary evaluative components: positive membership, negative membership, and their respective negations. This enriched structure allows the proposed method to preserve conflicting and incomplete information that is either ignored or collapsed in traditional models. As a result, the final ranking produced by the DFBFSS method reflects a more balanced and informative aggregation of expert opinions. This demonstrates that the advantage of the proposed approach lies not in numerical dominance but in its superior expressive power and its ability to model dual and contradictory assessments within a unified decision-making framework.
To clarify the distinctive features of the proposed DFBFSS framework and its advantages over existing models, a comparative analysis is summarized in Table 33.
Table 33 clearly demonstrates that the proposed DFBFSS framework uniquely integrates bipolarity, negation semantics, and a dual-frame structure, which collectively enhance its suitability for complex multi-criteria decision-making problems.

8. Conclusions

The bipolar fuzzy set and bipolar soft set have evolved into robust frameworks, paving the way for the development of the theory of double-framed bipolar fuzzy soft sets (DFBFSSs). This innovative model provides a dual-layered structure for representing elements through ordered pairs of positive and negative membership grades, offering a nuanced perspective on uncertainty. Fundamental operations like subset relationships, equality, complement, intersection, and union have been rigorously defined and illustrated with numerical examples, demonstrating the practicality and applicability of DFBFSSs in complex decision-making and information modeling scenarios. In order to confirm the applicability of the suggested model, a numerical example has been provided along with an application of double-framed bipolar fuzzy soft sets to a decision-making problem and a general method to solve it. A comparison between the proposed strategy and some other existing ones has been given in order to verify the feasibility of the proposed decision-making process. This work establishes a formally symmetric extension of bipolar fuzzy soft set theory, introducing a nontrivial automorphism-invariant structure that is not captured by existing fuzzy or bipolar models.
Importantly, the symmetric structure of DFBFSSs preserves the inherent balance between positive and negative information, further enhancing their applicability in complex decision-making scenarios.
Future work will focus on both theoretical and practical extensions of the proposed framework. From a theoretical perspective, the DFBFSS model may be extended to more advanced settings such as intuitionistic, Pythagorean, and q-rung orthopair structures, as well as further investigations into its topological and functional properties. From a practical perspective, future studies will apply the DFBFSS framework to real-world datasets, including medical diagnosis and supplier selection problems, and will compare its performance with BFSS- and FSS-based decision-making models using expert-derived data and established evaluation criteria.

Author Contributions

Conceptualization, S.M.M.; methodology, S.M.M. and B.A.A.; formal analysis, S.M.M.; investigation, B.A.A.; writing—original draft preparation, S.M.M. and B.A.A.; writing—review and editing, B.A.A.; funding acquisition, B.A.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding authors.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Ali, G.; Akram, M.; Koam, A.N.; Alcantud, J.C.R. Parameter reductions of bipolar fuzzy soft sets with their decision-making algorithms. Symmetry 2019, 11, 949. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  3. Bellman, R.E.; Zadeh, L.A. Decision-making in a fuzzy environment. Manag. Sci. 1970, 17, B-141–B-164. [Google Scholar] [CrossRef]
  4. Dubois, D. The role of fuzzy sets in decision sciences: Old techniques and new directions. Fuzzy Sets Syst. 2011, 184, 3–28. [Google Scholar] [CrossRef]
  5. Tong, R.M. Fuzzy control systems: A retrospective. In Proceedings of the 1983 American Control Conference, San Francisco, CA, USA, 22–24 June 1983; pp. 1224–1229. [Google Scholar]
  6. Bezdek, J.C. Pattern Recognition with Fuzzy Objective Function Algorithms; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  7. Pedrycz, W. Fuzzy sets in pattern recognition: Methodology and methods. Pattern Recognit. 1990, 23, 121–146. [Google Scholar] [CrossRef]
  8. Kandel, A.; Schneider, M. Fuzzy sets and their applications to artificial intelligence. Adv. Comput. 1989, 28, 69–105. [Google Scholar]
  9. Kahraman, C.; Onar, S.C.; Oztaysi, B.; Cebi, S. Role of Fuzzy Sets on Artificial Intelligence Methods: A literature. Trans. Fuzzy Sets Syst. 2023, 2, 158–178. [Google Scholar]
  10. Chen, C.-T.; Lin, C.-T.; Huang, S.-F. A fuzzy approach for supplier evaluation and selection in supply chain management. Int. J. Prod. Econ. 2006, 102, 289–301. [Google Scholar] [CrossRef]
  11. Taherdoost, H.; Madanchian, M. Decision making: Models, processes, techniques. Cloud Comput. Data Sci. 2024, 5, 1–14. [Google Scholar] [CrossRef]
  12. Litvaj, I.; Ponisciakova, O.; Stancekova, D.; Svobodova, J.; Mrazik, J. Decision-making procedures and their relation to knowledge management and quality management. Sustainability 2022, 14, 572. [Google Scholar] [CrossRef]
  13. Mu, E. Multicriteria decision making as interdisciplinary research. Int. J. Anal. Hierarchy Process. 2022, 14. [Google Scholar] [CrossRef]
  14. Newell, W.H. Decision Making in Interdisciplinary Studies. In Handbook of Decision Making; Morçöl, G., Ed.; CRC Press/Taylor & Francis Group: New York, NY, USA, 2007; pp. 245–264. [Google Scholar]
  15. Schmude, T.; Koesten, L.; Möller, T.; Tschiatschek, S. Applying Interdisciplinary Frameworks to Understand Algorithmic Decision-Making. arXiv 2023, arXiv:2305.16700. [Google Scholar]
  16. Abubakar, A.M.; Elrehail, H.; Alatailat, M.A.; Elçi, A. Knowledge management, decision-making style and organizational performance. J. Innov. Knowl. 2019, 4, 104–114. [Google Scholar] [CrossRef]
  17. AlDhaena, E. The role of knowledge management in strategic decision-making in higher education institutions (HEIs): A proposed model. Int. J. Innov. Creat. Change 2020, 10, 50–57. [Google Scholar]
  18. Bruch, E.; Feinberg, F. Decision-making processes in social contexts. Annu. Rev. Sociol. 2017, 43, 207–227. [Google Scholar] [CrossRef]
  19. Sayama, H.; Dionne, S.D. Studying collective human decision making and creativity with evolutionary computation. Artif. Life 2015, 21, 379–393. [Google Scholar] [CrossRef][Green Version]
  20. Zafar, F.; Akram, M. A novel decision-making method based on rough fuzzy information. Int. J. Fuzzy Syst. 2018, 20, 1000–1014. [Google Scholar] [CrossRef]
  21. Naz, S.; Ashraf, S.; Akram, M. A novel approach to decision-making with Pythagorean fuzzy information. Mathematics 2018, 6, 95. [Google Scholar] [CrossRef]
  22. Zhang, W.R. bipolar fuzzy sets. In Proceedings of the 1998 IEEE International Conference on Fuzzy Systems Proceedings, IEEE World Congress on Computational Intelligence (Cat. No. 98CH36228), Anchorage, AK, USA, 4–9 May 1998; Volume 1, pp. 835–840. [Google Scholar]
  23. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  24. Ali, M.I.; Shabir, M. Comments on De Morgan’s law in fuzzy soft sets. J. Fuzzy Math. 2010, 18, 679–686. [Google Scholar]
  25. Ali, M.I. Another view on reduction of parameters in soft sets. Appl. Soft Comput. 2012, 12, 1814–1821. [Google Scholar] [CrossRef]
  26. Feng, F.; Li, C.; Davvaz, B.; Ali, M.I. Soft sets combined with fuzzy sets and rough sets: A tentative approach. Soft Comput. 2010, 14, 899–911. [Google Scholar] [CrossRef]
  27. Maji, P.K.R. Biswas ans AR Roy, “Fuzzy soft sets”. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  28. Roy, A.R.; Maji, P. A fuzzy soft set theoretic approach to decision making problems. J. Comput. Appl. Math. 2007, 203, 412–418. [Google Scholar] [CrossRef]
  29. Pei, D.; Miao, D. A From soft sets to information systems. In Proceedings of the 2005 IEEE International Conference on Granular Computing, Beijing, China, 25–27 July 2005; Volume 2, pp. 617–621. [Google Scholar]
  30. Yang, X.; Lin, T.Y.; Yang, J.; Li, Y.; Yu, D. Combination of interval-valued fuzzy set and soft set. Comput. Math. Appl. 2009, 58, 521–527. [Google Scholar] [CrossRef]
  31. Shabir, M.; Naz, M. On bipolar soft sets. arXiv 2013, arXiv:1303.1344. [Google Scholar] [PubMed]
  32. Mahmood, T. A novel approach towards bipolar soft sets and their applications. J. Math. 2020, 2020, 4690808. [Google Scholar] [CrossRef]
  33. Lee, K.M. Bipolar-valued fuzzy sets and their operations. In Proceedings of the International Conference on Intelligent Technologies, Bangkok, Thailand, 12–14 December 2000; pp. 307–312. [Google Scholar]
  34. Abdullah, S.; Aslam, M.; Ullah, K. Bipolar fuzzy soft sets and its applications in decision making problem. J. Intell. Fuzzy Syst. 2014, 27, 729–742. [Google Scholar] [CrossRef]
  35. Musa, S.Y.; Asaad, B.A.; Alohali, H.; Ameen, Z.A.; Alqahtani, M.H. Fuzzy N-Bipolar Soft Sets for Multi-Criteria Decision-Making: Theory and Application. CMES-Comput. Model. Eng. Sci. 2025, 143, 911–943. [Google Scholar] [CrossRef]
  36. Alqablan, K.A.; Alsager, K.M. Multi-Q Cubic bipolar fuzzy soft sets and cosine similarity methods for multi-criteria decision making. Symmetry 2025, 16, 1032. [Google Scholar] [CrossRef]
  37. El-Atik, A.A.; Abu-Gdairi, R.; Nasef, A.A.; Jafari, S.; Badr, M. Fuzzy Soft Sets and Decision Making in Ideal Nutrition. Symmetry 2023, 15, 1523. [Google Scholar] [CrossRef]
  38. Shi, D.; Khiamy, H.M.; Abbas, S.E.; Ibedou, I. Roughness of bipolar soft sets via ideals and its applications. Eur. J. Pure Appl. Math. 2025, 18, 6225. [Google Scholar] [CrossRef]
  39. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef]
  40. Naz, M.; Shabir, M. On fuzzy bipolar soft sets, their algebraic structures and applications. J. Intell. Fuzzy Syst. 2014, 26, 1645–1656. [Google Scholar] [CrossRef]
Figure 1. From variant structures to fuzzy and soft sets to arriving at DFBFSSs.
Figure 1. From variant structures to fuzzy and soft sets to arriving at DFBFSSs.
Symmetry 18 00119 g001
Figure 2. Flowchart.
Figure 2. Flowchart.
Symmetry 18 00119 g002
Figure 3. Adjusted final score.
Figure 3. Adjusted final score.
Symmetry 18 00119 g003
Figure 4. Comparing DFBFSS with FSS, FBSS and BFSS.
Figure 4. Comparing DFBFSS with FSS, FBSS and BFSS.
Symmetry 18 00119 g004
Table 1. A DFBFSS ( ϑ , ξ , Γ ) .
Table 1. A DFBFSS ( ϑ , ξ , Γ ) .
( ϑ , Γ ) ( ξ , ¬ Γ )
ϑ ( ρ 1 ) ϑ ( ρ 2 ) ξ ( ¬ ρ 1 ) ξ ( ¬ ρ 2 )
ς 1 ( 0.6 , 0.2 ) ( 0.3 , 0.5 ) ( 0.3 , 0.6 ) ( 0.5 , 0.3 )
ς 2 ( 0.3 , 0.4 ) ( 0.7 , 0.1 ) ( 0.5 , 0.2 ) ( 0.2 , 0.4 )
ς 3 ( 0.8 , 0.3 ) ( 0.2 , 0.2 ) ( 0.1 , 0.6 ) ( 0.4 , 0.1 )
Table 2. A DFBFS complement ( ϑ , ξ , Γ ) c .
Table 2. A DFBFS complement ( ϑ , ξ , Γ ) c .
( ϑ , Γ ) c ( ξ , ¬ Γ ) c
ϑ ( ρ 1 ) c ϑ ( ρ 2 ) c ξ ( ¬ ρ 1 ) c ξ ( ¬ ρ 2 ) c
ς 1 ( 0.4 , 0.8 ) ( 0.7 , 0.5 ) ( 0.7 , 0.4 ) ( 0.5 , 0.7 )
ς 2 ( 0.7 , 0.6 ) ( 0.3 , 0.9 ) ( 0.5 , 0.8 ) ( 0.8 , 0.6 )
ς 3 ( 0.2 , 0.7 ) ( 0.8 , 0.8 ) ( 0.9 , 0.4 ) ( 0.6 , 0.9 )
Table 3. A DFBFSS ( ϑ , ξ , Γ ) .
Table 3. A DFBFSS ( ϑ , ξ , Γ ) .
( ϑ , Γ ) ( ξ , ¬ Γ )
ϑ ( ρ 1 ) ξ ( ¬ ρ 1 )
ς 1 ( 0.4 , 0.1 ) ( 0.3 , 0.6 )
ς 2 ( 0.3 , 0.3 ) ( 0.6 , 0.2 )
ς 3 ( 0.2 , 0.2 ) ( 0.1 , 0.7 )
Table 4. A DFBFSS ( ϑ 1 , ξ 1 , ß ) .
Table 4. A DFBFSS ( ϑ 1 , ξ 1 , ß ) .
( ϑ 1 , ß ) ( ξ 1 , ¬ ß )
ϑ 1 ( ρ 1 ) ϑ 1 ( ρ 2 ) ξ 1 ( ¬ ρ 1 ) ξ 1 ( ¬ ρ 2 )
ς 1 ( 0.7 , 0.2 ) ( 0.3 , 0.5 ) ( 0.3 , 0.6 ) ( 0.5 , 0.3 )
ς 2 ( 0.4 , 0.4 ) ( 0.6 , 0.1 ) ( 0.5 , 0.2 ) ( 0.2 , 0.4 )
ς 3 ( 0.9 , 0.5 ) ( 0.1 , 0.2 ) ( 0.1 , 0.6 ) ( 0.4 , 0.1 )
Table 5. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
Table 5. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
( ρ 1 , ρ 1 ) ( ρ 1 , ρ 2 ) Ω ( ¬ ρ 1 , ¬ ρ 1 ) Ω ( ¬ ρ 1 , ¬ ρ 2 )
ς 1 ( 0.7 , 0.2 ) ( 0.4 , 0.5 ) ( 0.3 , 0.6 ) ( 0.3 , 0.3 )
ς 2 ( 0.4 , 0.4 ) ( 0.6 , 0.3 ) ( 0.5 , 0.2 ) ( 0.2 , 0.2 )
ς 3 ( 0.9 , 0.5 ) ( 0.2 , 0.2 ) ( 0.1 , 0.6 ) ( 0.1 , 0.1 )
Table 6. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
Table 6. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
( ρ 1 , ρ 1 ) ( ρ 1 , ρ 2 ) Ω ( ¬ ρ 1 , ¬ ρ 1 ) Ω ( ¬ ρ 1 , ¬ ρ 2 )
ς 1 ( 0.4 , 0.1 ) ( 0.3 , 0.1 ) ( 0.3 , 0.6 ) ( 0.5 , 0.6 )
ς 2 ( 0.3 , 0.3 ) ( 0.3 , 0.1 ) ( 0.6 , 0.2 ) ( 0.6 , 0.4 )
ς 3 ( 0.2 , 0.2 ) ( 0.1 , 0.2 ) ( 0.1 , 0.7 ) ( 0.4 , 0.7 )
Table 7. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
Table 7. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
( , ) ( Ω , ¬ )
( ρ 1 ) ( ρ 2 ) Ω ( ¬ ρ 1 ) Ω ( ¬ ρ 2 )
ς 1 ( 0.7 , 0.2 ) ( 0.3 , 0.5 ) ( 0.3 , 0.6 ) ( 0.5 , 0.3 )
ς 2 ( 0.4 , 0.4 ) ( 0.6 , 0.1 ) ( 0.5 , 0.2 ) ( 0.2 , 0.4 )
ς 3 ( 0.9 , 0.5 ) ( 0.1 , 0.2 ) ( 0.1 , 0.6 ) ( 0.4 , 0.1 )
Table 8. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
Table 8. ( ϑ , ξ , Γ )   ¨   ( ϑ 1 , ξ 1 , ß ) .
( , ) ( Ω , ¬ )
( ρ 1 ) ( ρ 2 ) Ω ( ¬ ρ 1 ) Ω ( ¬ ρ 2 )
ς 1 ( 0.4 , 0.1 ) ( 0.3 , 0.5 ) ( 0.3 , 0.6 ) ( 0.5 , 0.3 )
ς 2 ( 0.3 , 0.3 ) ( 0.6 , 0.1 ) ( 0.6 , 0.2 ) ( 0.2 , 0.4 )
ς 3 ( 0.2 , 0.2 ) ( 0.1 , 0.2 ) ( 0.1 , 0.7 ) ( 0.4 , 0.1 )
Table 9. ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) .
Table 9. ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) .
( , ) ( Ω , ¬ )
( ρ 1 ) Ω ( ¬ ρ 1 )
ς 1 ( 0.7 , 0.2 ) ( 0.3 , 0.6 )
ς 2 ( 0.4 , 0.4 ) ( 0.5 , 0.2 )
ς 3 ( 0.9 , 0.5 ) ( 0.1 , 0.6 )
Table 10. ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) .
Table 10. ( ϑ , ξ , Γ )     ( ϑ 1 , ξ 1 , ß ) .
( , ) ( Ω , ¬ )
( ρ 1 ) Ω ( ¬ ρ 1 )
ς 1 ( 0.4 , 0.1 ) ( 0.3 , 0.6 )
ς 2 ( 0.3 , 0.3 ) ( 0.6 , 0.2 )
ς 3 ( 0.2 , 0.2 ) ( 0.1 , 0.7 )
Table 11. Table of ( ϑ , ξ , Γ ) .
Table 11. Table of ( ϑ , ξ , Γ ) .
              ( ϑ , Γ )               ( ξ , ¬ Γ )
ϑ ( ρ 1 ) ϑ ( ρ 3 ) ϑ ( ρ 4 ) ξ ( ¬ ρ 1 ) ξ ( ¬ ρ 3 ) ξ ( ρ 4 )
ς 1 ( 0.35 , 0.3 ) ( 0.4 , 0.25 ) ( 0.5 , 0.7 ) ( 0.1 , 0.4 ) ( 0.6 , 0.5 ) ( 0.3 , 0.23 )
ς 2 ( 0.45 , 0.2 ) ( 0.65 , 0.4 ) ( 0.3 , 0.8 ) ( 0.37 , 0.4 ) ( 0.22 , 0.6 ) ( 0.64 , 0.1 )
ς 3 ( 0.45 , 0.43 ) ( 0.2 , 0.7 ) ( 0.8 , 0.6 ) ( 0.4 , 0.15 ) ( 0.5 , 0.2 ) ( 0.2 , 0.3 )
ς 4 ( 0.7 , 0.5 ) ( 0.8 , 0.6 ) ( 0.74 , 0.31 ) ( 0.25 , 0.3 ) ( 0.1 , 0.4 ) ( 0.1 , 0.49 )
ς 5 ( 0.74 , 0.6 ) ( 0.39 , 0.7 ) ( 0.7 , 0.8 ) ( 0.2 , 0.4 ) ( 0.5 , 0.25 ) ( 0.2 , 0.1 )
ς 6 ( 0.46 , 0.1 ) ( 0.6 , 0.6 ) ( 0.33 , 0.8 ) ( 0.1 , 0.31 ) ( 0.1 , 0.3 ) ( 0.52 , 0.1 )
Table 12. Tabular presentation for ϱ + .
Table 12. Tabular presentation for ϱ + .
ϑ ρ 1 ρ 3 ρ 4
ς 1 0.35 0.4 0.5
ς 2 0.45 0.65 0.3
ς 3 0.45 0.2 0.8
ς 4 0.7 0.8 0.74
ς 5 0.74 0.39 0.7
ς 6 0.46 0.6 0.33
Table 13. Tabular presentation for ¬ η + .
Table 13. Tabular presentation for ¬ η + .
ξ ¬ ρ 1 ¬ ρ 3 ¬ ρ 4
ς 1 0.1 0.6 0.3
ς 2 0.37 0.22 0.65
ς 3 0.4 0.5 0.2
ς 4 0.25 0.1 0.1
ς 5 0.2 0.5 0.2
ς 6 0.1 0.1 0.52
Table 14. Tabular presentation for ϱ .
Table 14. Tabular presentation for ϱ .
ϑ ρ 1 ρ 3 ρ 4
ς 1 0.3 0.25 0.7
ς 2 0.2 0.4 0.8
ς 3 0.43 0.7 0.6
ς 4 0.5 0.6 0.31
ς 5 0.6 0.7 0.8
ς 6 0.1 0.6 0.8
Table 15. Tabular presentation for ¬ η .
Table 15. Tabular presentation for ¬ η .
ξ ¬ ρ 1 ¬ ρ 3 ¬ ρ 4
ς 1 0.4 0.5 0.23
ς 2 0.4 0.6 0.1
ς 3 0.15 0.2 0.3
ς 4 0.3 0.4 0.49
ς 5 0.4 0.25 0.1
ς 6 0.31 0.3 0.1
Table 16. Normalized tabular presentation for ϱ + .
Table 16. Normalized tabular presentation for ϱ + .
ϑ ρ 1 ρ 3 ρ 4
ς 1 0.35 0.6 0.5
ς 2 0.45 0.35 0.7
ς 3 0.45 0.8 0.2
ς 4 0.7 0.2 0.26
ς 5 0.74 0.61 0.3
ς 6 0.46 0.4 0.67
Table 17. Normalized tabular presentation for ¬ η + .
Table 17. Normalized tabular presentation for ¬ η + .
ξ ¬ ρ 1 ¬ ρ 3 ¬ ρ 4
ς 1 0.9 0.6 0.3
ς 2 0.63 0.22 0.65
ς 3 0.6 0.5 0.2
ς 4 0.75 0.1 0.1
ς 5 0.8 0.5 0.2
ς 6 0.9 0.1 0.52
Table 18. Normalized tabular presentation for ϱ .
Table 18. Normalized tabular presentation for ϱ .
ϑ ρ 1 ρ 3 ρ 4
ς 1 0.3 0.75 0.3
ς 2 0.2 0.6 0.2
ς 3 0.43 0.3 0.4
ς 4 0.5 0.4 0.69
ς 5 0.6 0.3 0.2
ς 6 0.1 0.4 0.2
Table 19. Normalized tabular presentation for ¬ η .
Table 19. Normalized tabular presentation for ¬ η .
ξ ¬ ρ 1 ¬ ρ 3 ¬ ρ 4
ς 1 0.6 0.5 0.23
ς 2 0.6 0.6 0.1
ς 3 0.85 0.2 0.3
ς 4 0.7 0.4 0.49
ς 5 0.6 0.25 0.1
ς 6 0.69 0.3 0.1
Table 20. Comparison of normalized tabular presentation for ϱ + .
Table 20. Comparison of normalized tabular presentation for ϱ + .
ς 1 ς 2 ς 3 ς 4 ς 5 ς 6
ς 1 311211
ς 2 232211
ς 3 223111
ς 4 112301
ς 5 222332
ς 6 212213
Table 21. Comparison of normalized tabular presentation for ¬ η + .
Table 21. Comparison of normalized tabular presentation for ¬ η + .
ς 1 ς 2 ς 3 ς 4 ς 5 ς 6
ς 1 310002
ς 2 231121
ς 3 323132
ς 4 322333
ς 5 312032
ς 6 221113
Table 22. Comparison of normalized tabular presentation for ϱ .
Table 22. Comparison of normalized tabular presentation for ϱ .
ς 1 ς 2 ς 3 ς 4 ς 5 ς 6
ς 1 331123
ς 2 031123
ς 3 223022
ς 4 223323
ς 5 122132
ς 6 011123
Table 23. Comparison of normalized tabular presentation for ¬ η .
Table 23. Comparison of normalized tabular presentation for ¬ η .
ς 1 ς 2 ς 3 ς 4 ς 5 ς 6
ς 1 322211
ς 2 232222
ς 3 113211
ς 4 111300
ς 5 332333
ς 6 222313
Table 24. Normalized tabular presentation score for ϱ + .
Table 24. Normalized tabular presentation score for ϱ + .
Row Sum: r i Column Sum: c i P i = r i c i
ς 1 912 3
ς 2 1110 1
ς 3 1012 2
ς 4 813 5
ς 5 147 7
ς 6 119 2
Table 25. Normalized tabular presentation score for ¬ η + .
Table 25. Normalized tabular presentation score for ¬ η + .
Row Sum: ¬ r i Column Sum: ¬ i ¬ P i = ¬ r i ¬ i
ς 1 616 10
ς 2 1011 1
ς 3 149 5
ς 4 166 10
ς 5 1112 1
ς 6 1013 3
Table 26. Normalized tabular presentation score for ϱ .
Table 26. Normalized tabular presentation score for ϱ .
Row Sum: r i Column Sum: c i N i = r i c i
ς 1 138 5
ς 2 1013 3
ς 3 1111 0
ς 4 157 8
ς 5 1113 2
ς 6 816 8
Table 27. Normalized tabular presentation score for ¬ η .
Table 27. Normalized tabular presentation score for ¬ η .
Row Sum: ¬ r i Column Sum: ¬ i ¬ N i = ¬ r i ¬ c i
ς 1 1112 2
ς 2 1312 1
ς 3 912 3
ς 4 615 9
ς 5 178 9
ς 6 1310 3
Table 28. Adjusted Positive score(APS).
Table 28. Adjusted Positive score(APS).
P i ¬ P i APS i = P i ( ¬ P i )
ς 1 3 10 7
ς 2 1 1 2
ς 3 2 5 7
ς 4 5 10 15
ς 5 7 1 8
ς 6 2 3 5
Table 29. Adjusted negative score(ANS).
Table 29. Adjusted negative score(ANS).
N i ¬ N i ANS i = N i ( ¬ N i )
ς 1 5 2 7
ς 2 3 1 4
ς 3 0 3 3
ς 4 8 9 17
ς 5 2 9 11
ς 6 8 3 11
Table 30. Adjusted final score (AFS).
Table 30. Adjusted final score (AFS).
APS i ANS i AFS i = APS i ANS i
ς 1 7 7 0
ς 2 2 4 6
ς 3 7 3 10
ς 4 15 17 32
ς 5 8 11 19
ς 6 5 11 16
Table 31. Comparative analysis of DFBFSS with some existing sets.
Table 31. Comparative analysis of DFBFSS with some existing sets.
ModelsRanking ResultsOptimal Alternative
DFBFSS ς 5 ς 6 ς 2 ς 1 ς 3 ς 4 ς 5
FSS ς 5 ς 6 ς 2 ς 3 ς 1 ς 4 ς 5
FBSS ς 5 ς 1 ς 6 ς 2 ς 3 ς 4 ς 5
BFSS ς 6 ς 5 ς 2 ς 3 ς 1 ς 4 ς 6
Table 32. Comparative Analysis of the Proposed DFBFSS Model with Related.
Table 32. Comparative Analysis of the Proposed DFBFSS Model with Related.
Aspect/ModelSoft Set (SS)Fuzzy Soft Set (FSS)Bipolar FSS (BFSS)Proposed DFBFSS
Handles Vague DataNo (Crisp)YesYesYes
Models BipolarityNoNoYesYes
Captures NegationNoNoNoYes
Complexity of RepresentationLowMediumMediumHigh (Four-dimensional)
Key JustificationOversimplifies due to crisp logicMisses conflicting criteriaMisses negation semanticsCaptures complete expert judgment with dual-frame uncertainty
Table 33. Comparison of DFBFSSs with Existing Fuzzy Soft Models.
Table 33. Comparison of DFBFSSs with Existing Fuzzy Soft Models.
ModelPositive
Membership
Negative
Membership
NegationBipolarityMulti-Criteria
Decision Support
Notes
SS [23]×××LimitedBinary or crisp
values only
FSS [27]×××ModerateCaptures positive
fuzziness only
BFSS [34]×ModerateNo negation
information
DFBFSS (Proposed)HighFour-dimensional,
dual-frame,
handles negation
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

Mershkhan, S.M.; Asaad, B.A. Double-Framed Bipolar Fuzzy Soft Sets and Algorithmic Approaches with Symmetry for Multi-Criteria Decision-Making Under Uncertainty. Symmetry 2026, 18, 119. https://doi.org/10.3390/sym18010119

AMA Style

Mershkhan SM, Asaad BA. Double-Framed Bipolar Fuzzy Soft Sets and Algorithmic Approaches with Symmetry for Multi-Criteria Decision-Making Under Uncertainty. Symmetry. 2026; 18(1):119. https://doi.org/10.3390/sym18010119

Chicago/Turabian Style

Mershkhan, Shadya M., and Baravan A. Asaad. 2026. "Double-Framed Bipolar Fuzzy Soft Sets and Algorithmic Approaches with Symmetry for Multi-Criteria Decision-Making Under Uncertainty" Symmetry 18, no. 1: 119. https://doi.org/10.3390/sym18010119

APA Style

Mershkhan, S. M., & Asaad, B. A. (2026). Double-Framed Bipolar Fuzzy Soft Sets and Algorithmic Approaches with Symmetry for Multi-Criteria Decision-Making Under Uncertainty. Symmetry, 18(1), 119. https://doi.org/10.3390/sym18010119

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