Next Article in Journal
A Novel Method to Identify Initial Values of Chaotic Maps in Cybersecurity
Next Article in Special Issue
Neutrosophic Compound Orthogonal Neural Network and Its Applications in Neutrosophic Function Approximation
Previous Article in Journal
Gentle Slow Start to Alleviate TCP Incast in Data Center Networks
Previous Article in Special Issue
A Variable Acceptance Sampling Plan under Neutrosophic Statistical Interval Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Approach toward a Q-Neutrosophic Soft Set and Its Application in Decision Making

School of Mathematical Sciences, Faculty of Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600, Selangor, Malaysia
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(2), 139; https://doi.org/10.3390/sym11020139
Submission received: 20 December 2018 / Revised: 20 January 2019 / Accepted: 23 January 2019 / Published: 27 January 2019

Abstract

:
A neutrosophic set was proposed as an approach to study neutral uncertain information. It is characterized through three memberships, T , I and F, such that these independent functions stand for the truth, indeterminate, and false-membership degrees of an object. The neutrosophic set presents a symmetric form since truth enrolment T is symmetric to its opposite false enrolment F with respect to indeterminacy enrolment I that acts as an axis of symmetry. The neutrosophic set was further extended to a Q-neutrosophic soft set, which is a hybrid model that keeps the features of the neutrosophic soft set in dealing with uncertainty, and the features of a Q-fuzzy soft set that handles two-dimensional information. In this study, we discuss some operations of Q-neutrosophic soft sets, such as subset, equality, complement, intersection, union, AND operation, and OR operation. We also define the necessity and possibility operations of a Q-neutrosophic soft set. Several properties and illustrative examples are discussed. Then, we define the Q-neutrosophic-set aggregation operator and use it to develop an algorithm for using a Q-neutrosophic soft set in decision-making issues that have indeterminate and uncertain data, followed by an illustrative real-life example.

1. Introduction

Fuzzy-set theory was established by Zadeh in 1965 [1]. Since then, fuzzy logic has been utilized in several real-world problems in uncertain environments. Consequently, numerous analysts discussed many results using distinct directions of fuzzy-set theory, for instance, interval valued fuzzy set [2] and intuitionistic fuzzy set [3]. These extensions can deal with uncertain real-world problems. An intuitionistic fuzzy set can only cope with incomplete data through its truth and falsity membership values, but it does not cope with indeterminate data. Thus, Smarandache [4] initiated the neutrosophic idea to overcome this problem. A neutrosophic set (NS) [5] is a mathematical notion serving issues containing inconsistent, indeterminate, and imprecise data. Recent studies on NS include a single-valued neutrosophic set [6] and complex neutrosophic set [7].
Molodtsov [8] proposed the notion of the soft set as an important mathematical notion for handling uncertainties. The main advantage of this notion in data analysis is that it does not need any grade of membership as in fuzzy-set theory. Maji et.al. [9] presented the fuzzy soft set, which is a combination between a soft set and a fuzzy set. Later, many researchers developed several extensions of the soft-set model, such as vague soft set [10], interval-valued vague soft set [11,12,13], soft expert set [14], and soft multiset theory [15]. Maji [16] extended the notion of the fuzzy soft set to the neutrosophic soft set (NSS) and defined some of its properties.
NS is very appropriate for handling inconsistent, indeterminate, and incomplete information in real applications. Recently, many studies have been done on NSS [17,18,19,20,21,22,23,24], the most recent being on vague soft sets [25], neutrosophic vague soft expert sets [26], n-valued refined neutrosophic soft sets [27], complex neutrosophic soft expert sets [28,29] and time-neutrosophic soft sets [30]. Many researchers [23,31,32,33,34,35,36] have constructed several aggregation operators, such as simplified neutrosophic prioritized aggregation operators, single-valued neutrosophic Dombi weighted aggregation operators, simplified neutrosophic weighted aggregation operators, interval neutrosophic exponential weighted aggregation operators, and used them in decision-making issues. Aggregation operators perform a vital role in multicriteria decision making (MCDM) issues whose principle target is to aggregate a collection of inputs to a single number. Thus, aggregation operators give us effective tools to handle neutrosophic data in the decision process.
For a two-dimensional universal set, Adam and Hassan [37,38] introduced the Q-fuzzy soft set (Q-FSS) and multi-Q-FSS, which includes a Q-fuzzy soft aggregation operator that allows constructing more efficient decision-making methods. Broumi [39] presented the notion of the Q-intuitionistic fuzzy soft set (Q-IFSS), and defined some basic properties and basic operations. Actually, these notions cannot handle indeterminate data that appear in two universal sets. Inspired by this, Abu Qamar and Hassan [40] initiated the concept of the Q-neutrosophic soft set (Q-NSS) by upgrading the membership functions of the NSS to a two-dimensional entity. As a result, Q-NSS is premium to these models with three two-dimensional independent membership functions. Hence, this concept serves indeterminacy and two-dimensionality at the same time. Moreover, the Q-neutrosophic set (Q-NS) is basically an NS defined over a two-dimensional set. Thus, it has added advantages to NS by treating a two-dimensional universal set, which makes it more valid in modeling real-life problems where two-dimensional sets and indeterminacy majorly appear. Q-NSS is created to keep the advantages of Q-FSS while holding NSS features. Therefore, it incorporates the benefits of these models. Abu Qamar and Hassan studied different aspects of Q-NSS, such as their relations [40], measures of Q-NSS information [41], generalized Q-neutrosophic soft expert set [42], and different decision problems of these concepts.
Motivated by these studies, in this study we discuss the different operations and properties of Q-NSS. To facilitate the discussion, we arranged this article as follows. Section 2 contains a review of basic definitions pertaining to this work. In Section 3, we discuss some operations of Q-NSS, such as subset, equality, complement, intersection, union, AND operation, and OR operation. We discuss necessity and possibility operations in Section 4 along with properties and illustrative examples. In Section 5, we define the aggregation Q-NS in order to utilize it in the algorithm that we constructed to solve decision-making problems using Q-NSS. In Section 6, comparison analysis is presented to validate the proposed approach. Finally, conclusions and future work are in Section 7. Consequently, the concept of Q-NSS will enrich current NSS studies.

2. Preliminaries

