Next Article in Journal
Optimum Geometric Transformation and Bipartite Graph-Based Approach to Sweat Pore Matching for Biometric Identification
Next Article in Special Issue
Neutrosophic Weighted Support Vector Machines for the Determination of School Administrators Who Attended an Action Learning Course Based on Their Conflict-Handling Styles
Previous Article in Journal
On Topological Properties of Symmetric Chemical Structures
Previous Article in Special Issue
Linguistic Neutrosophic Generalized Partitioned Bonferroni Mean Operators and Their Application to Multi-Attribute Group Decision Making
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Neutrosophic Hesitant Fuzzy Subalgebras and Filters in Pseudo-BCI Algebras

1
College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China
2
Department of Mathematics, School of Arts and Sciences, Shaanxi University of Science & Technology, Xi’an 710021, China
3
Department of Mathematics, College of Arts and Sciences, Shanghai Maritime University, Shanghai 201306, China
4
Department of Mathematics, University of New Mexico, Gallup, NM 87301, USA
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(5), 174; https://doi.org/10.3390/sym10050174
Submission received: 29 April 2018 / Revised: 13 May 2018 / Accepted: 14 May 2018 / Published: 18 May 2018

Abstract

:
The notions of the neutrosophic hesitant fuzzy subalgebra and neutrosophic hesitant fuzzy filter in pseudo-BCI algebras are introduced, and some properties and equivalent conditions are investigated. The relationships between neutrosophic hesitant fuzzy subalgebras (filters) and hesitant fuzzy subalgebras (filters) is discussed. Five kinds of special sets are constructed by a neutrosophic hesitant fuzzy set, and the conditions for the two kinds of sets to be filters are given. Moreover, the conditions for two kinds of special neutrosophic hesitant fuzzy sets to be neutrosophic hesitant fuzzy filters are proved.

1. Introduction

G. Georgescu and A. Iogulescu presented pseudo-BCKalgebras, which was an extension of the famous BCK algebra theory. In [1], the notion of the pseudo-BCI algebra was introduced by W.A. Dudek and Y.B. Jun. They investigated some properties of pseudo-BCI algebras. In [2], Y.B. Jun et al. presented the concept of the pseudo-BCI ideal in pseudo-BCI algebras and researched its characterizations. Then, some classes of pseudo-BCI algebras and pseudo-ideals (filters) were studied; see [3,4,5,6,7,8,9,10,11,12,13,14].
In 1965, Zadeh introduced fuzzy set theory [15]. In the study of modern fuzzy logic theory, algebraic systems played an important role, such as [16,17,18,19,20,21,22]. In 2010, Torra introduced hesitant fuzzy set theory [23]. The hesitant fuzzy set was a useful tool to express peoples’ hesitancy in real life, and uncertainty problems were resolved. Furthermore, hesitant fuzzy sets have been applied to decision making and algebraic systems [24,25,26,27,28,29,30,31]. As a generalization of fuzzy set theory, Smarandache introduced neutrosophic set theory [32]; the neutrosophic set theory is a useful tool to deal with indeterminate and inconsistent decision information [33,34]. The neutrosophic set includes the truth membership, indeterminacy membership and falsity membership. Then, Wang et al. [35,36] introduced the interval neutrosophic set and single-valued neutrosophic set. Ye [37] introduced the single-valued neutrosophic hesitant fuzzy set as an extension of the single-valued neutrosophic set and hesitant fuzzy set. Recently, the neutrosophic triplet structures were introduced and researched [38,39,40].
In this paper, some preliminary concepts in pseudo-BCI algebras, hesitant fuzzy set theory and neutrosophic set theory are briefly reviewed in Section 2. In Section 3, the notion of neutrosophic hesitant fuzzy subalgebras in pseudo-BCI algebras is introduced. The relationships between neutrosophic hesitant fuzzy subalgebras and hesitant fuzzy subalgebras are investigated. Five kinds of special sets are constructed. Some properties are studied. Third, the two kinds of sets to be filters are given. In Section 4, the concept of neutrosophic hesitant fuzzy filters in pseudo-BCI algebras is proposed. The equivalent conditions of the neutrosophic hesitant fuzzy filters in the construction of hesitant fuzzy filters are given. The conditions for two kinds of special neutrosophic hesitant fuzzy sets to be neutrosophic hesitant fuzzy filters are given.

2. Preliminaries

Let us review some fundamental notions of pseudo-BCI algebra and interval-valued hesitant fuzzy filter in this section.
Definition 1.
([13]) A pseudo-BCI algebra is a structure (X; →, ↪, 1), where “→” and “↪” are binary operations on X and “1” is an element of X, verifying the axioms: x , y , z X ,
(1) 
( y z ) ( ( z x ) ( y x ) ) = 1 , ( y z ) ( ( z x ) ( y x ) ) = 1 ;
(2) 
x ( ( x y ) y ) = 1 , x ( ( x y ) y ) = 1 ;
(3) 
x x = 1 ;
(4) 
x y = y x = 1 x = y ;
(5) 
x y = 1 x y = 1 .
If (X; →, ↪, 1) is a pseudo-BCI algebra satisfying x , y X , x y = x y , then (X; →, 1) is a BCI algebra. If (X; →, ↪, 1) is a pseudo-BCI algebra satisfying x X , x 1 = 1 , then (X; →, ↪, 1) is a pseudo-BCK algebra.
Remark 1.
([1]) In any pseudo-BCI algebra ( X ; , ) , we can define a binary relation ‘≤’ by putting:
x y   i f   a n d   o n l y   i f   x y ( o r   x y ) .
Proposition 1.
([13]) Let ( X ; , ) be a pseudo-BCI algebra, then X satisfies the following properties, x , y , z X ,
(1) 
1 x x = 1 ;
(2) 
x y y z x z , y z x z ;
(3) 
x y , y z x z ;
(4) 
x ( y z ) = y ( x z ) ;
(5) 
x y z y x z ;
(6) 
x y ( z x ) ( z y ) , x y ( z x ) ( z y ) ;
(7) 
x y z x z y , z x z y ;
(8) 
1 x = x , 1 x = x ;
(9) 
( ( y x ) x ) x = y x , ( ( y x ) x ) x = y x ;
(10) 
x y ( y x ) 1 , x y ( y x ) 1 ;
(11) 
( x y ) 1 = ( x 1 ) ( y 1 ) , ( x y ) 1 = ( x 1 ) ( y 1 ) ;
(12) 
x 1 = x 1 .
Definition 2.
([13]) A subset F of a pseudo-BCI algebra X is called a filter of X if it satisfies:
(F1) 
1 F ;
(F2) 
x F , x y F y F ;
(F3) 
x F , x y F y F .
Definition 3.
([1]) By a pseudo-BCI subalgebra of a pseudo- B C I algebra X, we mean a subset S of X that satisfies x , y S , x y S , x y S .
Definition 4.
([12]) A pseudo-BCK algebra is called a type-2 positive implicative if it satisfies:
x ( y z ) = ( x y ) ( x z ) ,
x ( y z ) = ( x y ) ( x z ) .
If X is a type-2 positive implicative pseudo-BCK algebra, then x y = x y for all x X .
Definition 5.
([23]) Let X be a reference set. A hesitant fuzzy set A on X is defined in terms of a function h A ( x ) that returns a subset of [ 0 , 1 ] when it is applied to X, i.e.,
A = { ( x , h A ( x ) ) | x X } .
where h A ( x ) is a set of some different values in [ 0 , 1 ] , representing the possible membership degrees of the element x X . h A ( x ) is called a hesitant fuzzy element, a basis unit of the hesitant fuzzy set.
Example 1.
Let X = { a , b , c } be a reference set, h A ( a ) = [ 0.1 , 0.2 ] , h A ( b ) = [ 0.3 , 0.6 ] , h A ( c ) = [ 0.7 , 0.8 ] . Then, A is considered as a hesitant fuzzy set,
A = { ( a , [ 0.1 , 0.2 ] ) , ( b , [ 0 . 0.3 , 0.6 ] ) , ( c , [ 0.7 , 0.8 ] ) } .
Definition 6.
([13]) A fuzzy set μ : X [ 0 , 1 ] is called a fuzzy pseudo-filter (fuzzy filter) of a pseudo-BCI algebra X if it satisfies:
(FF1) 
μ ( 1 ) μ ( x ) , x X ;
(FF2) 
μ ( y ) μ ( x y ) μ ( x ) , x , y X ;
(FF3) 
μ ( y ) μ ( x y ) μ ( x ) , x , y X .
Definition 7.
([32]) Let X be a non-empty fixed set, a neutrosophic set A on X is defined as:
A = { ( x , T A ( x ) , I A ( x ) , F A ( x ) ) | x X } ,
where T A ( x ) , I A ( x ) , F A ( x ) [ 0 , 1 ] , denoting the truth, indeterminacy and falsity membership degree of the element x X , respecting, and satisfying the limit: 0 T A ( x ) + I A ( x ) + F A ( x ) 3 .
Definition 8.
([34]) Let X be a fixed set; a neutrosophic hesitant fuzzy set N on X is defined as
N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } ,
in which t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) P ( [ 0 , 1 ] ) , denoting the possible truth membership hesitant degrees, indeterminacy membership hesitant degrees and falsity membership hesitant degrees of x X to the set N, respectively, with the conditions 0 δ , γ , η 1 and 0 δ + + γ + + η + 3 , where γ t ˜ N ( x ) , δ i ˜ N ( x ) , η f ˜ N ( x ) , γ + γ t ˜ N ( x ) m a x { γ } , δ + δ i ˜ N ( x ) m a x { δ } , η + η f ˜ N ( x ) m a x { η } for x X .
Example 2.
Let X = { a , b , c } be a reference set, h A ( a ) = ( [ 0.4 , 0.5 ] , [ 0.1 , 0.2 ] , [ 0.2 , 0.4 ] ) , h A ( b ) = ( [ 0.5 , 0.6 ] , { 0.2 , 0.3 } , [ 0.3 , 0.4 ] ) , h A ( c ) = ( [ 0.5 , 0.8 ] , [ 0.2 , 0.4 ] , { 0.3 , 0.5 } ) . Then, A is considered as a neutrosophic hesitant fuzzy set,
A = { ( a , [ 0.4 , 0.5 ] , [ 0.1 , 0.2 ] , [ 0.2 , 0.4 ] ) , ( b , [ 0.5 , 0.6 ] , { 0.2 , 0.3 } , [ 0.3 , 0.4 ] ) , ( c , [ 0.5 , 0.8 ] , [ 0.2 , 0.4 ] , { 0.3 , 0.5 } ) } .
Conveniently, N ( x ) = { t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) } is called a neutrosophic hesitant fuzzy element, which is denoted by the simplified symbol N ( x ) = { t ˜ N , i ˜ N , f ˜ N } .
Definition 9.
([34]) Let N 1 = { t ˜ N 1 , i ˜ N 1 , f ˜ N 1 } and N 2 = { t ˜ N 2 , i ˜ N 2 , f ˜ N 2 } be two neutrosophic hesitant fuzzy sets, then:
N 1 N 2 = { t ˜ N 1 t ˜ N 2 , i ˜ N 1 i ˜ N 2 , f ˜ N 1 f N 2 } ;
N 1 N 2 = { t ˜ N 1 t ˜ N 2 , i ˜ N 1 i ˜ N 2 , f ˜ N 1 f N 2 } .

3. Neutrosophic Hesitant Fuzzy Subalgebras of Pseudo-BCI Algebras

In the following, let X be a pseudo-BCI algebra, unless otherwise specified.
Definition 10.
A hesitant fuzzy set A = { ( x , h A ( x ) ) | x X } is called a hesitant fuzzy pseudo-subalgebra (hesitant fuzzy subalgebra) of X if it satisfies:
(HFS2) 
h A ( x ) h A ( y ) h A ( x y ) , x , y X ;
(HFS3) 
h A ( x ) h A ( y ) h A ( x y ) , x , y X .
Definition 11.
A neutrosophic hesitant fuzzy set N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is called a neutrosophic hesitant fuzzy pseudo-subalgebra (neutrosophic hesitant fuzzy subalgebra) of X if it satisfies:
(1) 
t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) , t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) , x , y X ;
(2) 
i ˜ N ( x ) i ˜ N ( y ) i ˜ N ( x y ) , i ˜ N ( x ) i ˜ N ( y ) i ˜ N ( x y ) , x , y X ;
(3) 
f ˜ N ( x ) f ˜ N ( y ) f ˜ N ( x y ) , f ˜ N ( x ) f ˜ N ( y ) f ˜ N ( x y ) , x , y X .
Example 3.
Let X = { a , b , c , d , 1 } with two binary operations in Table 1 and Table 2.
Then, ( X ; , , 1 ) is a pseudo-BCI algebra. Let:
N = { ( 1 , [ 0 , 1 ] , { 0 , 1 16 } , [ 0 , 1 6 ] ) , ( a , [ 1 3 , 1 4 ] , [ 0 , 1 2 ] , [ 0 , 5 6 ] ) , ( b , [ 0 , 1 2 ] , [ 0 , 2 3 ] , [ 0 , 2 3 ] ) , ( c , [ 1 3 , 2 3 ] , [ 0 , 1 6 ] , [ 0 , 1 5 ] ) , ( d , [ 1 3 , 1 ] , [ 0 , 1 3 ] , [ 0 , 1 5 ] ) } .
then, N is a neutrosophic hesitant fuzzy subalgebra of X.
Considering three hesitant fuzzy sets H t ˜ N , H i ˜ N , H f ˜ N by:
H t ˜ N = { ( x , t ˜ N ( x ) ) | x X } , H i ˜ N = { ( x , 1 i ˜ N ( x ) ) | x X } , H f ˜ N = { ( x , 1 f ˜ N ( x ) ) | x X } .
Therefore, H t ˜ N is called a generated hesitant fuzzy set by function t ˜ N ( x ) ; H i ˜ N is called a generated hesitant fuzzy set by function i ˜ N ( x ) ; H f ˜ N is called a generated hesitant fuzzy set by function f ˜ N ( x ) .
Theorem 1.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( y ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. Then, N is a neutrosophic hesitant fuzzy subalgebra of X if and only if it satisfies the conditions: x X , H t ˜ N and H i ˜ N , H f ˜ N are hesitant fuzzy subalgebras of X.
Proof. Necessity:
(i) By Definition 10 and Definition 11, we can obtain that H t ˜ N is a hesitant fuzzy subalgebra of X.
(ii) x , y X , ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( y ) ) 1 i ˜ N ( x y ) , ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( y ) ) 1 i ˜ N ( x y ) .
Similarly, ( 1 f ˜ N ( x ) ) ( 1 f ˜ N ( y ) ) 1 f ˜ N ( x y ) , ( 1 f ˜ N ( x ) ) ( 1 f ˜ N ( y ) ) 1 f ˜ N ( x y ) . Therefore, x X , H i ˜ N = { ( x , 1 i ˜ ( x ) ) | x X } and H f ˜ N = { ( x , 1 f ˜ N ( x ) ) | x X } are hesitant fuzzy subalgebras of X.
Sufficiency: (i) Let x , y H t ˜ N . Obviously, t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) , t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) .
(ii) Let x , y H i ˜ N . By Definition 10, we have ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) 1 i ˜ N ( x y ) , ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) 1 i ˜ N ( x y ) , thus i ˜ N ( x ) i ˜ N ( y ) i ˜ N ( x y ) , i ˜ N ( x ) i ˜ N ( y ) i ˜ N ( x y ) .
Similarly, Let x , y H f ˜ N ; we have f ˜ N ( x ) f ˜ N ( y ) f ˜ N ( x y ) , f ˜ N ( x ) f ˜ N ( y ) f ˜ ( x y ) .
That is, N is a neutrosophic hesitant fuzzy subalgebra of X. ☐
Theorem 2.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. Then, the following conditions are equivalent:
(1) N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is a neutrosophic hesitant fuzzy subalgebra of X;
(2) λ 1 , λ 2 , λ 3 P ( [ 0 , 1 ] ) , the nonempty hesitant fuzzy level sets H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) , H f ˜ N ( λ 3 ) are subalgebras of X, where P ( [ 0 , 1 ] ) is the power set of [ 0 , 1 ] ,
H t ˜ N ( λ 1 ) = { x X | λ 1 t ˜ N ( x ) } , H i ˜ N ( λ 2 ) = { x X | λ 2 1 i ˜ N ( x ) } , H f ˜ N ( λ 3 ) = { x X | λ 3 1 f ˜ N ( x ) } .
Proof. 
(1)⇒(2) Suppose H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) , H f ˜ N ( λ 3 ) are nonempty sets. If x , y H t ˜ N ( λ 1 ) , then λ 1 t ˜ N ( x ) , λ 1 t ˜ N ( y ) . Since N is a neutrosophic hesitant fuzzy subalgebra of X, by Definition 11, we can obtain:
λ 1 t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) , λ 1 t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) ;
then x y , x y H t ˜ N ( λ 1 ) , H t ˜ N ( λ 1 ) is a subalgebra of X.
If x , y H i ˜ N ( λ 2 ) , then λ 2 1 i ˜ N ( x ) , λ 2 1 i ˜ N ( y ) . Since N is a neutrosophic hesitant fuzzy subalgebra of X, by Definition 11, we can obtain:
λ 2 ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( y ) ) 1 i ˜ N ( x y ) ,
λ 2 ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( y ) ) 1 i ˜ N ( x y ) ;
Thus, x y , x y H i ˜ N ( λ 2 ) , H i ˜ N ( λ 2 ) is a subalgebra of X.
Similarly, we can obtain then that H f ˜ N ( λ 3 ) is a subalgebra of X.
(2)⇒(1) Suppose that H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) , H f ˜ N ( λ 3 ) are nonempty subalgebras of X, λ 1 , λ 2 , λ 3 P ( [ 0 , 1 ] ) . Let x , y X with t ˜ N ( x ) = μ 1 , t ˜ N ( y ) = μ 2 . Let μ 1 μ 2 = λ 1 . Therefore, we have x , y H X ( 1 ) ( λ 1 ) . Since H X ( 1 ) ( λ 1 ) is a subalgebra, we can obtain x y , x y H t ˜ N ( λ 1 ) . Hence, we can obtain:
t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) , t ˜ N ( x ) t ˜ N ( y ) t ˜ N ( x y ) ;
Let x , y X with i ˜ ( x ) = μ 3 , i ˜ ( y ) = μ 4 . Let ( 1 μ 3 ) ( 1 μ 4 ) = λ 2 . Then, we have x , y H i ˜ N ( λ 2 ) . Since H i ˜ N ( λ 2 ) is a subalgebra, we can obtain x y , x y H f ˜ N ( λ 2 ) . Hence, we can obtain ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( y ) ) = λ 2 1 i ˜ N ( x y ) , ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( y ) ) = λ 2 1 i ˜ N ( x y ) . Then, we have i ˜ N ( x ) i ˜ N ( y ) i ˜ N ( x y ) , i ˜ N ( x ) i ˜ N ( y ) i ˜ N ( x y ) .
Similarly, let x , y X with f ˜ N ( x ) = μ 5 , f ˜ N ( y ) = μ 6 ; we can obtain f ˜ N ( x ) f ˜ N ( y ) f ˜ N ( x y ) , f ˜ N ( x ) f ˜ N ( y ) f ˜ N ( x y ) .
Thus, N is a neutrosophic hesitant fuzzy subalgebra of X. ☐
Definition 12.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. X N ( 1 ) ( a k , b ) , X N ( 2 ) ( a k , b ) , X N ( 3 ) ( a k , b ) , X N ( 4 ) ( a k , b ) , X N ( 5 ) ( a ) are called generated subsets by N: a , b X , k N ,
X N ( 1 ) ( a k , b ) = { x X | t ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , i ˜ N ( a k ( b x ) ) = i ˜ N ( 1 ) , f ˜ N ( a k ( b x ) ) = f ˜ N ( 1 ) } ; X N ( 2 ) ( a k , b ) = { x X | t ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , i ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , f ˜ N ( a k ( b x ) ) = f ˜ N ( 1 ) } ; X N ( 3 ) ( a k , b ) = { x X | t ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , i ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , f ˜ N ( a k ( b x ) ) = f ˜ N ( 1 ) } ; X N ( 4 ) ( a k , b ) = { x X | t ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , i ˜ N ( a k ( b x ) ) = i ˜ N ( 1 ) , f ˜ N ( a k ( b x ) ) = f ˜ N ( 1 ) , t ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , i ˜ N ( a k ( b x ) ) = i ˜ N ( 1 ) , f ˜ N ( a k ( b x ) ) = f ˜ N ( 1 ) } ; X N ( 5 ) ( a ) = { x X | t ˜ N ( a ) t ˜ N ( x ) , i ˜ N ( a ) i ˜ N ( x ) , f ˜ N ( a ) f ˜ N ( x ) } .
where “a” appears “k” times, “*” represents any binary operation “→” or “↪” on X,
a k ( b x ) = a ( a ( ( a ( b x ) ) ) ) ;
a k ( b x ) ) = a ( a ( ( a ( b x ) ) ) ) ;
a k ( b x ) ) = a ( a ( ( a ( b x ) ) ) ) ;
a k ( b x ) ) = a ( a ( ( a ( b x ) ) ) ) ;
a k ( b x ) = a ( a ( ( a ( b x ) ) ) ) .
Theorem 3.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. If N satisfies the following conditions:
(1) t ˜ N ( x ) t ˜ N ( 1 ) , t ˜ N ( x y ) = t ˜ N ( x ) t ˜ N ( y ) , x , y X ;
(2) i ˜ N ( x ) i ˜ N ( 1 ) , i ˜ N ( x y ) = i ˜ N ( x ) i ˜ N ( y ) , x , y X ;
(3) f ˜ N ( x ) f ˜ N ( 1 ) , f ˜ N ( x y ) = f ˜ N ( x ) f ˜ N ( y ) , x , y X ;
then X N ( 1 ) ( a k , b ) = X , k N .
Proof. 
By Proposition 1, we can obtain x X ,
t ˜ N ( a k ( b x ) = t ˜ N ( 1 ( a k ( b x ) ) ) = t ˜ N ( 1 ) t ˜ N ( a k ( b x ) ) ) = t ˜ N ( 1 ) . i ˜ N ( a k ( b x ) ) = i ˜ N ( 1 ( a k ( b x ) ) ) = i ˜ N ( 1 ) t ˜ N ( a k ( b x ) ) ) = i ˜ N ( 1 ) . f ˜ N ( a k ( b x ) ) = f ˜ N ( 1 ( a k ( b x ) ) ) = f ˜ N ( 1 ) t ˜ N ( a k ( b x ) ) ) = f ˜ N ( 1 ) .
Thus, x X N ( 1 ) ( a k , b ) , X X N ( 1 ) ( a k , b ) .
Conversely, it is easy to check that X N ( 1 ) ( a k , b ) X .
Finally, we can obtain X = X N ( 1 ) ( a k , b ) . ☐
Corollary 1.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. If N satisfies the following conditions:
(1) t ˜ N ( x ) t ˜ N ( 1 ) , t ˜ N ( x y ) = t ˜ N ( x ) t ˜ N ( y ) , x , y X ;
(2) i ˜ N ( x ) i ˜ N ( 1 ) , i ˜ N ( x y ) = i ˜ N ( x ) i ˜ N ( y ) , x , y X ;
(3) f ˜ N ( x ) f ˜ N ( 1 ) , f ˜ N ( x y ) = f ˜ N ( x ) f ˜ N ( y ) , x , y X ;
then X N ( 1 ) ( a k , b ) = X , k N .
Theorem 4.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. N satisfies the following conditions:
(1) t ˜ N ( 1 ) t ˜ N ( x ) , i ˜ N ( 1 ) i ˜ N ( x ) , f ˜ N ( 1 ) f ˜ N ( x ) , x X ;
(2) x y = 1 t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( y ) , x , y X .
If a , b , c X , k N , b c , then X N ( 2 ) ( a k , c ) X N ( 2 ) ( a k , b ) .
Proof: 
Let x X N ( 2 ) ( a k , c ) . If b c , by Proposition 1, we can obtain:
t ˜ N ( 1 ) = t ˜ N ( a k ( c x ) ) = t ˜ N ( c ( a k x ) ) t ˜ N ( b ( a k x ) ) = t ˜ N ( a k ( b x ) ) .
Similarly, we can obtain:
i ˜ N ( a k ( b x ) ) i ˜ N ( a k ( c x ) ) i ˜ N ( 1 ) ;
f ˜ N ( a k ( b x ) ) f ˜ N ( a k ( c x ) ) f ˜ N ( 1 ) .
That is, x X N ( 2 ) ( a k , b ) , X N ( 2 ) ( a k , c ) X N ( 2 ) ( a k , b ) .
Corollary 2.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. N satisfies the following conditions:
(1) t ˜ N ( 1 ) t ˜ N ( x ) , i ˜ N ( 1 ) i ˜ N ( x ) , f ˜ N ( 1 ) f ˜ N ( x ) , x X ;
(2) x y = 1 t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( y ) , x , y X .
If a , b , c X , k N , b c , then X N ( 3 ) ( a k , c ) X N ( 3 ) ( a k , b ) .
The following example shows that X N ( 4 ) ( a k , b ) may not be a filter of X.
Example 4.
Let X = { a , b , c , d , 1 } with two binary operations in Table 3 and Table 4.
Then, ( X ; , , 1 ) is a pseudo-BCI algebra. Let:
N = { ( 1 , [ 0 , 1 ] , [ 1 6 , 1 5 ] , [ 0 , 1 5 ] ) , ( a , [ 1 3 , 1 4 ] , [ 0 , 5 6 ] , [ 0 , 3 4 ] ) , ( b , [ 0 , 1 2 ] , [ 1 6 , 3 4 ] , [ 0 , 1 3 ] ) , ( c , [ 1 3 , 2 3 ] , [ 0 , 3 5 ] , [ 0 , 1 4 ] ) , ( d , [ 1 3 , 1 ] , [ 1 6 , 1 3 ] , [ 0 , 5 6 ] ) } .
then X N ( 4 ) ( c , d ) = { a , c , d , 1 } is not a filter of X. Since c b = c X N ( 4 ) ( c , d ) , but b X N ( 4 ) ( c , d ) .
Theorem 5.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. Let X be a type-2 positive implicative pseudo-BCK algebra. If functions t ˜ N ( x ) , i ˜ N ( x ) and f ˜ N ( x ) are injective, then X N ( 4 ) ( a k , b ) is a filter of X for all a , b X , k N .
Proof. 
(1) If X is a pseudo-BCK algebra, then by Definition 1 and Proposition 1, we can obtain 1 X N ( 4 ) ( a k , b ) .
(2) Let x , y X with x , x y X N ( 4 ) ( a k , b ) . Thus, a k ( b x ) = 1 , a k ( b ( x y ) ) = 1 . Since functions t ˜ N , i ˜ N and f ˜ N are injective, by Definition 5, we have:
t ˜ N ( 1 ) = t ˜ N ( a k ( b ( x y ) ) ) = t ˜ N ( a k ( ( b x ) ( b y ) ) ) = t ˜ N ( ( a k ( b x ) ) ( a k ( b y ) ) ) = t ˜ N ( 1 ( a k ( b y ) ) ) = t ˜ N ( a k ( ( b y ) ) .
Similarly, we can obtain i ˜ N ( a k ( ( b y ) ) = i ˜ N ( 1 ) , f ˜ N ( a k ( ( b y ) ) = f ˜ N ( 1 ) . Thus, we have y X N ( 4 ) ( a k , b ) .
(3) Similarly, let x , y X with x , x y X N ( 4 ) ( a k , b ) ; we have y X N ( 4 ) ( a k , b ) . ☐
This means that X N ( 4 ) ( a k , b ) is a filter of X for all a , b X , k N .
Theorem 6.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } be a neutrosophic hesitant fuzzy set on X. Let X be a type-2 positive implicative pseudo-BCK algebra. If functions t ˜ N ( x ) , i ˜ N ( x ) and f ˜ N ( x ) satisfy the following identifies: x , y X ,
(1) t ˜ N ( x ) t ˜ N ( 1 ) , i ˜ N ( x ) i N ( 1 ) , f ˜ N ( x ) f N ( 1 ) ;
(2) t ˜ N ( x y ) = t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x y ) = i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x y ) = f ˜ N ( x ) f ˜ N ( y ) ;
(3) t ˜ N ( x y ) = t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x y ) = i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x y ) = f ˜ N ( x ) f ˜ N ( y ) ;
then X N ( 4 ) ( a k , b ) is a filter of X for all a , b X , k N .
Proof. 
(1) If X is a pseudo-BCK algebra, by Definition 1 and Proposition 1, 1 X N ( 4 ) ( a k , b ) .
(2) Let x , y X with x , x y X N ( 4 ) ( a k , b ) . We have t ˜ N ( a k ( b x ) ) = t ˜ N ( 1 ) , t ˜ N ( a k ( b ( x y ) ) ) = t ˜ N ( 1 ) . By Definition 5, we have:
t ˜ N ( 1 ) = t ˜ N ( a k ( b ( x y ) ) ) = t ˜ N ( a k ( ( b x ) ( b y ) ) ) = t ˜ N ( ( a k ( b x ) ) ( a k ( b y ) ) ) = t ˜ N ( a k ( b x ) ) t ˜ ( a k ( b y ) ) = t ˜ N ( 1 ) t ˜ ( a k ( b y ) ) = t ˜ N ( a k ( b y ) ) .
Similarly, we can obtain i ˜ N ( a k ( b y ) ) = i ˜ N ( 1 ) , f ˜ N ( a k ( b y ) ) = f ˜ N ( 1 ) . Thus, we have y X N ( 4 ) ( a k , b ) .
(3) Similarly, let x , y X with x , x y X N ( 4 ) ( a k , b ) ; we have y X N ( 4 ) ( a k , b ) .
This means that X N ( 4 ) ( a k , b ) is a filter of X for all a , b X , k N . ☐
Theorem 7.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } be a neutrosophic hesitant fuzzy set on X and F be a filter of X. If functions t ˜ N ( x ) , i ˜ N ( x ) and f ˜ N ( x ) are injective, then X N ( 4 ) ( a k , b ) = F for all a , b F , k N .
Proof. 
(1) Let x X N ( 4 ) ( a k , b ) . By Definition 12, we have t ˜ N ( a ( a k 1 ( b x ) ) ) = t ˜ N ( 1 ) , i ˜ N ( a ( a k 1 ( b x ) ) ) = i ˜ N ( 1 ) , f ˜ N ( a ( a k 1 ( b x ) ) ) = f ˜ N ( 1 ) . Since F is a filter of X and t ˜ N , i ˜ N , f ˜ N are injective, thus we can obtain a ( a k 1 ( b x ) ) = 1 and a k 1 ( b x ) F . Continuing, we can obtain b x F . Since b F , thus x F , X N ( 4 ) ( a k , b ) F .
(2) Let x F . When a = 1 , b = x , we can obtain t ˜ N ( 1 k ( x x ) ) = t ˜ N ( 1 k ( x x ) ) = t ˜ N ( 1 ) . Similarly, we have i ˜ N ( 1 k ( x x ) ) = i ˜ N ( 1 k ( x x ) ) = i ˜ N ( 1 ) , f ˜ N ( 1 k ( x x ) ) = f ˜ N ( 1 k ( x x ) ) = f ˜ N ( 1 ) . Thus, we have F X N ( 4 ) ( a k , b ) .
This means that X N ( 4 ) ( a k , b ) = F for all a , b F , k N . ☐
Theorem 8.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } be a neutrosophic hesitant fuzzy set on X.
(1) If X N ( 5 ) ( a ) is a filter of X, then N satisfies: x , y X ,
(i) t ˜ N ( a ) t ˜ N ( x y ) t ˜ N ( x ) , i ˜ N ( a ) i ˜ N ( x y ) i ˜ N ( x ) , f ˜ N ( a ) f ˜ N ( x y ) f ˜ N ( x ) t ˜ N ( a ) t ˜ N ( y ) , i ˜ N ( a ) i ˜ N ( y ) , f ˜ N ( a ) f ˜ N ( y ) ;
(ii) t ˜ N ( a ) t ˜ N ( x y ) t ˜ N ( x ) , i ˜ N ( a ) i ˜ N ( x y ) i ˜ N ( x ) , f ˜ N ( a ) f ˜ N ( x y ) f ˜ N ( x ) t ˜ N ( a ) t ˜ N ( y ) , i ˜ N ( a ) i ˜ N ( y ) , f ˜ N ( a ) f ˜ N ( y ) .
(2) If N satisfies Conditions (i), (ii) and t ˜ N ( x ) t ˜ N ( 1 ) , i ˜ N ( x ) i ˜ N ( 1 ) , f ˜ N ( x ) f ˜ N ( 1 ) for all x , y X , then X N ( 5 ) ( a ) is a filter of X.
Proof. 
(1) (i) Let x , y X with t ˜ N ( a ) t ˜ N ( x y ) t ˜ N ( x ) , i ˜ N ( a ) i ˜ N ( x y ) i ˜ N ( x ) , f ˜ N ( a ) f ˜ N ( x y ) f ˜ N ( x ) ; we have x X N ( 5 ) ( a ) , x y X N ( 5 ) ( a ) . Since X N ( 5 ) ( a ) is a filter, thus we can have y X N ( 5 ) ( a ) , t ˜ N ( a ) t ˜ N ( y ) , i ˜ N ( a ) i ˜ N ( y ) , f ˜ N ( a ) f ˜ N ( y ) .
(ii) Similarly, we know that (ii) is correct.
(2) Since t ˜ N ( x ) t ˜ N ( 1 ) , i ˜ N ( x ) i ˜ N ( 1 ) , f ˜ N ( x ) f ˜ N ( 1 ) for all x X , thus 1 X N ( 5 ) ( a ) . Let x , y X with x , x y X N ( 5 ) ( a ) ; we can obtain t ˜ N ( a ) t ˜ N ( x ) , t ˜ N ( a ) t ˜ N ( x y ) , i ˜ N ( a ) i ˜ N ( x ) , i ˜ N ( a ) i ˜ N ( x y ) , f ˜ N ( a ) f ˜ N ( x ) , f ˜ N ( a ) f ˜ N ( x y ) . By Condition (i), we have t ˜ N ( a ) t ˜ N ( y ) , i ˜ N ( a ) i ˜ N ( y ) , f ˜ N ( a ) f ˜ N ( y ) . Thus, we can obtain y X N ( 5 ) ( a ) . Similarly, let x , y X with x , x y X N ( 5 ) ( a ) , by Condition (1)(ii); we can obtain y X N ( 5 ) ( a ) .
This means that X N ( 5 ) ( a ) is a filter of X. ☐