In this section, we recall the concepts of soft set, NS, and Q-NS, which are relevant to this paper.
Soft-set theory was proposed by Molodtsov [8].
Definition 1
([8]). A pair ( F , E ) is a soft set over U if and only if F : E P ( U ) is mapping. That is, the soft set is a parameterized family of subsets of U.
In order to handle inconsistent and indeterminate information that exists in some real-world issues, Smarandache [5] initiated the NS concept as follows:
Definition 2
([5]). An NS Γ on universe U is defined as Γ = { u , ( T Γ ( u ) , I Γ ( u ) , F Γ ( u ) ) : u U } , w h e r e T , I , F : U ] 0 , 1 + [ and 0 T Γ ( u ) + I Γ ( u ) + F Γ ( u ) 3 + .
Now, we recall some basic NS operations proposed by Smarandache [43].
Definition 3
([43]). Let Γ and Ψ be two NSs. Then, Γ is a subset of Ψ, written as Γ Ψ , if and only if T Γ ( u ) T Ψ ( u ) , I Γ ( u ) I Ψ ( u ) and F Γ ( u ) F Ψ ( u ) u U .
Definition 4
([43]). The union of two NSs Γ and Ψ in U, written as Γ Ψ = Λ , where Λ = { u , ( max { T Γ ( u ) , T Ψ ( u ) } , min { I Γ ( u ) , I Ψ ( u ) } , min { F Γ ( u ) , F Ψ ( u ) } ) : u U } .
Definition 5
([43]). The intersection of two NSs Γ and Ψ in U, written as Γ Ψ = Λ , where Λ = { u , ( min { T Γ ( u ) , T Ψ ( u ) } , max { I Γ ( u ) , I Ψ ( u ) } , max { F Γ ( u ) , F Ψ ( u ) } ) : u U } .
Definition 6
([43]). The complement of an NS Γ in U, denoted by Γ c , where
Γ c = { u , ( 1 T Γ ( u ) , 1 I Γ ( u ) , 1 F Γ ( u ) ) : u U } .
Abu Qamar and Hassan [40] introduced the idea of Q-NS as follows:
Definition 7
([40]). A Q-NS Γ Q in U is an object of form
Γ Q = ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , F Γ Q ( u , t ) : u U , t Q ,
where Q ϕ and T Γ Q , I Γ Q , F Γ Q : U × Q ] 0 , 1 + [ are the true, indeterminacy, and false membership functions, respectively, with 0 T Γ Q + I Γ Q + F Γ Q 3 + .

3. Q-Neutrosophic Soft Sets

In this section, we discuss numerous properties and operations concerning Q-NSSs, namely, union, intersection, and AND and OR operations. The concept of Q-NSS was briefly mentioned in the following definition without any algebraic operations in the discussion on Q-neutrosophic soft relations [40].
Definition 8
([40]). Let U be a universal set, Q be a nonempty set and A E be a set of parameters. Let μ l Q N S ( U ) be the set of all multi-Q-NSs on U with dimension l = 1 . A pair ( Γ Q , A ) is called a Q-NSS over U, where Γ Q : A μ l Q N S ( U ) is a mapping, such that Γ Q ( e ) = ϕ if e A .
A Q-NSS can be presented as
( Γ Q , A ) = { ( e , Γ Q ( e ) ) : e A , Γ Q μ l Q N S ( U ) } .
The set of all Q-NSSs in U is denoted by Q-NSS(U).
The following example shows how Q-NSS can represent real-world problems.
Example 1.
Suppose we want to examine the attractiveness of a cell phone that a person is considering buying. Suppose there are two choices in the universe U = { u 1 , u 2 } , Q = { s = b l a c k , t = w h i t e } is the set of colors under consideration and E = { e 1 = p r i c e , e 2 = v e r s i o n , e 3 = d e v i c e s p e c i f i c a t i o n } is a set of decision parameters. Then, the Q-NSS ( Γ Q , A ) is given by:
( Γ Q , A ) = { e 1 , [ ( u 1 , s ) , 0.5 , 0.1 , 0.2 ] , [ ( u 1 , t ) , 0.7 , 0.5 , 0.3 ] , [ ( u 2 , s ) , 0.7 , 0.5 , 0.4 ] , [ ( u 2 , t ) , 0.4 , 0.3 , 0.1 ] , e 2 , [ ( u 1 , s ) , 0.1 , 0.2 , 0.6 ] , [ ( u 1 , t ) , 0.8 , 0.1 , 0.5 ] , [ ( u 2 , s ) , 0.4 , 0.6 , 0.9 ] , [ ( u 2 , t ) , 0.4 , 0.6 , 0.7 ] , e 3 , [ ( u 1 , s ) , 0.6 , 0.2 , 0.2 ] , [ ( u 1 , t ) , 0.1 , 0.8 , 0.5 ] , [ ( u 2 , s ) , 0.6 , 0.4 , 0.9 ] , [ ( u 2 , t ) , 0.3 , 0.1 , 0.5 ] } .
Each element in ( Γ Q , A ) represents the degree of attractiveness of each cell phone with a specific color based on each parameter. For example, element [ ( u 1 , s ) , 0.6 , 0.2 , 0.2 ] under parameter e 3 represents the degree of true, indeterminacy, and falsity attractiveness of device specification of cell phone u 1 with a black color, and they are 0.6, 0.2, and 0.2, respectively.
Now, we introduce some basic definitions of Q-NSSs.
Definition 9.
Let ( Γ Q , A ) Q-NSS(U). If Γ Q ( e ) = ϕ for all e A , then ( Γ Q , A ) is called a null Q-NSS(U) denoted by ( ϕ , A ) .
Definition 10.
Let ( Γ Q , A ) , ( Ψ Q , B ) Q-NSS(U), then
1. 
( Γ Q , A ) is a Q-neutrosophic soft subset of ( Ψ Q , B ) , denoted by ( Γ Q , A ) ( Ψ Q , B ) , if A B and Γ Q ( e ) Ψ Q ( e ) for all e A , that is T Γ Q ( e ) ( u , t ) T Ψ Q ( e ) ( u , t ) , I Γ Q ( e ) ( u , t ) I Ψ Q ( e ) ( u , t ) , F Γ Q ( e ) ( u , t ) F Ψ Q ( e ) ( u , t ) , for all ( u , t ) U × Q .
2. 
( Γ Q , A ) and ( Ψ Q , B ) are equal, denoted by ( Γ Q , A ) = ( Ψ Q , B ) , if and only if ( Γ Q , A ) ( Ψ Q , B ) and ( Ψ Q , B ) ( Γ Q , A ) for all u U .
Now, we define the complement of Q - N S S ( U ) :
Definition 11.
Let ( Γ Q , A ) Q-NSS(U). Then, its complement written as ( Γ Q , A ) c = ( Γ Q c , A ) , and is defined as
( Γ Q , A ) c = e , T Γ Q ( e ) c ( u , t ) , I Γ Q ( e ) c ( u , t ) , F Γ Q ( e ) c ( u , t ) : e A , ( u , t ) U × Q ,
such that e A , ( u , t ) U × Q
T Γ Q ( e ) c ( u , t ) = 1 T Γ Q ( e ) ( u , t ) , I Γ Q ( e ) c ( u , t ) = 1 I Γ Q ( e ) ( u , t ) , F Γ Q ( e ) c ( u , t ) = 1 F Γ Q ( e ) ( u , t ) .
Example 2.
Let U = { u 1 , u 2 } be a universal set, A = { e 1 , e 2 } and Q = { s , t } .
( Γ Q , A ) = { e 1 , [ ( u 1 , s ) , 0.2 , 0.3 , 0.5 ] , [ ( u 1 , t ) , 0.6 , 0.4 , 0.1 ] , [ ( u 2 , s ) , 0.1 , 0.4 , 0.7 ] , [ ( u 2 , t ) , 0.3 , 0.2 , 0.8 ] , e 2 , [ ( u 1 , s ) , 0.4 , 0.1 , 0.9 ] , [ ( u 1 , t ) , 0.6 , 0.2 , 0.1 ] , [ ( u 2 , s ) , 0.5 , 0.3 , 0.7 ] , [ ( u 2 , t ) , 0.1 , 0.3 , 0.2 ] } .
is a Q-NSS and the complement of ( Γ Q , A ) is
( Γ Q c , A ) = { e 1 , [ ( u 1 , s ) , 0.8 , 0.7 , 0.5 ] , [ ( u 1 , t ) , 0.4 , 0.6 , 0.9 ] , [ ( u 2 , s ) , 0.9 , 0.6 , 0.3 ] , [ ( u 2 , t ) , 0.7 , 0.8 , 0.2 ] , e 2 , [ ( u 1 , s ) , 0.6 , 0.9 , 0.1 ] , [ ( u 1 , t ) , 0.4 , 0.8 , 0.9 ] , [ ( u 2 , s ) , 0.5 , 0.7 , 0.3 ] , [ ( u 2 , t ) , 0.9 , 0.7 , 0.8 ] } .
Proposition 1.
If ( Γ Q , A ) Q-NSS(U), then ( ( Γ Q , A ) c ) c = ( Γ Q , A ) .
Proof. 
From Definition 11, we have
( Γ Q , A ) c = e , T Γ Q ( e ) c ( u , t ) , I Γ Q ( e ) c ( u , t ) , F Γ Q ( e ) c ( u , t ) : e A , ( u , t ) U × Q = e , 1 T Γ Q ( e ) ( u , t ) , 1 I Γ Q ( e ) ( u , t ) , 1 F Γ Q ( e ) ( u , t ) : e A , ( u , t ) U × Q .
Thus,
( ( Γ Q , A ) c ) c = { e , 1 ( 1 T Γ Q ( e ) ( u , t ) ) , 1 ( 1 I Γ Q ( e ) ( u , t ) ) , 1 ( 1 F Γ Q ( e ) ( u , t ) ) : e A , ( u , t ) U × Q } = { e , T Γ Q ( e ) ( u , t ) , I Γ Q ( e ) ( u , t ) , F Γ Q ( e ) ( u , t ) : e A , ( u , t ) U × Q }
This completes the proof. □
Next, we discuss the operations of union, intersection, and AND and OR operations for Q-NSSs, along with some results and examples.
Definition 12.
The union of two Q-NSSs ( Γ Q , A ) and ( Ψ Q , B ) is the Q-NSS ( Λ Q , C ) written as ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , C ) , where C = A B and for all c C , ( u , t ) U × Q , the truth membership, indeterminacy membership, and falsity membership of ( Λ Q , C ) are as follows:
T Λ Q ( c ) ( u , t ) = T Γ Q ( c ) ( u , t ) i f c A B , T Ψ Q ( c ) ( u , t ) i f c B A , max { T Λ Q ( c ) ( u , t ) , T Ψ Q ( c ) ( u , t ) } i f c A B ,
I Λ Q ( c ) ( u , t ) = I Γ Q ( c ) ( u , t ) i f c A B , I Ψ Q ( c ) ( u , t ) i f c B A , min { I Γ Q ( c ) ( u , t ) , I Ψ Q ( c ) ( u , t ) } i f c A B ,
F Λ Q ( c ) ( u , t ) = F Γ Q ( c ) ( u , t ) i f c A B , F Ψ Q ( c ) ( u , t ) i f c B A , min { F Γ Q ( c ) ( u , t ) , F Ψ Q ( c ) ( u , t ) } i f c A B .
Definition 13.
The intersection of two Q-NSSs ( Γ Q , A ) and ( Ψ Q , B ) is the Q-NSS ( Λ Q , C ) written as ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , C ) , where C = A B and for all c C and ( u , t ) U × Q the truth membership, indeterminacy membership, and falsity membership of ( Λ Q , C ) are as follows:
T Λ Q ( c ) ( u , t ) = min { T Γ Q ( c ) ( u , t ) , T Ψ Q ( c ) ( u , t ) } , I Λ Q ( c ) ( u , t ) = max { I Γ Q ( c ) ( u , t ) , I Ψ Q ( c ) ( u , t ) } , F Λ Q ( c ) ( u , t ) = max { F Γ Q ( c ) ( u , t ) , F Ψ Q ( c ) ( u , t ) } .
Example 3.
Let U = { u 1 , u 2 } be a universal set, E = { e 1 , e 2 } and Q = { s , t } . If A = B = { e 1 , e 2 } E ,
( Γ Q , A ) = { e 1 , [ ( u 1 , s ) , 0.2 , 0.3 , 0.5 ] , [ ( u 1 , t ) , 0.6 , 0.4 , 0.1 ] , [ ( u 2 , s ) , 0.1 , 0.4 , 0.7 ] , [ ( u 2 , t ) , 0.3 , 0.2 , 0.8 ] , e 2 , [ ( u 1 , s ) , 0.4 , 0.1 , 0.9 ] , [ ( u 1 , t ) , 0.6 , 0.2 , 0.1 ] , [ ( u 2 , s ) , 0.5 , 0.3 , 0.7 ] , [ ( u 2 , t ) , 0.1 , 0.3 , 0.2 ] }
and
( Ψ Q , B ) = { e 1 , [ ( u 1 , s ) , 0.4 , 0.5 , 0.2 ] , [ ( u 1 , t ) , 0.2 , 0.3 , 0.5 ] , [ ( u 2 , s ) , 0.3 , 0.1 , 0.7 ] , [ ( u 2 , t ) , 0.2 , 0.4 , 0.6 ] , e 2 , [ ( u 1 , s ) , 0.9 , 0.3 , 0.2 ] , [ ( u 1 , t ) , 0.4 , 0.3 , 0.1 ] , [ ( u 2 , s ) , 0.8 , 0.6 , 0.3 ] , [ ( u 2 , t ) , 0.2 , 0.4 , 0.6 ] } ,
then
( Γ Q , A ) ( Ψ Q , B ) = { e 1 , [ ( u 1 , s ) , 0.4 , 0.3 , 0.2 ] , [ ( u 1 , t ) , 0.6 , 0.3 , 0.1 ] , [ ( u 2 , s ) , 0.3 , 0.1 , 0.7 ] , [ ( u 2 , t ) , 0.3 , 0.2 , 0.6 ] , e 2 , [ ( u 1 , s ) , 0.9 , 0.1 , 0.2 ] , [ ( u 1 , t ) , 0.6 , 0.2 , 0.1 ] , [ ( u 2 , s ) , 0.8 , 0.3 , 0.3 ] , [ ( u 2 , t ) , 0.2 , 0.3 , 0.2 ] } ,
and
( Γ Q , A ) ( Ψ Q , B ) = { e 1 , [ ( u 1 , s ) , 0.2 , 0.5 , 0.5 ] , [ ( u 1 , t ) , 0.2 , 0.4 , 0.5 ] , [ ( u 2 , s ) , 0.1 , 0.4 , 0.7 ] , [ ( u 2 , t ) , 0.2 , 0.4 , 0.8 ] , e 2 , [ ( u 1 , s ) , 0.4 , 0.3 , 0.9 ] , [ ( u 1 , t ) , 0.4 , 0.3 , 0.1 ] , [ ( u 2 , s ) , 0.5 , 0.6 , 0.7 ] , [ ( u 2 , t ) , 0.1 , 0.4 , 0.6 ] } .
Here, we give a proposition concerning the union and intersection of Q-NSSs.
Proposition 2.
Let ( Γ Q , A ) , ( Ψ Q , B ) a n d ( Λ Q , C ) Q-NSS(U). Then,
1. 
( Γ Q , A ) ( Ψ Q , B ) = ( Ψ Q , B ) ( Γ Q , A ) .
2. 
( Γ Q , A ) ( Ψ Q , B ) = ( Ψ Q , B ) ( Γ Q , A ) .
3. 
( Γ Q , A ) ( ( Ψ Q , B ) ( Λ Q , C ) ) = ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Λ Q , C ) .
4. 
( Γ Q , A ) ( ( Ψ Q , B ) ( Λ Q , C ) ) = ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Λ Q , C ) .
Proof. 
1. We show that ( Γ Q , A ) ( Ψ Q , B ) = ( Ψ Q , B ) ( Γ Q , A ) by using Definition 12. Consider case c A B , as other cases are trivial.
( Γ Q , A ) ( Ψ Q , B ) = { c , ( max { T Γ Q ( c ) ( u , t ) , T Ψ Q ( c ) ( u , t ) } , min { I Γ Q ( c ) ( u , t ) , I Ψ Q ( c ) ( u , t ) } , min { F Γ Q ( c ) ( u , t ) , F Ψ Q ( c ) ( u , t ) } ) } : ( u , t ) U × Q } = { c , max { T Ψ Q ( c ) ( u , t ) , T Γ Q ( c ) ( u , t ) } , min { I Ψ Q ( c ) ( u , t ) , I Γ Q ( c ) ( u , t ) } , min { F Ψ Q ( c ) ( u , t ) , F Γ Q ( c ) ( u , t ) } : ( u , t ) U × Q } = ( Ψ Q , B ) ( Γ Q , A ) .
2. The proof is similar to that of Part (1).
3. We show that ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Υ Q , C ) = ( Γ Q , A ) ( ( Ψ Q , B ) ( Υ Q , C ) ) by using Definition 12. Consider case c A B , as other cases are trivial.
( Γ Q , A ) ( Ψ Q , B ) = { c , ( max { T Γ Q ( c ) ( u , t ) , T Ψ Q ( c ) ( u , t ) } , min { I Γ Q ( c ) ( u , t ) , I Ψ Q ( c ) ( u , t ) } , min { F Γ Q ( c ) ( u , t ) , F Ψ Q ( c ) ( u , t ) } ) : ( u , t ) U × Q } .
( ( Γ Q , A ) ( Ψ Q , B ) ) ( Υ Q , C ) = { c , ( ( max max { T Γ Q ( c ) ( u , t ) , T Ψ Q ( c ) ( u , t ) } , T Υ Q ( c ) ( u , t ) , min min { I Γ Q ( c ) ( u , t ) , I Ψ Q ( c ) ( u , t ) } , I Υ Q ( c ) ( u , t ) , min min { F Γ Q ( c ) ( u , t ) , F Ψ Q ( c ) ( u , t ) } , F Υ Q ( c ) ( u , t ) ) ) : ( u , t ) U × Q }
= { c , ( ( max T Γ Q ( c ) ( u , t ) , T Ψ Q ( c ) ( u , t ) , T Υ Q ( c ) ( u , t ) , min I Γ Q ( c ) ( u , t ) , I Ψ Q ( c ) ( u , t ) , I Υ Q ( c ) ( u , t ) , min F Γ Q ( c ) ( u , t ) , F Ψ Q ( c ) ( u , t ) , F Υ Q ( c ) ( u , t ) ) ) : ( u , t ) U × Q } = { c , ( ( max T Γ Q ( c ) ( u , t ) , max { T Ψ Q ( c ) ( u , t ) , T Υ Q ( c ) ( u , t ) } , min I Γ Q ( c ) ( u , t ) , min { I Ψ Q ( c ) ( u , t ) , I Υ Q ( c ) ( u , t ) } , min F Γ Q ( c ) ( u , t ) , min { F Ψ Q ( c ) ( u , t ) , F Υ Q ( c ) ( u , t ) } ) ) : ( u , t ) U × Q } = ( Γ Q , A ) ( ( Ψ Q , B ) ( Υ Q , C ) ) .
4. The proof is similar to that of Part (3). □
Next, we introduce the AND and OR operations of Q-NSSs.
Definition 14.
If ( Γ Q , A ) and ( Ψ Q , B ) are two Q-NSSs on U, then ( Γ Q , A ) AND ( Ψ Q , B ) is the Q-NSS denoted by ( Γ Q , A ) ( Ψ Q , B ) and defined by ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , A × B ) , where Λ Q ( a , b ) = Γ Q ( a ) Ψ Q ( b ) for all ( a , b ) A × B is the operation of intersection of two Q-NSs on U. That is, the truth, indeterminacy, and falsity memberships of ( Γ Q , A ) and ( Ψ Q , B ) are as follows:
T Λ Q ( a , b ) ( u , t ) = min { T Γ Q ( a ) ( u , t ) , T Ψ Q ( b ) ( u , t ) } , I Λ Q ( a , b ) ( u , t ) = max { I Γ Q ( a ) ( u , t ) , I Ψ Q ( b ) ( u , t ) } , F Λ Q ( a , b ) ( u , t ) = max { F Γ Q ( a ) ( u , t ) , F Ψ Q ( b ) ( u , t ) } ,
Definition 15.
If ( Γ Q , A ) and ( Ψ Q , B ) are two Q-NSSs on U, then ( Γ Q , A ) OR ( Ψ Q , B ) is the Q-NSS denoted by ( Γ Q , A ) ( Ψ Q , B ) and defined by ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , A × B ) , where Λ Q ( a , b ) = Γ Q ( a ) Ψ Q ( b ) for all ( a , b ) A × B is the operation of union of two Q-NSs on U. The truth, indeterminacy, and falsity memberships of ( Λ ^ Q h , A × B ) are as follows:
T Υ Q ( a , b ) ( u , t ) = max { T Γ Q ( a ) ( u , t ) , T Ψ Q ( b ) ( u , t ) } , I Υ Q ( a , b ) ( u , t ) = min { I Γ Q ( a ) ( u , t ) , I Ψ Q ( b ) ( u , t ) } , F Υ Q ( a , b ) ( u , t ) = min { F Γ Q ( a ) ( u , t ) , F Ψ Q ( b ) ( u , t ) } ,
Here, we present an example of AND and OR operations followed by the corresponding propositions.
Example 4.
Reconsider Example 3, then
( Γ Q , A ) ( Ψ Q , B ) = { ( e 1 , e 1 ) , [ ( u 1 , s ) , 0.2 , 0.5 , 0.5 ] , [ ( u 1 , t ) , 0.2 , 0.4 , 0.5 ] , [ ( u 2 , s ) , 0.1 , 0.4 , 0.7 ] , [ ( u 2 , t ) , 0.2 , 0.4 , 0.8 ] , ( e 1 , e 2 ) , [ ( u 1 , s ) , 0.2 , 0.3 , 0.5 ] , [ ( u 1 , t ) , 0.4 , 0.4 , 0.1 ] , [ ( u 2 , s ) , 0.1 , 0.6 , 0.7 ] , [ ( u 2 , t ) , 0.2 , 0.4 , 0.8 ] , ( e 2 , e 1 ) , [ ( u 1 , s ) , 0.4 , 0.5 , 0.9 ] , [ ( u 1 , t ) , 0.2 , 0.3 , 0.5 ] , [ ( u 2 , s ) , 0.3 , 0.3 , 0.7 ] , [ ( u 2 , t ) , 0.1 , 0.4 , 0.6 ] , ( e 2 , e 2 ) , [ ( u 1 , s ) , 0.4 , 0.3 , 0.9 ] , [ ( u 1 , t ) , 0.4 , 0.3 , 0.1 ] , [ ( u 2 , s ) , 0.5 , 0.6 , 0.7 ] , [ ( u 2 , t ) , 0.1 , 0.4 , 0.6 ] } .
( Γ Q , A ) ( Ψ Q , B ) = { ( e 1 , e 1 ) , [ ( u 1 , s ) , 0.4 , 0.3 , 0.2 ] , [ ( u 1 , t ) , 0.6 , 0.3 , 0.1 ] , [ ( u 2 , s ) , 0.3 , 0.1 , 0.7 ] , [ ( u 2 , t ) , 0.3 , 0.2 , 0.6 ] , ( e 1 , e 2 ) , [ ( u 1 , s ) , 0.9 , 0.3 , 0.2 ] , [ ( u 1 , t ) , 0.6 , 0.4 , 0.1 ] , [ ( u 2 , s ) , 0.8 , 0.4 , 0.3 ] , [ ( u 2 , t ) , 0.3 , 0.2 , 0.6 ] , ( e 2 , e 1 ) , [ ( u 1 , s ) , 0.4 , 0.1 , 0.2 ] , [ ( u 1 , t ) , 0.6 , 0.2 , 0.1 ] , [ ( u 2 , s ) , 0.5 , 0.1 , 0.7 ] , [ ( u 2 , t ) , 0.2 , 0.3 , 0.2 ] , ( e 2 , e 2 ) , [ ( u 1 , s ) , 0.9 , 0.1 , 0.2 ] , [ ( u 1 , t ) , 0.6 , 0.2 , 0.1 ] , [ ( u 2 , s ) , 0.8 , 0.3 , 0.3 ] , [ ( u 2 , t ) , 0.2 , 0.3 , 0.2 ] } .
Proposition 3.
Let ( Γ Q , A ) , ( Ψ Q , B ) , and ( Λ Q , C ) be three Q-NSSs on U. Then, we have the following associative properties:
1. 
( Γ Q , A ) ( ( Ψ Q , B ) ( Λ Q , C ) ) = ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Λ Q , C ) .
2. 
( Γ Q , A ) ( ( Ψ Q , B ) ( Λ Q , C ) ) = ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Λ Q , C ) .
Proof. 
1. Let ( Ψ Q , B ) ( Λ Q , C ) = ( Υ Q , B × C ) , where Υ Q ( b , c ) = Ψ Q ( b ) Λ Q ( c ) .
Now, ( Γ Q , A ) ( ( Ψ Q , B ) ( Λ Q , C ) ) = ( Γ Q , A ) ( Υ Q , B × C ) = ( Ω Q , A × B × C ) , where Ω Q ( a , b , c ) = Γ Q ( a ) Υ Q ( b , c ) = Γ Q ( a ) Ψ Q ( b ) Λ Q ( c ) .
Also, ( Γ Q , A ) ( Ψ Q , B ) = ( Θ Q , A × B ) , where Θ Q ( a , b ) = Γ Q ( A ) Ψ Q ( B ) . Therefore, ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Λ Q , C ) = ( Θ q , A × B ) ( Λ Q , C ) = ( Δ Q , A × B × C ) , where Δ Q ( a , b , c ) = Θ Q ( a , b ) Λ Q ( c ) = Γ Q ( a ) Ψ Q ( b ) Λ Q ( c ) . Hence, ( Γ Q , A ) ( ( Ψ Q , B ) ( Λ Q , C ) ) = ( ( Γ Q , A ) ( Ψ Q , B ) ) ( Λ Q , C ) .
2. The result can be proved in a similar fashion as in Assertion 1. □