4. Neutrosophic Hesitant Fuzzy Filters of Pseudo-BCI Algebras

In the following, let X be a pseudo-BCI algebra, unless otherwise specified.
Definition 13.
([22]) A hesitant fuzzy set A = { ( x , h A ( x ) ) | x X } is called a hesitant fuzzy pseudo-filter (briefly, hesitant fuzzy filter) of X if it satisfies:
(HFF1) h A ( x ) h A ( 1 ) , x X ;
(HFF2) h A ( x ) h A ( x y ) h A ( y ) , x , y X ;
(HFF3) h A ( x ) h A ( x y ) h A ( y ) , x , y X .
Definition 14.
A neutrosophic hesitant fuzzy set N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is called a neutrosophic hesitant fuzzy pseudo-filter (neutrosophic hesitant fuzzy filter) of X if it satisfies:
(NHFF1) t ˜ N ( x ) t ˜ N ( 1 ) , i ˜ N ( x ) i ˜ N ( 1 ) , f ˜ N ( x ) f ˜ N ( 1 ) , x X ;
(NHFF2) t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x y ) i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x y ) f ˜ N ( x ) f ˜ N ( y ) , x , y X ;
(NHFF3) t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x y ) i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x y ) f ˜ N ( x ) f ˜ N ( y ) , x , y X .
A neutrosophic hesitant fuzzy set N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } is called a neutrosophic hesitant fuzzy closed filter of X if it is a neutrosophic hesitant fuzzy filter such that:
t ˜ N ( x 1 ) t ˜ N ( x ) , i ˜ N ( x 1 ) i ˜ N ( x ) , f ˜ N ( x 1 ) f ˜ N ( x )
.
Example 5.
Let X = { a , b , c , d , 1 } with two binary operations in Table 5 and Table 6. Then, ( X ; , , 1 ) is a pseudo-BCI algebra. Let:
N = { ( 1 , [ 0 , 1 ] , [ 0 , 3 7 ] , [ 0 , 1 10 ] ) , ( a , [ 0 , 1 4 ] , [ 0 , 3 4 ] , [ 0 , 1 2 ] ) , ( b , [ 0 , 1 4 ] , [ 0 , 3 4 ] , [ 0 , 1 2 ] ) , ( c , [ 0 , 1 3 ] , [ 0 , 3 5 ] , [ 0 , 1 4 ] ) , ( d , [ 0 , 3 4 ] ) , [ 0 , 3 6 ] , [ 0 , 1 5 ] ) } .
Then, N is a neutrosophic hesitant fuzzy filter of X.
Theorem 9.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( y ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. Then, N is a neutrosophic hesitant fuzzy filter of X if and only if it satisfies the following conditions: x X , H t ˜ N , H i ˜ N , H f ˜ N are hesitant fuzzy filters of X.
Proof. Necessity:
If N is a neutrosophic hesitant fuzzy filter:
(1) Obviously, H t ˜ N is a hesitant fuzzy filter of X.
(2) By Definition 14, we have ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( 1 ) ) , 1 ( i ˜ N ( x ) i ˜ N ( x y ) ) = ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( x y ) ) ( 1 i ˜ N ( y ) ) ; similarly, by Definition 14, we have ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( x y ) ) ( 1 i ˜ N ( y ) ) . Thus, H i ˜ N is hesitant fuzzy filter of X.
(3) Similarly, we have that H f ˜ N is a hesitant fuzzy filter of X.
Sufficiency: If H t ˜ N , H i ˜ N , H f ˜ N are hesitant fuzzy filters of X. It is easy to prove that t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) satisfies Definition 14. Therefore, N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is a neutrosophic hesitant fuzzy filter of X. ☐
Theorem 10.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy set on X. Then, the following are equivalent:
(1) N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is a neutrosophic hesitant fuzzy filter of X;
(2) λ 1 , λ 2 , λ 3 P ( [ 0 , 1 ] ) , the nonempty hesitant fuzzy level sets H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) , H f ˜ N ( λ 3 ) are filters of X, where P ( [ 0 , 1 ] ) is the power set of [ 0 , 1 ] ,
H t ˜ N ( λ 1 ) = { x X | λ 1 t ˜ N ( x ) } ; H i ˜ N ( λ 2 ) = { x X | λ 2 1 i ˜ N ( x ) } ; H f ˜ N ( λ 3 ) = { x X | λ 3 1 f ˜ N ( x ) } .
Proof. 
(1)⇒(2) (i) Suppose H t ˜ N ( λ 1 ) . Let x H t ˜ N ( λ 1 ) , then λ 1 t ˜ N ( x ) . Since N is a neutrosophic hesitant fuzzy filter of X, by Definition 14, we have λ 1 t ˜ N ( x ) t ˜ N ( 1 ) . Thus, 1 H t ˜ N ( λ 1 ) .
Let x , y X with x , x y H t ˜ N ( λ 1 ) , then λ 1 t ˜ N ( x ) , λ 1 t ˜ N ( x y ) . Since N is a neutrosophic hesitant fuzzy filter of X, by Definition 14, we have λ 1 t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) . Thus y H t ˜ N ( λ 1 ) . Similarly, let x , y X with x , x y H t ˜ N ( λ 1 ) . We have y H t ˜ N ( λ 1 ) .
Thus, we can obtain that H t ˜ N ( λ 1 ) is a filter of X.
(ii) Suppose H i ˜ N ( λ 2 ) . Let x H i ˜ N ( λ 2 ) , then λ 2 1 i ˜ N ( x ) . Since N is a neutrosophic hesitant fuzzy filter of X, we have i ˜ N ( 1 ) i ˜ N ( x ) . Thus, λ 2 1 i ˜ N ( x ) 1 i ˜ N ( 1 ) , 1 H i ˜ N ( λ 2 ) .
Let x , y X with x , x y H i ˜ N ( λ 2 ) , then λ 2 1 i ˜ N ( x ) , λ 2 1 i ˜ N ( x y ) . Since N is a neutrosophic hesitant fuzzy filter of X, we have i ˜ N ( x y ) i ˜ N ( x ) i ˜ N ( y ) . Thus, 1 ( i ˜ N ( x y ) i ˜ N ( x ) ) = ( 1 i ˜ N ( x y ) ) ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) , λ 2 ( 1 i ˜ N ( y ) ) , y H i ˜ N ( λ 2 ) . Similarly, let x , y X with x , x y H i ˜ N ( λ 2 ) . We have y H i ˜ N ( λ 2 ) .
Thus, we can obtain that H i ˜ N ( λ 2 ) is a filter of X.
(iii) We have that H f ˜ N ( λ 3 ) is a filter of X. The progress of proof is similar to (ii).
(2)⇒(1) Suppose H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) , H f ˜ N ( λ 3 ) for all λ 1 , λ 2 , λ 3 P ( [ 0 , 1 ] ) .
(i’) Let x X with t ˜ N ( x ) = μ 1 . Let λ 1 = μ 1 . Since H t ˜ N ( λ 1 ) is a filter of X, we have 1 H t ˜ N ( λ 1 ) . Thus, λ 1 = μ 1 = t ˜ N ( x ) t ˜ N ( 1 ) .
Let x , y X with t ˜ N ( x ) = μ 1 , t ˜ N ( x y ) = μ 4 . Let μ 1 μ 4 = λ 1 . Since H t ˜ N ( λ 1 ) is a filter of X for all λ 1 P ( [ 0 , 1 ] ) , we have y H t ˜ N ( λ 1 ) . Thus, λ 1 = t ˜ N ( x ) t ˜ N ( x y ) t ˜ N ( y ) .
Similarly, let x , y X with t ˜ N ( x ) = μ 1 , t ˜ N ( x y ) = μ 4 . We can obtain t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) .
(ii’) Let x X with i ˜ N ( x ) = μ 2 . Let λ 2 = 1 μ 2 . Since H i ˜ N ( λ 2 ) is a filter of X for all λ 2 P ( [ 0 , 1 ] ) , we have 1 H i ˜ N ( λ 2 ) , λ 2 1 i ˜ N ( 1 ) . Thus, 1 λ 2 = μ 2 = i ˜ N ( x ) i ˜ N ( 1 ) .
Let x , y X with i ˜ N ( x ) = μ 2 , i ˜ N ( x y ) = μ 5 . Let ( 1 μ 2 ) ( 1 μ 5 ) = λ 2 . Since H i ˜ N ( λ 2 ) is a filter of X for all λ 2 P ( [ 0 , 1 ] ) , we have y H i ˜ N ( λ 2 ) , λ 2 1 i ˜ N ( y ) . Thus, λ 2 = ( 1 μ 2 ) ( 1 μ 5 ) = ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( x y ) ) = 1 ( i ˜ N ( x ) i ˜ N ( x y ) ) ( 1 i ˜ N ( y ) ) , i ˜ N ( x ) i ˜ N ( x y ) i ˜ N ( y ) .
Similarly, let x , y X with i ˜ N ( x ) = μ 2 , i ˜ N ( x y ) = μ 5 ; we have i ˜ N ( x ) i ˜ N ( x y ) i ˜ N ( y ) .
(iii’) Similarly, we can obtain f ˜ N ( x ) f ˜ N ( 1 ) , f ˜ N ( x ) f ˜ N ( x y ) f ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( x y ) f ˜ N ( y ) .
Therefore, N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is a neutrosophic hesitant fuzzy filter of X. ☐
Definition 15.
N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is a neutrosophic hesitant fuzzy set on X. Define a neutrosophic hesitant fuzzy set N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } by:
t ˜ N : X P ( [ 0 , 1 ] ) , x t ˜ N ( x ) , x H t ˜ N ( λ 1 ) φ 1 , x H t ˜ N ( λ 1 )
i ˜ N : X P ( [ 0 , 1 ] ) , x i ˜ N ( x ) , x H i ˜ N ( λ 2 ) 1 φ 2 , x H i ˜ N ( λ 2 )
f ˜ N : X P ( [ 0 , 1 ] ) , x f ˜ N ( x ) , x H f ˜ N ( λ 3 ) 1 φ 3 , x H f ˜ N ( λ 3 )
where λ 1 , λ 2 , λ 3 , φ 1 , φ 2 , φ 3 P ( [ 0 , 1 ] ) , φ 1 λ 1 , φ 2 λ 2 , φ 3 λ 3 . Then, N is called a generated neutrosophic hesitant fuzzy set by hesitant fuzzy level sets H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) and H f ˜ N ( λ 3 ) .
Theorem 11.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy filter of X. Then, N is a neutrosophic hesitant fuzzy filter of X.
Proof. 
(1) If N is a neutrosophic hesitant fuzzy filter of X, by Theorem 10, we know that H t ˜ N ( λ 1 ) , H i ˜ N ( λ 2 ) , H f ˜ N ( λ 3 ) are filters of X. Thus, 1 H t ˜ N ( λ 1 ) , 1 H i ˜ N ( λ 2 ) , 1 H f ˜ N ( λ 3 ) , t ˜ N ( 1 ) = t ˜ N ( 1 ) t ˜ N ( x ) , i ˜ N ( 1 ) = i ˜ N ( 1 ) i ˜ N ( x ) , f ˜ N ( 1 ) = f ˜ N ( 1 ) f ˜ N ( x ) , x X
(2) (i) Let x , y X with x , x y H t ˜ N ( λ 1 ) . By Theorem 9, Theorem 10 and Definition 15, we know λ 1 t ˜ N ( x y ) t ˜ N ( x ) = t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) = t ˜ N ( y ) .
Let x , y X with x , x y H i ˜ N ( λ 2 ) . By Theorem 9, Theorem 10 and Definition 15, we know λ 2 ( 1 i ˜ N ( x y ) ) ( 1 t ˜ N ( x ) ) = ( 1 i ˜ N ( x y ) ) ( 1 t ˜ N ( x ) ) = 1 ( i ˜ N ( x y ) i ˜ N ( x ) ) 1 i ˜ N ( y ) = 1 t ˜ N ( y ) . Thus, we have 1 λ 2 i ˜ N ( x y ) i ˜ N ( x ) = i ˜ N ( x y ) i ˜ N ( x ) i N ( y ) = i ˜ N ( y ) .
Similarly, let x , y X with x , x y H f ˜ N ( λ 3 ) ; we have 1 λ 3 f ˜ N ( x y ) f ˜ N ( x ) = f ˜ N ( x y ) f ˜ N ( x ) f N ( y ) = f ˜ N ( y ) .
(ii) Let x , y X with x H t ˜ N ( λ 1 ) or x y H t ˜ N ( λ 1 ) . By Definition 15, we have t ˜ N ( x ) = φ 1 or t ˜ N ( x y ) = φ 1 . Thus, we can obtain t ˜ N ( x ) t ˜ N ( x y ) = φ 1 t ˜ N ( y ) .
Let x , y X with x H i ˜ N ( λ 2 ) or x y H i ˜ N ( λ 2 ) . By Definition 15, we have i ˜ N ( x ) = 1 φ 2 or i ˜ N ( x y ) = 1 φ 2 . Since 1 λ 2 1 φ 2 ; thus, we can obtain i ˜ N ( x ) i ˜ N ( x y ) = 1 φ 2 t ˜ N ( y ) .
Similarly, let x , y X with x H f ˜ N ( λ 3 ) or x y H f ˜ N ( λ 3 ) ; we have f ˜ ( x ) f ˜ ( x y ) = 1 φ 3 f ˜ ( y ) .
(3) We can obtain t ˜ ( x ) t ˜ ( x y ) t ˜ ( y ) , i ˜ ( x ) i ˜ ( x y ) i ˜ ( y ) , f ˜ ( x ) f ˜ ( x y ) f ˜ ( y ) . The process of proof is similar to (2).
Thus N is a neutrosophic hesitant fuzzy filter of X. ☐
Theorem 12.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } be a neutrosophic hesitant fuzzy filter of X. Then, N satisfies the following properties, x , y , z X ,
(1) x y t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( y ) ;
(2) t ˜ N ( x z ) t ˜ N ( x ( y z ) ) t ˜ N ( y ) , t ˜ N ( x z ) t ˜ N ( x ( y z ) ) t ˜ N ( y ) ;
i ˜ N ( x z ) i ˜ N ( x ( y z ) ) i ˜ N ( y ) , i ˜ N ( x z ) i ˜ N ( x ( y z ) ) i ˜ N ( y ) ;
f ˜ N ( x z ) f ˜ N ( x ( y z ) ) f ˜ N ( y ) , f ˜ N ( x z ) f ˜ N ( x ( y z ) ) f ˜ N ( y ) ;
(3) t ˜ N ( ( x y ) y ) t ˜ N ( x ) , t ˜ N ( ( x y ) y ) t ˜ N ( x ) ;
i ˜ N ( ( x y ) y ) i ˜ N ( x ) , i ˜ N ( ( x y ) y ) i ˜ N ( x ) ;
f ˜ N ( ( x y ) y ) f ˜ N ( x ) , f ˜ N ( ( x y ) y ) f ˜ N ( x ) ;
(4) z x y t ˜ N ( x ) t ˜ N ( z ) t ˜ N ( y ) , i ˜ N ( x ) i ˜ N ( z ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( z ) f ˜ N ( y ) ;
z x y t ˜ N ( x ) t ˜ N ( z ) t ˜ N ( y ) , i ˜ N ( x ) i ˜ N ( z ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( z ) f ˜ N ( y ) .
Proof. 
(1) Let x , y X with x y . By Proposition 1, we know x y = 1 (or x y = 1 ). If N is a neutrosophic hesitant fuzzy filter of X, by Definition 14, we have t ˜ N ( x ) = t ˜ N ( 1 ) t ˜ N ( x ) = t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) ( t ˜ N ( x ) = t ˜ N ( 1 ) t ˜ N ( x ) = t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) ). Thus, t ˜ N ( x ) t ˜ N ( y ) .
Similarly, we have i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( y ) .
(2) By Proposition 1, Definition 14, we know, x , y , z X ,
t ˜ N ( x z ) t ˜ N ( y ( x z ) ) t ˜ N ( y ) = t ˜ N ( x ( y z ) ) t ˜ N ( y ) ,
t ˜ N ( x z ) t ˜ N ( y ( x z ) ) t ˜ N ( y ) = t ˜ N ( x ( y z ) ) t ˜ N ( y ) .
Similarly, we have, x , y , z X :
i ˜ N ( x z ) i ˜ N ( x ( y z ) ) i ˜ N ( y ) , i ˜ N ( x z ) i ˜ N ( x ( y z ) ) i ˜ N ( y ) ;
f ˜ N ( x z ) f ˜ N ( x ( y z ) ) f ˜ N ( y ) , f ˜ N ( x y ) f ˜ N ( x ( y z ) ) f ˜ N ( y ) .
(3) By Definition 1 and Definition 14, with regard to the function t ˜ N ( x ) , we can obtain, x , y X ,
t ˜ N ( ( x y ) y ) t ˜ N ( x ( ( x y ) y ) ) t ˜ N ( x ) = t ˜ N ( ( x y ) ( x y ) ) t ˜ N ( x ) = t ˜ N ( 1 ) t ˜ N ( x ) = t ˜ N ( x ) .
Similarly, we have t ˜ N ( ( x y ) y ) t ˜ N ( x ) .
With regard to the function i ˜ N ( x ) , we can obtain, x , y X ,
i ˜ N ( ( x y ) y ) i ˜ N ( x ( ( x y ) y ) ) i ˜ N ( x ) = i ˜ N ( ( x y ) ( x y ) ) i ˜ N ( x ) = i ˜ N ( 1 ) i ˜ N ( x ) = i ˜ N ( x ) .
Similarly, we have i ˜ N ( ( x y ) y ) i ˜ N ( x ) .
Similarly, with regard to the function f ˜ N ( x ) , we can obtain f ˜ N ( ( x y ) y ) f ˜ N ( x ) , f ˜ N ( ( x y ) y ) f ˜ N ( x ) .
(4) Let x , y , z X with z x y . By Remark 1 and Definition 14, we can obtain:
t ˜ N ( x ) t ˜ N ( z ) = t ˜ N ( x ) ( t ˜ N ( 1 ) t ˜ N ( z ) ) = t ˜ N ( x ) ( t ˜ N ( z ( x y ) ) t ˜ N ( z ) ) t ˜ N ( x ) t ˜ N ( x y ) , t ˜ N ( y ) . i ˜ N ( x ) i ˜ N ( z ) = i ˜ N ( x ) ( i ˜ N ( 1 ) i ˜ N ( z ) ) = i ˜ N ( x ) ( i ˜ N ( z ( x y ) ) i ˜ N ( z ) ) i ˜ N ( x ) i ˜ N ( x y ) , i ˜ N ( y ) .
Similarly, we can obtain f ˜ N ( x ) f ˜ N ( z ) f ˜ N ( y ) .
Let x , y , z X with z x y . We can obtain t ˜ N ( x ) t ˜ N ( z ) t ˜ N ( y ) , i ˜ N ( x ) i ˜ N ( z ) i ˜ N ( y ) , f ˜ N ( x ) f ˜ N ( z ) f ˜ N ( y ) . The process of the proof is similar to the above. ☐
Theorem 13.
A neutrosophic hesitant fuzzy set N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } is a neutrosophic hesitant fuzzy filter of X if and only if hesitant fuzzy sets H t ˜ N , H i ˜ N , H f ˜ N satisfy the following conditions, respectively.
(1) t ˜ N ( x ) t ˜ N ( 1 ) , t ˜ N ( x ( y z ) ) t ˜ N ( y ) t ˜ N ( x z ) , t ˜ N ( x ( y z ) ) t ˜ N ( y ) t ˜ N ( x z ) , x , y , z X ;
(2) i ˜ N ( x ) i ˜ N ( 1 ) , i ˜ N ( x ( y z ) ) i ˜ N ( y ) i ˜ N ( x z ) , i ˜ N ( x ( y z ) ) i ˜ N ( y ) i ˜ N ( x z ) , x , y , z X ;
(3) f ˜ N ( x ) f ˜ N ( 1 ) , f ˜ N ( x ( y z ) ) f ˜ N ( y ) f ˜ N ( x z ) , f ˜ N ( x ( y z ) ) f ˜ N ( y ) f ˜ N ( x z ) , x , y , z X .
Proof. Necessity:
By Theorem 9, Theorem 12 and Definition 14, (1)∼(3) holds.
Sufficiency: (1) x , y , z X , by Proposition 1, we can obtain t ˜ N ( y ) = t ˜ N ( 1 y ) t ˜ N ( 1 ( x y ) ) t ˜ N ( x ) = t ˜ N ( x y ) t ˜ N ( x ) and t ˜ N ( y ) = t ˜ N ( 1 y ) t ˜ N ( 1 ( x y ) ) t ˜ N ( x ) = t ˜ N ( x y ) t ˜ N ( x ) . We have i ˜ N ( x ) i ˜ N ( 1 ) for all x X . Thus, H t ˜ N is a hesitant fuzzy filter of X.
(2) x , y , z X , by Proposition 1, we can obtain i ˜ N ( y ) = i ˜ N ( 1 y ) i ˜ N ( 1 ( x y ) ) i ˜ N ( x ) = i ˜ N ( x y ) i ˜ N ( x ) ; thus, we have ( 1 i ˜ N ( x y ) ) ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) .
Similarly, we can have ( 1 i ˜ N ( x y ) ) ( 1 i ˜ N ( x ) ) ( 1 i ˜ N ( y ) ) .
It is easy to obtain ( 1 i ˜ N ( x ) ) ( 1 t ˜ N ( 1 ) ) for all x X . Thus, H i ˜ N is a hesitant fuzzy filter of X.
(3) We have that H f ˜ N is a hesitant fuzzy filter of X. The process of the proof is similar (2).
Therefore, H t ˜ N , H i ˜ N , H f ˜ N are hesitant fuzzy filters of X. By Theorem 9, we know that N is a neutrosophic hesitant fuzzy filter of X. ☐
Theorem 14.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } be a neutrosophic hesitant fuzzy filter of X. Then:
k = 1 n x k y = 1 t ˜ N ( y ) k = 1 n t ˜ N ( x k ) , i ˜ N ( y ) i = k n i ˜ N ( x k ) , f ˜ N ( y ) k = 1 n f ˜ N ( x k ) .
where n N ,
k = 1 n x k y = x n ( x n 1 ( ( x 1 y ) ) ) .
Proof. 
If N is a neutrosophic hesitant fuzzy filter of X:
(i) By Theorem 12, we know that t ˜ N ( x 1 ) t ˜ N ( y ) , i ˜ N ( x 1 ) i ˜ N ( y ) , f ˜ N ( x 1 ) f ˜ N ( y ) for n = 1 .
(ii) By Theorem 12, we know that t ˜ N ( x 2 ) t ˜ N ( x 1 y ) , i ˜ N ( x 2 ) i ˜ N ( x 1 y ) , f ˜ N ( x 2 ) f ˜ N ( x 1 y ) for n = 2 . By Definition 14, we have t ˜ N ( x 1 ) t ˜ N ( x 1 y ) t ˜ N ( y ) , i ˜ N ( x 1 ) i ˜ N ( x 1 y ) i ˜ N ( y ) , f ˜ N ( x 1 ) f ˜ N ( x 1 y ) f ˜ N ( y ) . Thus, t ˜ N ( x 1 ) t ˜ N ( x 2 ) t ˜ N ( y ) , i ˜ N ( x 1 ) i ˜ N ( x 2 ) i ˜ N ( y ) , f ˜ N ( x 1 ) f ˜ N ( x 2 ) f ˜ N ( y ) .
(iii) Suppose that the above formula is true for n = j ; thus, k = 1 j x k y = 1 , x j , , x 1 , y X , and we can obtain k = 1 j t ˜ N ( x k ) t ˜ N ( y ) , k = 1 j i ˜ N ( x k ) i ˜ N ( y ) , k = 1 j f ˜ N ( x k ) f ˜ N ( y ) . Therefore, suppose that k = 1 j + 1 x k y = 1 , x j + 1 , , x 1 , y X , then we have k = 2 j + 1 t ˜ N ( x k ) t ˜ N ( x 1 y ) , k = 2 j + 1 i ˜ N ( x k ) i ˜ N ( x 1 y ) , k = 2 j + 1 f ˜ N ( x k ) f ˜ N ( x 1 y ) . By Definition 14, we can obtain:
t ˜ N ( y ) t ˜ N ( x 1 ) t ˜ N ( x 1 y ) t ˜ N ( x 1 ) ( k = 2 j + 1 t ˜ N ( x k ) ) = k = 1 j + 1 t ˜ N ( x k ) ,
i ˜ N ( y ) i ˜ N ( x 1 ) i ˜ N ( x 1 y ) i ˜ N ( x 1 ) ( k = 2 j + 1 i ˜ N ( x k ) ) = k = 1 j + 1 i ˜ N ( x k ) ,
f ˜ N ( y ) f ˜ N ( x 1 ) f ˜ N ( x 1 y ) f ˜ N ( x 1 ) ( k = 2 j + 1 f ˜ N ( x k ) ) = k = 1 j + 1 f ˜ N ( x k ) ,
which complete the proof. ☐
Corollary 3.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) ) | x X ) } be a neutrosophic hesitant fuzzy filter of X. Then:
k = 1 n x k y = 1 t ˜ N ( y ) k = 1 n t ˜ N ( x k ) , i ˜ N ( y ) k = 1 n i ˜ N ( x k ) , f ˜ N ( y ) k = 1 n f ˜ N ( x k ) .
where “*” represents any binary operation “→” or “↪” on X, n N ,
k = 1 n x k y = x n ( x n 1 ( ( x 1 y ) ) ) .
Theorem 15.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } be a neutrosophic hesitant fuzzy filter of X and X be a pseudo-BCK algebra, then N is a neutrosophic hesitant fuzzy subalgebra of X.
Proof. 
If N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } is a neutrosophic hesitant fuzzy filter of X, then we can obtain x , y X ,
t ˜ N ( x y ) t ˜ N ( y ( x y ) ) t ˜ N ( y ) = t ˜ N ( x ( y y ) ) t ˜ N ( y ) = t ˜ N ( x 1 ) t ˜ N ( y ) t ˜ N ( x ) t ˜ N ( y ) . i ˜ N ( x y ) i ˜ N ( y ( x y ) ) i ˜ N ( y ) = i ˜ N ( x ( y y ) ) i ˜ N ( y ) = i ˜ N ( x 1 ) i ˜ N ( y ) i ˜ N ( x ) i ˜ N ( y ) .
f ˜ N ( x y ) f ˜ N ( y ( x y ) ) f ˜ ( y ) = f ˜ N ( x ( y y ) ) f ˜ N ( y ) = f ˜ N ( x 1 ) f ˜ N ( y ) f ˜ N ( x ) f ˜ N ( y ) .
Similarly, we can obtain t ˜ N ( x y ) t ˜ N ( x ) t ˜ N ( y ) , i ˜ N ( x y ) i ˜ N ( x ) i ˜ N ( y ) , f ˜ N ( x y ) f ˜ N ( x ) f ˜ N ( y ) . Thus, N is a neutrosophic hesitant fuzzy subalgebra of X. ☐
Theorem 16.
Let N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } be a neutrosophic hesitant fuzzy closed filter of X. Then, N is a neutrosophic hesitant fuzzy subalgebra of X.
Proof. 
The process of proof is similar to Theorem 15. ☐
If N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } is a neutrosophic hesitant fuzzy subalgebra of X, then N may not be a neutrosophic hesitant fuzzy filter of X.
Example 6.
Let X = { a , b , c , d , 1 } with two binary operations in Table 1 and Table 2. Then, ( X ; , , 1 ) is a pseudo-BCI algebra. N is a neutrosophic hesitant fuzzy subalgebra of X. However, N is not a neutrosophic hesitant fuzzy filter of X. Since t ˜ ( b a ) t ˜ ( b ) = [ 1 3 , 1 2 ] , t ˜ ( a ) = [ 1 3 , 1 4 ] , we cannot obtain t ˜ ( b a ) t ˜ ( b ) t ˜ ( a ) .
Definition 16.
N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X ) } is a neutrosophic hesitant fuzzy set on X. Define a neutrosophic hesitant fuzzy set N ( a , b ) = { ( x , t ˜ N ( a , b ) ( x ) , i ˜ N ( a , b ) ( x ) , f ˜ N ( a , b ) ( x ) ) | x X } by a , b X ,
t ˜ N ( a , b ) : X P ( [ 0 , 1 ] ) , x ψ 1 , a ( b x ) = 1 , a ( b x ) = 1 ; ψ 2 , o t h e r w i s e :
i ˜ N ( a , b ) : X P ( [ 0 , 1 ] ) , x ψ 3 , a ( b x ) = 1 , a ( b x ) = 1 ; ψ 4 , o t h e r w i s e :
f ˜ N ( a , b ) : X P ( [ 0 , 1 ] ) , x ψ 5 , a ( b x ) = 1 , a ( b x ) = 1 ; ψ 6 , o t h e r w i s e :
where ψ 1 , ψ 2 , ψ 3 , ψ 4 , ψ 5 , ψ 6 P ( [ 0 , 1 ] ) , ψ 1 ψ 2 , ψ 3 ψ 4 , ψ 5 ψ 6 . Then, N ( a , b ) is called a generated neutrosophic hesitant fuzzy set.
A generated neutrosophic hesitant fuzzy set N ( a , b ) may not be a neutrosophic hesitant fuzzy filter of X.
Example 7.
Let X = { a , b , c , d , 1 } with two binary operations in Table 1 and Table 2. Then, ( X ; , , 1 ) is a pseudo-BCI algebra. N is a neutrosophic hesitant fuzzy set of X. However, N ( a , b ) is not a neutrosophic hesitant fuzzy filter of X. Since t ˜ ( 1 , a ) ( a b ) t ˜ ( 1 , a ) ( a ) = [ 0 , 1 ] , t ˜ ( 1 , a ) ( b ) = [ 1 3 , 2 3 ] , we cannot obtain t ˜ ( 1 , a ) ( a b ) t ˜ ( 1 , a ) ( a ) t ˜ ( 1 , a ) ( b ) .
Theorem 17.
Let X be a pseudo-BCK algebra. If X is a type-2 positive implicative pseudo-BCK algebra, then N ( a , b ) is a neutrosophic hesitant fuzzy filter of X for all a , b X .
Proof. 
If X is a pseudo-BCK algebra, (1) by Definition 1 and Proposition 1, we can obtain a ( b 1 ) = 1 ( a ( b 1 ) = 1 ) . t ˜ N ( a , b ) ( 1 ) = ψ 1 t ˜ N ( a , b ) ( x ) , i ˜ N ( a , b ) ( 1 ) = ψ 3 i ˜ N ( a , b ) ( x ) , f ˜ N ( a , b ) ( 1 ) = ψ 5 f ˜ N ( a , b ) ( x ) for all x X .
(2) (i) Let x , y X with a ( b x ) 1 or a ( b x ) 1 or a ( b ( x y ) ) 1 or a ( b ( x y ) ) 1 . Thus, we can obtain:
t ˜ N ( a , b ) ( x ) t ˜ N ( a , b ) ( x y ) = ψ 2 t ˜ N ( a , b ) ( y ) t ˜ N ( a , b ) ( x ) t ˜ N ( a , b ) ( x y ) = ψ 2 t ˜ N ( a , b ) ( y ) ;
i ˜ N ( a , b ) ( x ) i ˜ N ( a , b ) ( x y ) = ψ 4 i ˜ N ( a , b ) ( y ) i ˜ N ( a , b ) ( x ) i ˜ N ( a , b ) ( x y ) = ψ 4 i ˜ N ( a , b ) ( y ) ;
f ˜ N ( a , b ) ( x ) f ˜ N ( a , b ) ( x y ) = ψ 6 f ˜ N ( a , b ) ( y ) f ˜ N ( a , b ) ( x ) f ˜ N ( a , b ) ( x y ) = ψ 6 f ˜ N ( a , b ) ( y ) .
(ii) Let x , y X with a ( b x ) = 1 , a ( b x ) = 1 and a ( b ( x y ) ) = 1 , a ( b ( x y ) ) = 1 . Then, by Proposition 1 and Definition 4, we can obtain:
t ˜ N ( a , b ) ( a ( b y ) ) = t ˜ N ( a , b ) ( 1 ( a ( b y ) ) ) = t ˜ N ( a , b ) ( ( a ( b x ) ) ( a ( b y ) ) ) = t ˜ N ( a , b ) ( a ( ( b x ) ( b y ) ) ) = t ˜ N ( a , b ) ( a ( b ( x y ) ) ) = t ˜ N ( a , b ) ( 1 ) .
t ˜ N ( a , b ) ( a ( b y ) ) = t ˜ N ( a , b ) ( 1 ( a ( b y ) ) ) = t ˜ N ( a , b ) ( ( ( a ( b x ) ) ( a ( b y ) ) ) = t ˜ N ( a , b ) ( a ( ( b x ) ( b y ) ) ) = t ˜ N ( a , b ) ( a ( b ( x y ) ) ) = t ˜ N ( a , b ) ( 1 ) .
Therefore, we can obtain,
t ˜ N ( a , b ) ( y ) = ψ 1 = t ˜ N ( a , b ) ( x ) t ˜ N ( a , b ) ( x y ) , t ˜ N ( a , b ) ( y ) = ψ 1 = t ˜ N ( a , b ) ( x ) t ˜ N ( a , b ) ( x y ) .
Similarly, we can obtain,
i ˜ N ( a , b ) ( y ) = ψ 3 = i ˜ N ( a , b ) ( x ) i ˜ N ( a , b ) ( x y ) , i ˜ N ( a , b ) ( y ) = ψ 3 = i ˜ N ( a , b ) ( x ) i ˜ N ( a , b ) ( x y ) ;
f ˜ N ( a , b ) ( y ) = ψ 5 = f ˜ N ( a , b ) ( x ) f ˜ N ( a , b ) ( x y ) , f ˜ N ( a , b ) ( y ) = ψ 5 = f ˜ N ( a , b ) ( x ) f ˜ N ( a , b ) ( x y ) .
This means that N ( a , b ) is a neutrosophic hesitant fuzzy filter of X. ☐
Example 8.
Let X = { a , b , c , d , 1 } with two binary operations in Table 7 and Table 8. Then, ( X ; , , 1 ) is a type-2 positive implicative pseudo-BCI algebra. Let N be a neutrosophic hesitant fuzzy set. We take b , c as an example; thus, we have { b , c , d , 1 } satisfy d ( c x ) = 1 , d ( c x ) = 1 . Let ψ 1 = [ 0.1 , 0.4 ] , ψ 2 = [ 0.2 , 0.3 ] , ψ 3 = [ 0.4 , 0.5 ] , ψ 4 = [ 0.3 , 0.6 ] , ψ 5 = [ 0.2 , 0.8 ] , ψ 6 = [ 0.1 , 0.9 ] ,
N ( d , c ) = { ( 1 , ψ 1 , ψ 3 , ψ 5 ) , ( a , ψ 2 , ψ 4 , ψ 6 ) , ( b , ψ 1 , ψ 3 , ψ 5 ) , ( c , ψ 1 , ψ 3 , ψ 5 ) , ( e , ψ 1 , ψ 3 , ψ 5 ) } = { ( 1 , [ 0.1 , 0.4 ] , [ 0.4 , 0.5 ] , [ 0.2 , 0.8 ] ) , ( a , [ 0.2 , 0.3 ] , [ 0.3 , 0.6 ] , [ 0.1 , 0.9 ] ) , ( b , [ 0.1 , 0.4 ] , [ 0.4 , 0.5 ] , [ 0.2 , 0.8 ] ) ( c , [ 0.1 , 0.4 ] , [ 0.4 , 0.5 ] , [ 0.2 , 0.8 ] ) , ( d , [ 0.1 , 0.4 ] , [ 0.4 , 0.5 ] , [ 0.2 , 0.8 ] ) } .
Then, we can obtain that N ( d , c ) is a neutrosophic hesitant fuzzy filter of X.
Theorem 18.
Let N = { ( x , t ˜ N ( x ) , i ˜ ( x ) , f ˜ ( x ) ) | x X } be a neutrosophic hesitant fuzzy filter of X. Then, X N ( 5 ) ( a ) = { x | t ˜ N ( a ) t ˜ N ( x ) , i ˜ N ( a ) i ˜ N ( x ) , f ˜ N ( a ) f ˜ N ( x ) } is a filter of X for all a X .
Proof. 
(1) Let x , y X with x , x y X N 5 ( a ) . Then, we have t ˜ N ( a ) t ˜ N ( x ) , t ˜ N ( a ) t ˜ N ( x y ) . Since N = { ( x , t ˜ N ( x ) , i ˜ N ( x ) , f ˜ N ( x ) ) | x X } is a neutrosophic hesitant fuzzy filter, thus we have t ˜ N ( a ) t ˜ N ( x ) t ˜ N ( x y ) t ˜ N ( y ) t ˜ N ( 1 ) . Similarly, we can get i ˜ N ( a ) i ˜ N ( x ) i ˜ ( x y ) i ˜ N ( y ) i ˜ N ( 1 ) , f ˜ N ( a ) f ˜ N ( x ) f ˜ N ( x y ) f ˜ N ( y ) f ˜ N ( 1 ) .
(2) Similarly, let x , y X with x , x y X N ( 5 ) ( a ) ; we have t ˜ N ( a ) t ˜ N ( x ) t ˜ N ( x y ) t ˜ N ( y ) t ˜ N ( 1 ) , i ˜ N ( a ) i ˜ N ( x ) i ˜ N ( x y ) i ˜ N ( y ) i ˜ N ( 1 ) , f ˜ N ( a ) f ˜ N ( x ) f ˜ N ( x y ) f ˜ N ( y ) f ˜ N ( 1 ) .
This means that X N ( 5 ) ( a ) satisfies the conditions of Definition 2 (F1), (F2) and (F3); X N ( 5 ) ( a ) is a filter of X. ☐
Example 9.
Let X = { a , b , c , d , 1 } with two binary operations in Table 5 and Table 6. Then, ( X ; , , 1 ) is a pseudo-BCI algebra. Let:
N = { ( 1 , [ 0 , 1 ] , [ 0 , 3 7 ] , [ 0 , 1 10 ] ) , ( a , [ 0 , 1 4 ] , [ 0 , 3 4 ] , [ 0 , 1 2 ] ) , ( b , [ 0 , 1 4 ] , [ 0 , 3 4 ] , [ 0 , 1 2 ] ) , ( c , [ 0 , 1 3 ] , [ 0 , 3 5 ] , [ 0 , 1 4 ] ) , ( d , [ 0 , 3 4 ] ) , [ 0 , 3 6 ] , [ 0 , 1 5 ] ) } .
Then, N is a neutrosophic hesitant fuzzy filter of X. Let X N ( 5 ) ( c ) = { c , d , 1 } . It is easy to get that X N ( 5 ) ( a ) is a filter.

5. Conclusions

In this paper, the neutrosophic hesitant fuzzy set theory was applied to pseudo-BCI algebra, and the neutrosophic hesitant fuzzy subalgebras (filters) in pseudo-BCI algebras were developed. The relationships between neutrosophic hesitant fuzzy subalgebras (filters) and hesitant fuzzy subalgebras (filters) was discussed, and some properties were demonstrated. In future work, different types of neutrosophic hesitant fuzzy filters will be defined and discussed.

Author Contributions

All authors have contributed equally to this paper.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant Nos. 61573240, 61473239).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Dudek, W.A.; Jun, Y.B. Pseudo-BCI algebras. East Asian Math. J. 2008, 24, 187–190. [Google Scholar]
  2. Jun, Y.B.; Kim, H.S.; Neggers, J. On pseudo-BCI ideals of pseudo-BCI algebras. Mat. Vesn. 2006, 58, 39–46. [Google Scholar]
  3. Ahn, S.S.; Ko, J.M. Rough fuzzy ideals in BCK/BCI-algebras. J. Comput. Anal. Appl. 2018, 25, 75–84. [Google Scholar]
  4. Huang, Y. BCI-algebra. In Science Press; Publishing House: Beijing, China, 2006. [Google Scholar]
  5. Jun, Y.B.; Sun, S.A. Hesitant fuzzy set theory applied to BCK/BCI-algebras. J. Comput. Anal. Appl. 2016, 20, 635–646. [Google Scholar]
  6. Lim, C.R.; Kim, H.S. Rough ideals in BCK/BCI-algebras. Bull. Pol. Acad. Math. 2003, 51, 59–67. [Google Scholar]
  7. Meng, J.; Jun, Y.B. BCK-Algebras; Kyungmoon Sa Co.: Seoul, Korea, 1994. [Google Scholar]
  8. Zhang, X.H. Fuzzy commutative filters and fuzzy closed filters in pseudo-BCI algebras. J. Comput. Inf. Syst. 2014, 10, 3577–3584. [Google Scholar]
  9. Zhang, X.H. On some fuzzy filters in pseudo-BCI algebras. Sci. World J. 2014, 2014. [Google Scholar] [CrossRef]
  10. Zhang, X.H.; Jun, Y.B. Anti-grouped pseudo-BCI algebras and anti-grouped filters. Fuzzy Syst. Math. 2014, 28, 21–33. [Google Scholar]
  11. Zhang, X.H.; Park, C.; Wu, S.P. Soft set theoretical approach to pseudo-BCI algebras. J. Intell. Fuzzy Syst. 2018, 34, 559–568. [Google Scholar] [CrossRef]
  12. Jun, Y.B. Characterizations of pseudo-BCK algebras. Sci. Math. Jpn. 2002, 57, 265–270. [Google Scholar]
  13. Zhang, X.H. Fuzzy Anti-grouped Filters and Fuzzy normal Filters in Pseudo-BCI Algebras. J. Intell. Fuzzy Syst. 2017, 33, 1767–1774. [Google Scholar] [CrossRef]
  14. Zhang, X.H. Fuzzy 1-type and 2-type positive implicative filters of pseudo-BCK algebras. J. Intell. Fuzzy Syst. 2015, 28, 2309–2317. [Google Scholar] [CrossRef]
  15. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef]
  16. Hajek, P. Observations on non-commutative fuzzy logic. Soft Comput. 2003, 8, 38–43. [Google Scholar] [CrossRef]
  17. Pei, D. Fuzzy logic and algebras on residuated latties. South. Asian Bull. Math. 2004, 28, 519–531. [Google Scholar]
  18. Wu, W.Z.; Mi, J.S.; Zhang, W.X. Generalized fuzzy rough sets. Inf. Sci. 2003, 152, 263–282. [Google Scholar] [CrossRef]
  19. Zadeh, L.A. Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets Syst. 1997, 90, 111–127. [Google Scholar] [CrossRef]
  20. Zhang, X.H. Fuzzy logic and algebraic analysis. In Science Press; Publishing House: Beijing, China, 2008. [Google Scholar]
  21. Zhang, X.H.; Dudek, W.A. Fuzzy BIK+- logic and non-commutative fuzzy logics. Fuzzy Syst. Math. 2009, 23, 8–20. [Google Scholar]
  22. Bo, C.X.; Zhang, X.H.; Shao, S.T.; Park, C. The lattice generated by hesitant fuzzy filters in pseudo-BCI algebras. J. Intell. Fuzzy Syst. 2018. In press. [Google Scholar]
  23. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  24. Faizi, S.; Rashid, T.; Salabun, W.; Zafar, S. Decision Making with Uncertainty Using Hesitant Fuzzy Sets. Int. J. Fuzzy Syst. 2017, 20, 1–11. [Google Scholar] [CrossRef]
  25. Torra, V.; Narukawa, Y. On hesitant fuzzy sets and decision. In Proceedings of the 18th IEEE International Conference on Fuzzy Systems, Jeju Island, Korea, 20–24 August 2009; Publishing House: Jeju Island, Korea, 2009; pp. 1378–1382. [Google Scholar]
  26. Wang, F.Q.; Li, X.; Chen, X.H. Hesitant fuzzy soft set and its applications in multicriteria decision making. J. Appl. Math. 2014, 2014. [Google Scholar] [CrossRef]
  27. Wei, G. Hesitant fuzzy prioritized operators and their application to multiple attribute decision making. Knowl. Based Syst. 2012, 31, 176–182. [Google Scholar] [CrossRef]
  28. Xia, M.; Xu, Z.S. Hesitant fuzzy information aggregation in decision making. Int. J. Approx. Reason. 2011, 52, 395–407. [Google Scholar] [CrossRef]
  29. Xu, Z.S.; Xia, M. Distance and similarity measures for hesitant fuzzy sets. Inf. Sci. 2011, 181, 2128–2138. [Google Scholar] [CrossRef]
  30. Alcantud, J.C.R.; Torra, V. Decomposition theorems and extension principles for hesitant fuzzysets. Inf. Fusion 2018, 41, 48–56. [Google Scholar] [CrossRef]
  31. Wang, Z.X.; Li, J. Correlation coefficients of probabilistic hesitant fuzzy elements and their applications to evaluation of the alternatives. Symmetry 2017, 9, 259. [Google Scholar] [CrossRef]
  32. Smarandache, F. A unifying field in logics neutrosophy: neutrosophic probability, set and logic. Mult. Valued Log. 1999, 8, 489–503. [Google Scholar]
  33. Peng, J.; Wang, J.; Wu, X. Multi-Valued neutrosophic sets and power aggregation operators with their applications in multi-criteria group decision-making problems. Int. J. Comput. Int. Syst. 2015, 8, 345–363. [Google Scholar] [CrossRef]
  34. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  35. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Interval Neutrosophic Sets and Logic: Theory and Applications in Computing. arXiv, 2005; arXiv:cs/0505014. [Google Scholar]
  36. Wang, H.; Smarandache, F.; Sunderraman, R. Single-valued neutrosophic sets. Rev. Air Force Acad. 2013, 17, 10–13. [Google Scholar]
  37. Ye, J. Multiple-attribute decision-making method under a single-valued neutrosophic hesitant fuzzy environment. J. Intell. Syst. 2014, 24, 23–36. [Google Scholar] [CrossRef]
  38. Smarandache, F.; Ali, M. Neutrosophic triplet group. Neur. Comput. Appl. 2018, 29, 595–601. [Google Scholar] [CrossRef]
  39. Zhang, X.H.; Smarandache, F.; Liang, X.L. Neutrosophic duplet semi-group and cancellable neutrosophic triplet groups. Symmetry 2017, 9, 275. [Google Scholar] [CrossRef]
  40. Zhang, X.H.; Bo, C.X.; Smarandache, F.; Dai, J.H. New inclusion relation of neutrosophic sets with applications and related lattice structure. Int. J. Mach. Learn. Cyben. 2018. [Google Scholar] [CrossRef]