4. Necessity and Possibility Operations on Q-Neutrosophic Soft Sets with Some Properties

In this section, we introduce necessity and possibility operations on Q-NSSs.
Definition 16.
The necessity operation on a Q-NSS on U ( Γ Q , A ) is denoted by ( Γ Q , A ) and is defined as, for all e A ,
( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q .
Example 5.
Reconsider Example 2, then
( Γ Q , A ) = { e 1 , [ ( u 1 , s ) , 0.2 , 0.3 , 0.8 ] , [ ( u 1 , t ) , 0.6 , 0.4 , 0.4 ] , [ ( u 2 , s ) , 0.1 , 0.4 , 0.9 ] , [ ( u 2 , t ) , 0.3 , 0.2 , 0.7 ] , e 2 , [ ( u 1 , s ) , 0.4 , 0.1 , 0.6 ] , [ ( u 1 , t ) , 0.6 , 0.2 , 0.4 ] , [ ( u 2 , s ) , 0.5 , 0.3 , 0.5 ] , [ ( u 2 , t ) , 0.1 , 0.3 , 0.9 ] }
Proposition 4.
Let ( Γ Q , A ) and ( Ψ Q , B ) be two Q-NSSs on U. Then,
1. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
2. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
3. 
( ( Γ Q , A ) ) = ( Γ Q , A ) .
Proof. 
1. ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , C ) , where C = A B
( Λ Q , C ) = { e , [ ( u , t ) , T Λ Q ( u , t ) , I Λ Q ( u , t ) , F Λ Q ( u , t ) ] : ( u , t ) U × Q } , such that
T Λ Q ( u , t ) = T Γ Q ( u , t ) if e A B , T Ψ Q ( u , t ) if e B A , max { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } if e A B ,
I Λ Q ( u , t ) = I Γ Q ( u , t ) if e A B , I Ψ Q ( u , t ) if e B A , min { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } if e A B ,
and
F Λ Q ( u , t ) = F Γ Q ( u , t ) if e A B , F Ψ Q ( u , t ) if e B A , min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } if e A B .
Now, by Definition 16, for all e C
( Λ Q , C ) = { e , [ ( u , t ) , T Λ Q ( u , t ) , I Λ Q ( u , t ) , F Λ Q ( u , t ) ] : ( u , t ) U × Q } , where
T Λ Q ( u , t ) = T Γ Q ( u , t ) if e A B , T Ψ Q ( u , t ) if e B A , max { T Γ Q ( u , t ) , T Ψ Q i ( u , t ) } if e A B ,
I Λ Q ( u , t ) = I Γ Q ( u , t ) if e A B , I Ψ Q ( u , t ) if e B A , min { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } if e A B ,
and
F Λ Q ( u , t ) = 1 T Γ Q ( u , t ) if e A B , 1 T Ψ Q ( u , t ) if e B A , 1 max { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } if e A B .
Assume for all e A
( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q , and ( Ψ Q , B ) = e , [ ( u , t ) , T Ψ Q ( u , t ) , I Ψ Q ( u , t ) , 1 T Ψ Q ( u , t ) ] : ( u , t ) U × Q . Now, ( Γ Q , A ) ( Ψ Q , B ) = ( Υ Q , C ) , where ( Υ Q , C ) = e , [ ( u , t ) , T Υ Q ( u , t ) , I Υ Q ( u , t ) , F Υ Q ( u , t ) ] : ( u , t ) U × Q , such that
T Υ Q ( u , t ) = T Γ Q ( u , t ) if e A B , T Ψ Q ( u , t ) if e B A , max { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } if e A B ,
I Υ Q ( u , t ) = I Γ Q ( u , t ) if e A B , I Ψ Q ( u , t ) if e B A , min { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } if e A B ,
and
F Υ Q ( u , t ) = 1 T Γ Q ( u , t ) if e A B , 1 T Ψ Q ( u , t ) if e B A , min { 1 T Γ Q ( u , t ) , 1 T Ψ Q ( u , t ) } if e A B , = 1 T Γ Q ( u , t ) if e A B , 1 T Ψ Q ( u , t ) if e B A , 1 max { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } if e A B .
Consequently, ( Λ Q , C ) and ( Υ Q , C ) are the same. Thus, ( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
2. Can be analogously proven.
3. Assume for all e A
( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q .
Now,
( ( Γ Q , A ) ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q = ( Γ Q , A ) .
 □
Definition 17.
The possibility operation on a Q-NSS on U ( Γ Q , A ) is denoted by ( Γ Q , A ) and is defined as, for all e A ,
( Γ Q , A ) = e , [ ( u , t ) , 1 F Γ Q ( u , t ) , I Γ Q ( u , t ) , F Γ Q ( u , t ) ] : ( u , t ) U × Q .
Example 6.
Reconsider Example 2, then
( Γ Q , A ) = { e 1 , [ ( u 1 , s ) , 0.5 , 0.3 , 0.5 ] , [ ( u 1 , t ) , 0.9 , 0.4 , 0.1 ] , [ ( u 2 , s ) , 0.3 , 0.4 , 0.7 ] , [ ( u 2 , t ) , 0.2 , 0.2 , 0.8 ] , e 2 , [ ( u 1 , s ) , 0.1 , 0.1 , 0.9 ] , [ ( u 1 , t ) , 0.9 , 0.2 , 0.1 ] , [ ( u 2 , s ) , 0.3 , 0.3 , 0.7 ] , [ ( u 2 , t ) , 0.8 , 0.3 , 0.2 ] } .
Proposition 5.
Let ( Γ Q , A ) , ( Ψ Q , B ) be two Q-NSSs on U. Then,
1. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
2. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
3. 
( ( Γ Q , A ) ) = ( Γ Q , A ) .
Proof. 
1. ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , C ) , where C = A B and
( Λ Q , C ) = e , [ ( u , t ) , T Λ Q ( u , t ) , I Λ Q ( u , t ) , F Λ Q ( u , t ) ] : ( u , t ) U × Q ,
such that
T Λ Q ( u , t ) = T Γ Q ( u , t ) if e A B , T Ψ Q ( u , t ) if e B A , max { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } if e A B ,
I Λ Q ( u , t ) = I Γ Q ( u , t ) if e A B , I Ψ Q ( u , t ) if e B A , min { I Γ Q i ( u , t ) , I Ψ Q ( u , t ) } if e A B ,
and
F Λ Q ( u , t ) = F Γ Q ( u , t ) if e A B , F Ψ Q ( u , t ) if e B A , min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } if e A B .
Now, by Definition 17, for all e A
( Λ Q , C ) = e , [ ( u , t ) , T Λ Q ( u , t ) , I Λ Q ( u , t ) , F Λ Q ( u , t ) ] : ( u , t ) U × Q , where
T Λ Q ( u , t ) = 1 F Γ Q ( u , t ) if e A B , 1 F Ψ Q ( u , t ) if e B A , 1 min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } if e A B ,
I Λ Q ( u , t ) = I Γ Q ( u , t ) if e A B , I Ψ Q ( u , t ) if e B A , min { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } if e A B ,
and
F Λ Q ( u , t ) = F Γ Q ( u , t ) if e A B , F Ψ Q ( u , t ) if e B A , min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } if e A B .
Assume for all e A
( Γ Q , A ) = e , [ ( u , t ) , 1 F Γ Q ( u , t ) , I Γ Q ( u , t ) , F Γ Q ( u , t ) ] : ( u , t ) U × Q ,
and
( Ψ Q , B ) = e , [ ( u , t ) , 1 F Ψ Q ( u , t ) , I Ψ Q ( u , t ) , F Ψ Q ( u , t ) ] : ( u , t ) U × Q .
Now,
( Γ Q , A ) ( Ψ Q , B ) = ( Υ Q , C ) , where
( Υ Q , C ) = e , [ ( u , t ) , T Υ Q ( u , t ) , I Υ Q ( u , t ) , F Υ Q ( u , t ) ] : ( u , t ) U × Q ,
such that
T Υ Q ( u , t ) = 1 F Γ Q ( u , t ) if e A B , 1 F Ψ Q ( u , t ) if e B A , max { 1 F Γ Q ( u , t ) , 1 F Ψ Q ( u , t ) } if e A B , = 1 F Γ Q ( u , t ) if e A B , 1 F Ψ Q ( u , t ) if e B A , 1 min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } if e A B ,
I Υ Q ( u , t ) = I Γ Q ( u , t ) if e A B , I Ψ Q ( u , t ) if e B A , min { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } if e A B ,
and
F Υ Q ( u , t ) = F Γ Q ( u , t ) if e A B , F Ψ Q ( u , t ) if e B A , min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } if e A B .
Consequently, ( Λ Q , C ) and ( Υ Q , C ) are the same. Thus, ( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
2. Can be analogously proven.
3. Assume for all e A ( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q .
Now,
( ( Γ Q , A ) ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q = ( Γ Q , A ) .
 □
Proposition 6.
Let ( Γ Q , A ) be a Q-NSS over U and Q; we have the following properties:
1. 
( Γ Q , A ) = ( Γ Q , A ) .
2. 
( Γ Q , A ) = ( Γ Q , A ) .
Proof. 
1. Suppose that, for any e A ,
( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , F Γ Q ( u , t ) ] : ( u , t ) U × Q . Then ,
( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q and
( Γ Q , A ) = e , [ ( u , t ) , 1 F Γ Q ( u , t ) , I Γ Q ( u , t ) , F Γ Q ( u , t ) ] : ( u , t ) U × Q .
Thus, ( Γ Q , A ) = e , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : ( u , t ) U × Q = ( Γ Q , A ) .
2. The proof is similar to that of Assertion 1. □
Proposition 7.
Let ( Γ Q , A ) and ( Ψ Q , B ) be two Q-NSSs over U and Q, we have the following:
1. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
2. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
3. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
4. 
( ( Γ Q , A ) ( Ψ Q , B ) ) = ( Γ Q , A ) ( Ψ Q , B ) .
Proof. 
1. Assume ( Γ Q , A ) ( Ψ Q , B ) = ( Λ Q , A × B ) , where for all e a A , e b B ,
Λ Q ( e a , e b ) = { ( e a , e b ) , [ ( u , t ) , min { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , max { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } ] : ( u , t ) U × Q } .
By Definition 16, and for all e a A , e b B , we have
( ( Γ Q , A ) ( Ψ Q , B ) ) = { ( e a , e b ) , [ ( u , t ) , min { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , 1 min { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } ] : ( u , t ) U × Q } .
Since ( Γ Q , A ) = e a , [ ( u , t ) , T Γ Q ( u , t ) , I Γ Q ( u , t ) , 1 T Γ Q ( u , t ) ] : e a A , ( u , t ) U × Q , and ( Ψ Q , B ) = e b , [ ( u , t ) , T Ψ Q ( u , t ) , I Ψ Q ( u , t ) , 1 T Ψ Q ( u , t ) ] : e b B , ( u , t ) U × Q . Then, for all e a A , e b B we have
( Γ Q , A ) ( Ψ Q , B ) = { ( e a , e b ) , [ ( u , t ) , min { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , max { 1 T Γ Q ( u , t ) , 1 T Ψ Q ( u , t ) } ] : ( u , t ) U × Q } . = { ( e a , e b ) , [ ( u , t ) , min { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , 1 min { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } ] : ( u , t ) U × Q } . = ( ( Γ Q , A ) ( Ψ Q , B ) )
2. The proof is similar to that of Assertion 1.
3. Since for all e a A , e b B
( Γ Q , A ) ( Ψ Q , B ) = { ( e a , e b ) , [ ( u , t ) , min { T Γ Q ( u , t ) , T Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , max { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } ] : ( u , t ) U × Q } .
By Definition 17,
( Γ Q , A ) ( Ψ Q , B ) = { ( e a , e b ) , [ ( u , t ) , 1 max { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , max { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } ] : ( u , t ) U × Q } .
Since, ( Γ Q , A ) = e a , [ ( u , t ) , 1 F Γ Q ( u , t ) , I Γ Q ( u , t ) , F Γ Q ( u , t ) ] : e a A , ( u , t ) U × Q , and ( Ψ Q , B ) = e b , [ ( u , t ) , 1 F Ψ Q ( u , t ) , I Ψ Q ( u , t ) , F Ψ Q ( u , t ) ] : e b B , ( u , t ) U × Q . Then, for all e a A , e b B we have
( Γ Q , A ) ( Ψ Q , B ) = { ( e a , e b ) , [ ( u , t ) , min { 1 F Γ Q ( u , t ) , 1 F Ψ Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , max { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } ] : ( u , t ) U × Q } = { ( e a , e b ) , [ ( u , t ) , 1 max { F Γ Q ( u , t ) , F B Q ( u , t ) } , max { I Γ Q ( u , t ) , I Ψ Q ( u , t ) } , max { F Γ Q ( u , t ) , F Ψ Q ( u , t ) } ] : ( u , t ) U × Q } = ( ( Γ Q , A ) ( Ψ Q , B ) ) .
4. The proof is similar to that of Assertion 3. □

5. An Application of Q-Neutrosophic Soft Sets

In this section, we present a Q-NS aggregation operator of Q-NSS that produces a Q-NS from a Q-NSS and then reduces it to a Q-fuzzy set in order to use it in a decision-making problem.
Definition 18.
Let ( Γ Q , A ) be Q-NSS over U. Then, a Q-NS aggregation operator of ( Γ Q , A ) , denoted by Γ Q a g g , is defined by Γ Q a g g = { ( u , t ) , T Q a g g ( u , t ) , I Q a g g ( u , t ) , F Q a g g ( u , t ) : ( u , t ) U × Q } , which is a Q-NS over U, where T Q a g g , I Q a g g , F Q a g g : U × Q [ 0 , 1 ]
T Q a g g = 1 | A | ( u , t ) U × Q T Γ Q ( u , t ) , I Q a g g = 1 | A | ( u , t ) U × Q I Γ Q ( u , t ) a n d F Q a g g = 1 | A | ( u , t ) U × Q F Γ Q ( u , t ) .
Definition 19.
The reduced Q-fuzzy set of a Q-NS Γ Q is
Γ ^ Q = { ( u , t ) , μ Γ Q ( u , t ) : ( u , t ) U × Q } ,
where μ Γ Q : U × Q [ 0 , 1 ] and given by μ Γ Q = 1 3 [ T Q ( u , t ) + 2 I Q ( u , t ) F Q ( u , t ) ] .
Now, using the definitions of a Q-NS aggregation operator and a reduced Q- fuzzy set, we construct the following algorithm for a decision method:
Step 1 
Construct a Q-NSS over U.
Step 2 
Compute the Q-NS aggregation operator.
Step 3 
Compute the reduced Q-fuzzy set of the Q-NS aggregation operator.
Step 4 
The decision is any element in M, where M = max ( u , t ) U × Q { μ Γ Q a g g } .
Now, we provide an example for Q-NSS decision-making method.
Example 7.
Suppose a university needs to fill a position in the mathematics department to be selected by expert committee. There are three candidates, U = { u 1 , u 2 , u 3 } , with two types of scientific degree, Q = { s = a s s i s t a n t p r o f e s s o r , t = a s s o c i a t e p r o f e s s o r } , and the hiring committee considers a set of parameters E = { e 1 , e 2 , e 3 } representing experience, language fluency, and computer knowledge, respectively.
Now, we can apply the method to help the committee fill the position with the suitable candidate as follows:
Step 1 
The committee construct the following Q-NSS:
( Γ Q , A ) = { e 1 , [ ( u 1 , s ) , 0.2 , 0.3 , 0.5 ] , [ ( u 1 , t ) , 0.6 , 0.4 , 0.1 ] , [ ( u 2 , s ) , 0.1 , 0.4 , 0.7 ] , [ ( u 3 , t ) , 0.3 , 0.2 , 0.8 ] , e 2 , [ ( u 1 , s ) , 0.4 , 0.1 , 0.9 ] , [ ( u 2 , s ) , 0.6 , 0.2 , 0.1 ] , [ ( u 3 , s ) , 0.5 , 0.3 , 0.7 ] , [ ( u 3 , t ) , 0.1 , 0.3 , 0.2 ] , e 3 , ( ( u 1 , t ) , 0.2 , 0.3 , 0.6 ) , ( ( u 2 , t ) , 0.9 , 0.1 , 0.2 ) } .
Step 2 
The Q-NS aggregation operator is
Γ Q a g g = { [ ( u 1 , s ) , 0.2 , 0.133 , 0.467 ] , [ ( u 1 , t ) , 0.267 , 0.233 , 0.233 ] , [ ( u 2 , s ) , 0.233 , 0.2 , 0.267 ] , [ ( u 2 , t ) , 0.3 , 0.033 , 0.067 ] , [ ( u 3 , s ) , 0.166 , 0.1 , 0.233 ] , [ ( u 3 , t ) , 0.133 , 0.167 , 0.333 ] } .
Step 3 
The reduced Q-fuzzy set of the Γ Q a g g is
Γ ^ Q = [ ( u 1 , s ) , 0.533 ] , [ ( u 1 , t ) , 0.6 ] , [ ( u 2 , s ) , 0.589 ] , [ ( u 2 , t ) , 0.733 ] , [ ( u 3 , s ) , 0.611 ] , [ ( u 3 , t ) , 0.544 ] .
Step 4 
The largest membership grade is μ Γ Q a g g ( u 2 , t ) = 0.733 which implies that the committee is inclined to choose associate-professor candidate u 2 with a scientific degree for the job.

6. Comparative Analysis

In this section, we compare the concept of the Q-neutrosophic soft method to the neutrosophic soft method [16], Q-FSS [38], and Q-IFSS [39].
In contrast to the neutrosophic soft method that uses the NSS to characterize decision-making data, the novel Q-neutrosophic soft method introduces a new descriptor, that is, Q-NSS, to provide actual decision-making information. From Example 7, it can be seen that the NSS was unable to represent variables in two dimensions. However, the framework of the Q-NSS offers the capacity to simultaneously handle these two dimensions.
On the other hand, Q-NSS is identified through three independent degrees of membership, namely, truth, indeterminacy, and falsity. Hence, it is more accurate than Q-FSS, which is identified by one truth value, and Q-IFSS, which is identified by two dependent memberships for truth and falsity. Thus, the proposed method has certain advantages, that is, this method uses the Q-NSS to represent decision information as an extension of Q-FSS and Q-IFSS. An effective aggregation formula is employed to convert the Q-NSS to Q-NS, which preserves the entirety of the original data without reducing or distorting them. Our method also provides decision making with a simple computational process.
As a result, the Q-NSS has the ability to deal with indeterminate and inconsistent data in two-dimensional sets. Consequently, it is capable to interact with deeper imprecise data. The basic characteristics of Q-NSS were compared to those of NSS, Q-FSS, and Q-IFSS, as shown in Table 1.

7. Conclusions

Q-NSS is an NSS over a two-dimensional universal set. Thus, a Q-NSS is a tricomponent set that can simultaneously handle two-dimensional and indeterminate data. This study discussed some operations of Q-NSSs, namely, subset, equality, complement, intersection, union, AND operation, and OR operation. It discussed the necessity and possibility operations along with some properties and illustrative examples. Finally, the Q-NS aggregation operator was defined and applied to develop an algorithm for using Q-NSS in decision-making problems that involve uncertainty. This new model provides an important extension to existing studies that can handle indeterminacy, where two-dimensionality appears in the decision process, thus offering the opportunity for further relevant research. Q-NSS encourages the path to various scopes for future research since it deals with indeterminacy and two-dimensionality at the same time. Hence, it can be expanded by utilizing the n-valued refined neutrosophic set [44], possibility neutrosophic set [45], and numerous different structures. Moreover, different algebraic structures, for instance, the field, ring, and group of the Q-NSS and its extensions may be investigated.

Author Contributions

M.A.Q. and N.H. contributed equally to achieve this work.

Funding

Universiti Kebangsaan Malaysia GUP-2017-105.

Acknowledgments

We are indebted to Universiti Kebangsaan Malaysia for providing financial support and facilities for this research under grant GUP-2017-105.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [Google Scholar] [CrossRef]
  3. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  4. Smarandache, F. Neutrosophy. Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, IL, USA, 1998. [Google Scholar]
  5. Smarandache, F. Neutrosophic set, a generalisation of the intuitionistic fuzzy sets. Int. J. Pure Appl. Math. 2005, 24, 287–297. [Google Scholar]
  6. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single valued neutrosophic sets. Mult. Multistruct. 2010, 4, 410–413. [Google Scholar]
  7. Ali, M.; Smarandache, F. Complex neutrosophic set. Neural Comput. Appl. 2017, 28, 1817–1834. [Google Scholar] [CrossRef]
  8. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  9. Maji, P.K.; Biswas, R.; Roy, A.R. Fuzzy soft set theory. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  10. Xu, W.; Ma, J.; Wang, S.; Hao, G. Vague soft sets and their properties. Comput. Math. Appl. 2010, 59, 787–794. [Google Scholar] [CrossRef] [Green Version]
  11. Alhazaymeh, K.; Hassan, N. Generalized interval-valued vague soft set. Appl. Math. Sci. 2013, 7, 6983–6988. [Google Scholar] [CrossRef]
  12. Alhazaymeh, K.; Hassan, N. Interval-valued vague soft sets and its application. Adv. Fuzzy Syst. 2012, 2012, 208489. [Google Scholar] [CrossRef]
  13. Alhazaymeh, K.; Hassan, N. Possibility interval-valued vague soft set. Appl. Math. Sci. 2013, 7, 6989–6994. [Google Scholar] [CrossRef]
  14. Alkhazaleh, S.; Salleh, A.R. Soft expert sets. Adv. Decis. Sci. 2011, 2011, 757868. [Google Scholar] [CrossRef]
  15. Alkhazaleh, S.; Salleh, A.R.; Hassan, N. Soft multi sets theory. Appl. Math. Sci. 2011, 5, 3561–3573. [Google Scholar]
  16. Maji, P.K. Neutrosophic soft set. Ann. Fuzzy Math. Inform. 2013, 5, 157–168. [Google Scholar]
  17. Broumi, S. Generalized neutrosophic soft set. Int. J. Comput. Sci. Eng. Inf. Technol. 2013, 3, 17–30. [Google Scholar] [CrossRef]
  18. Broumi, S.; Smarandache, F. Intuitionistic neutrosophic soft set. J. Inf. Comput. Sci. 2013, 8, 130–140. [Google Scholar]
  19. Deli, I. Interval-valued neutrosophic soft sets and its decision making. Int. J. Mach. Learn. Cybern. 2017, 8, 665–676. [Google Scholar] [CrossRef]
  20. Deli, I.; Broumi, S. Neutrosophic soft matrices and NSM decision making. J. Intell. Fuzzy Syst. 2015, 28, 2233–2241. [Google Scholar] [CrossRef]
  21. Karaaslan, F. Neutrosophic soft sets with applications in decision making problem. Int. J. Inf. Sci. Intell. Syst. 2015, 4, 1–20. [Google Scholar]
  22. Ye, J.; Cui, W. Exponential entropy for simplified neutrosophic sets and its application in decision making. Entropy 2018, 20, 357. [Google Scholar] [CrossRef]
  23. Ye, J. Exponential operations and aggregation operators of interval neutrosophic sets and their decision making methods. SpringerPlus 2016, 5, 1488. [Google Scholar] [CrossRef]
  24. Hassan, N.; Uluçay, V.; Şahin, M. Q-neutrosophic soft expert set and its application in decision making. Int. J. Fuzzy Syst. Appl. 2018, 7, 37–61. [Google Scholar] [CrossRef]
  25. Al-Quran, A.; Hassan, N. Neutrosophic vague soft set and its applications. Malays. J. Math. Sci. 2017, 11, 141–163. [Google Scholar]
  26. Al-Quran, A.; Hassan, N. Neutrosophic vague soft expert set theory. J. Intell. Fuzzy Syst. 2016, 30, 3691–3702. [Google Scholar] [CrossRef]
  27. Alkhazaleh, S. n-Valued refined neutrosophic soft set theory. J. Intell. Fuzzy Syst. 2017, 32, 4311–4318. [Google Scholar] [CrossRef]
  28. Al-Quran, A.; Hassan, N. The complex neutrosophic soft expert set and its application in decision making. J. Intell. Fuzzy Syst. 2018, 34, 569–582. [Google Scholar] [CrossRef]
  29. Al-Quran, A.; Hassan, N. The complex neutrosophic soft expert relation and its multiple attribute decision-making method. Entropy 2018, 20, 101. [Google Scholar] [CrossRef]
  30. Alkhazaleh, S. Time-neutrosophic soft set and its application. J. Intell. Fuzzy Syst. 2016, 30, 1087–1098. [Google Scholar] [CrossRef]
  31. Wu, X.H.; Wang, J.Q.; Peng, J.J.; Chen, X.H. Cross-entropy and prioritized aggregation operator with simplified neutrosophic sets and their application in multi-criteria decision-making problems. J. Intell. Fuzzy Syst. 2016, 18, 1104–1116. [Google Scholar] [CrossRef]
  32. Chen, J.Q.; Ye, J. Some single-valued neutrosophic Dombi weighted aggregation operators for multiple attribute decision-making. Symmetry 2017, 9, 82. [Google Scholar] [CrossRef]
  33. Peng, J.J.; Wang, J.Q.; Wu, X.H.; Wang, J.; Chen, X.H. Multi-valued neutrosophic sets and power aggregation operators with their applications in multi-criteria group decision-making problems. Int. J. Comput. Intell. Syst. 2015, 8, 345–363. [Google Scholar] [CrossRef]
  34. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. Int. J. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  35. Li, X.; Zhang, X. Single-valued neutrosophic hesitant fuzzy Choquet aggregation operators for multi-attribute decision making. Symmetry 2018, 10, 50. [Google Scholar] [CrossRef]
  36. Lu, Z.; Ye, J. Single-valued neutrosophic hybrid arithmetic and geometric aggregation operators and their decision-making method. Information 2017, 8, 84. [Google Scholar] [CrossRef]
  37. Adam, F.; Hassan, N. Multi Q-fuzzy soft set and its application. Far East J. Math. Sci. 2015, 97, 871–881. [Google Scholar] [CrossRef]
  38. Adam, F.; Hassan, N. Operations on Q-fuzzy soft set. Appl. Math. Sci. 2014, 8, 8697–8701. [Google Scholar] [CrossRef]
  39. Broumi, S. Q-intuitionistic fuzzy soft sets. J. New Theory 2015, 5, 80–91. [Google Scholar]
  40. Abu Qamar, M.; Hassan, N. Q-Neutrosophic soft relation and its application in decision making. Entropy 2018, 20, 172. [Google Scholar] [CrossRef]
  41. Abu Qamar, M.; Hassan, N. Entropy, measures of distance and similarity of Q-neutrosophic soft sets and some applications. Entropy 2018, 20, 672. [Google Scholar] [CrossRef]
  42. Abu Qamar, M.; Hassan, N. Generalized Q-neutrosophic soft expert set for decision under uncertainty. Symmetry 2018, 10, 621. [Google Scholar] [CrossRef]
  43. Smarandache, F. A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, MA, USA, 1999. [Google Scholar]
  44. Smarandache, F. n-Valued Refined Neutrosophic Logic and Its Applications in Physics. Prog. Phys. 2013, 4, 143–146. [Google Scholar]
  45. Karaaslan, F. Possibility neutrosophic soft sets and PNS-decision making method. Appl. Soft Comput. 2017, 54, 403–414. [Google Scholar] [CrossRef]
Table 1. Characteristic comparison of the Q-neutrosophic soft set (Q-NSS) with other variants.
Table 1. Characteristic comparison of the Q-neutrosophic soft set (Q-NSS) with other variants.
MethodNSSQ-FSSQ-IFSSQ-NSS
AuthorsMaji [16]Adam and Hassan [38]Broumi [39]Proposed Method
DomainUniverse of discourseUniverse of discourseUniverse of discourseUniverse of discourse
Codomain [ 0 , 1 ] 3 [ 0 , 1 ] [ 0 , 1 ] 2 [ 0 , 1 ] 3
QNoYesYesYes
TrueYesYesYesYes
IndeterminacyYesNoNoYes
FalsityYesNoYesYes

Share and Cite

MDPI and ACS Style

Abu Qamar, M.; Hassan, N. An Approach toward a Q-Neutrosophic Soft Set and Its Application in Decision Making. Symmetry 2019, 11, 139. https://doi.org/10.3390/sym11020139

AMA Style

Abu Qamar M, Hassan N. An Approach toward a Q-Neutrosophic Soft Set and Its Application in Decision Making. Symmetry. 2019; 11(2):139. https://doi.org/10.3390/sym11020139

Chicago/Turabian Style

Abu Qamar, Majdoleen, and Nasruddin Hassan. 2019. "An Approach toward a Q-Neutrosophic Soft Set and Its Application in Decision Making" Symmetry 11, no. 2: 139. https://doi.org/10.3390/sym11020139

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