Table 1. →.
Table 1. →.
abcd1
a1c111
bd1111
cdc111
dccc11
1abcd1
Table 2. ↪.
Table 2. ↪.
abcd1
a1d111
bd1111
cdd111
dcbc11
1abcd1
Table 3. →.
Table 3. →.
abcd1
a11111
bd1111
cdc111
dccc11
1abcd1
Table 4. ↪.
Table 4. ↪.
abcd1
a1d111
bd1111
cdd111
dcbc11
1abcd1
Table 5. →.
Table 5. →.
abcd1
a11111
bc1111
cab1d1
dbbc11
1abcd1
Table 6. ↪.
Table 6. ↪.
abcd1
a11111
bd1111
cbb1d1
dabc11
1abcd1
Table 7. →.
Table 7. →.
abcd1
a1bcd1
ba1111
cad1d1
dabc11
1abcd1
Table 8. ↪.
Table 8. ↪.
abcd1
a1bcd1
ba1111
cad1d1
dabc11
1abcd1

Share and Cite

MDPI and ACS Style

Shao, S.; Zhang, X.; Bo, C.; Smarandache, F. Neutrosophic Hesitant Fuzzy Subalgebras and Filters in Pseudo-BCI Algebras. Symmetry 2018, 10, 174. https://doi.org/10.3390/sym10050174

AMA Style

Shao S, Zhang X, Bo C, Smarandache F. Neutrosophic Hesitant Fuzzy Subalgebras and Filters in Pseudo-BCI Algebras. Symmetry. 2018; 10(5):174. https://doi.org/10.3390/sym10050174

Chicago/Turabian Style

Shao, Songtao, Xiaohong Zhang, Chunxin Bo, and Florentin Smarandache. 2018. "Neutrosophic Hesitant Fuzzy Subalgebras and Filters in Pseudo-BCI Algebras" Symmetry 10, no. 5: 174. https://doi.org/10.3390/sym10050174

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

Article Metrics