Vous êtes sur la page 1sur 10

Neutrosophic Sets and Systems, Vol.

20, 2018 26

University of New Mexico

Generalizations of Neutrosophic Subalgebras in BCK/BCI-Algebras


Based on Neutrosophic Points
Seon Jeong Kim1 , Seok-Zun Song2 and Young Bae Jun1
1 Department of Mathematics, Natural Science of College, Gyeongsang National University, Jinju 52828, Korea. E-mail: skim@gnu.ac.kr
2 Department of Mathematics, Jeju National University, Jeju 63243, Korea. E-mail: szsong@jejunu.ac.kr
3 Department of Mathematics Education, Gyeongsang National University, Jinju 52828, Korea. E-mail: skywine@gmail.com
∗ Correspondence: Y.B. Jun (skywine@gmail.com)

Abstract: Saeid and Jun introduced the notion of neutrosophic discussed. The concepts of (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic sub-
points, and studied neutrosophic subalgebras of several types in algebra, (q(kT ,kI ,kF ) , ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalge-
BCK/BCI-algebras by using the notion of neutrosophic points bra and (∈, q(kT ,kI ,kF ) )-neutrosophic subalgebra are introduced,
(see [4] and [6]). More general form of neutrosophic points is consid- and several properties are investigated. Characterizations of (∈,
ered in this paper, and generalizations of Saeid and Jun’s results are ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra are discussed.

Keywords: (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra; (q(kT ,kI ,kF ) , ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra; (∈, q(kT ,kI ,kF ) )-neutrosophic sub-
algebra.

1 Introduction terizations of (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra. We


consider relations between (∈, ∈)-neutrosophic subalgebra, (∈,
As a generalization of fuzzy sets, Atanassov [1] introduced the q(kT ,kI ,kF ) )-neutrosophic subalgebra and (∈, ∈ ∨q(kT ,kI ,kF ) )-
degree of nonmembership/falsehood (f) in 1986 and defined the neutrosophic subalgebra.
intuitionistic fuzzy set. As a more general platform which ex-
tends the notions of the classic set and fuzzy set, intuitionistic
fuzzy set and interval valued (intuitionistic) fuzzy set, Smaran- 2 Preliminaries
dache introduced the notion of neutrosophic sets (see [7, 8]),
which is useful mathematical tool for dealing with incomplete, By a BCI-algebra, we mean a set X with a binary operation ∗
inconsistent and indeterminate information. For further particu- and the special element 0 satisfying the conditions (see [3, 5]):
lars on neutrosophic set theory, we refer the readers to the site (a1) (∀x, y, z ∈ X)(((x ∗ y) ∗ (x ∗ z)) ∗ (z ∗ y) = 0),
http://fs.gallup.unm.edu/FlorentinSmarandache.htm (a2) (∀x, y ∈ X)((x ∗ (x ∗ y)) ∗ y = 0),
Jun [4] introduced the notion of (Φ, Ψ)-neutrosophic subalgebra (a3) (∀x ∈ X)(x ∗ x = 0),
of a BCK/BCI-algebra X for Φ, Ψ ∈ {∈, q, ∈ ∨ q}, and in-
vestigated related properties. He provided characterizations of an (a4) (∀x, y ∈ X)(x ∗ y = y ∗ x = 0 ⇒ x = y).
(∈, ∈)-neutrosophic subalgebra and an (∈, ∈ ∨ q)-neutrosophic If a BCI-algebra X satisfies the axiom
subalgebra, and considered conditions for a neutrosophic set to
(a5) 0 ∗ x = 0 for all x ∈ X,
be a (q, ∈ ∨ q)-neutrosophic subalgebra. Saeid and Jun [6] gave
relations between an (∈, ∈ ∨ q)-neutrosophic subalgebra and a then we say that X is a BCK-algebra (see [3, 5]). A nonempty
(q, ∈ ∨ q)-neutrosophic subalgebra, and investigated properties subset S of a BCK/BCI-algebra X is called a subalgebra of X
on neutrosophic q-subsets and neutrosophic ∈ ∨ q-subsets. (see [3, 5]) if x ∗ y ∈ S for all x, y ∈ S.
The purpose of this article is to give an algebraic tool of neu- The collection of all BCK-algebras and all BCI-algebras are
trosophic set theory which can be used in applied sciences, for denoted by BK (X) and BI (X), respectively. Also B(X) :=
example, decision making problems, medical sciences etc. We BK (X) ∪ BI (X).
consider a general form of neutrosophic points, and then we We refer the reader to the books [3] and [5] for further infor-
discuss generalizations of the papers [4] and [6]. As a gen- mation regarding BCK/BCI-algebras.
eralization of (∈, ∈ ∨ q)-neutrosophic subalgebras, we intro- Let X be a non-empty set. A neutrosophic set (NS) in X (see
duce the notions of (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra, [7]) is a structure of the form:
and (∈, q(kT ,kI ,kF ) )-neutrosophic subalgebra in BCK/BCI-
algebras, and investigate several properties. We discuss charac- A := {hx; AT (x), AI (x), AF (x)i | x ∈ X} (2.1)

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
Neutrosophic Sets and Systems, Vol. 20, 2018 27

where AT , AI and AF are a truth membership function, an inde- (0, 1] and γ ∈ [0, 1), we consider the following sets:
terminate membership function and a false membership function,
respectively, from X into the unit interval [0, 1]. The neutro- TqkT (A; α) := {x ∈ X | AT (x) + α + kT > 1},
sophic set (2.1) will be denoted by A = (AT , AI , AF ). IqkI (A; β) := {x ∈ X | AI (x) + β + kI > 1},
FqkF (A; γ) := {x ∈ X | AF (x) + γ + kF < 1},
Given a neutrosophic set A = (AT , AI , AF ) in a set X, α, β ∈
T∈∨ qkT (A; α) := {x ∈ X | AT (x) ≥ α or
(0, 1] and γ ∈ [0, 1), we consider the following sets (see [4]):
AT (x) + α + kT > 1},
T∈ (A; α) := {x ∈ X | AT (x) ≥ α}, I ∈∨ qkI
(A; β) := {x ∈ X | AI (x) ≥ β or
AI (x) + β + kI > 1},
I∈ (A; β) := {x ∈ X | AI (x) ≥ β},
F∈∨ qkF (A; γ) := {x ∈ X | AF (x) ≤ γ or
F∈ (A; γ) := {x ∈ X | AF (x) ≤ γ}, AF (x) + γ + kF < 1}.
Tq (A; α) := {x ∈ X | AT (x) + α > 1},
Iq (A; β) := {x ∈ X | AI (x) + β > 1}, We say TqkT (A; α), IqkI (A; β) and FqkF (A; γ) are neu-
Fq (A; γ) := {x ∈ X | AF (x) + γ < 1}, trosophic qk -subsets; and T∈∨ qkT (A; α), I∈∨ qkI (A; β) and
F∈∨ qkF (A; γ) are neutrosophic (∈ ∨ qk )-subsets. For Φ ∈ {∈,
T∈∨ q (A; α) := {x ∈ X | AT (x) ≥ α or AT (x) + α > 1},
q, qk , qkT , qkI , qkF , ∈ ∨ q, ∈ ∨ qk , ∈ ∨ qkT , ∈ ∨ qkI , ∈ ∨ qkF },
I∈∨ q (A; β) := {x ∈ X | AI (x) ≥ β or AI (x) + β > 1}, the element of TΦ (A; α) (resp., IΦ (A; β) and FΦ (A; γ)) is called
F∈∨ q (A; γ) := {x ∈ X | AF (x) ≤ γ or AF (x) + γ < 1}. a neutrosophic TΦ -point (resp., neutrosophic IΦ -point and neu-
trosophic FΦ -point) with value α (resp., β and γ).
We say T∈ (A; α), I∈ (A; β) and F∈ (A; γ) are neutrosophic It is clear that
∈-subsets; Tq (A; α), Iq (A; β) and Fq (A; γ) are neutrosophic q-
subsets; and T∈∨ q (A; α), I∈∨ q (A; β) and F∈∨ q (A; γ) are neu- T∈∨ qkT (A; α) = T∈ (A; α) ∪ TqkT (A; α), (3.1)
trosophic ∈ ∨ q-subsets. It is clear that I∈∨ qkI (A; β) = I∈ (A; β) ∪ IqkI (A; β), (3.2)

T∈∨ q (A; α) = T∈ (A; α) ∪ Tq (A; α), (2.2) F∈∨ qkF (A; γ) = F∈ (A; γ) ∪ FqkF (A; γ). (3.3)
I∈∨ q (A; β) = I∈ (A; β) ∪ Iq (A; β), (2.3)
Given a neutrosophic set A = (AT , AI , AF ) in a set X, α, β ∈
F∈∨ q (A; γ) = F∈ (A; γ) ∪ Fq (A; γ). (2.4) (0, 1] and γ ∈ [0, 1), we consider the following sets:

Given Φ, Ψ ∈ {∈, q, ∈ ∨ q}, a neutrosophic set A = (AT , AI , T∈∗ (A; α) := {x ∈ X | AT (x) > α}, (3.4)
AF ) in X ∈ B(X) is called a (Φ, Ψ)-neutrosophic subalgebra I∈∗ (A; β) := {x ∈ X | AI (x) > β}, (3.5)
of X (see [4]) if the following assertions are valid. F∈∗ (A; γ) := {x ∈ X | AF (x) < γ}. (3.6)
x ∈ TΦ (A; αx ), y ∈ TΦ (A; αy )
⇒ x ∗ y ∈ TΨ (A; αx ∧ αy ), Proposition 3.1. For any neutrosophic set A = (AT , AI , AF )
x ∈ IΦ (A; βx ), y ∈ IΦ (A; βy ) in a set X, α, β ∈ (0, 1] and γ ∈ [0, 1), we have
(2.5)
⇒ x ∗ y ∈ IΨ (A; βx ∧ βy ),
α≤ 1−k
2 ⇒ Tqk (A; α) ⊆ T∈∗ (A; α), (3.7)
x ∈ FΦ (A; γx ), y ∈ FΦ (A; γy )
⇒ x ∗ y ∈ FΨ (A; γx ∨ γy ) β≤ 1−k
2 ⇒ Iqk (A; β) ⊆ I∈∗ (A; β), (3.8)
γ≥ 1−k
2 ⇒ Fqk (A; γ) ⊆ F∈∗ (A; γ), (3.9)
for all x, y ∈ X, αx , αy , βx , βy ∈ (0, 1] and γx , γy ∈ [0, 1). 1−k
α> 2 ⇒ T∈ (A; α) ⊆ Tqk (A; α), (3.10)
1−k
β> 2 ⇒ I∈ (A; β) ⊆ Iqk (A; β), (3.11)
1−k
γ< 2 ⇒ F∈ (A; γ) ⊆ Fqk (A; γ). (3.12)

3 Generalizations of (∈, ∈ ∨q)-neutroso- Proof. If α ≤ 1−k 1+k


2 , then 1 − α ≥ 2 and α ≤ 1 − α. Assume
that x ∈ Tqk (A; α). Then AT (x) + k > 1 − α ≥ 1+k 2 , and
phic subalgebras 1+k 1−k
so AT (x) > 2 − k = 2 ≥ α. Hence x ∈ T∈ (A; α). ∗

Similarly, we have the result (3.8). Suppose that γ ≥ 1−k


2 and let
In what follows, let kT , kI and kF denote arbitrary elements of x ∈ Fqk
(A; γ). Then AF (x) + γ + k < 1, and thus
[0, 1) unless otherwise specified. If kT , kI and kF are the same
number in [0, 1), then it is denoted by k, i.e., k = kT = kI = kF . AF (x) < 1 − γ − k ≤ 1 − 1−k 1−k
2 − k = 2 ≤ γ.

Given a neutrosophic set A = (AT , AI , AF ) in a set X, α, β ∈ Hence x ∈ F∈∗ (A; γ). Suppose that α > 1−k
2 . If x ∈ T∈ (A; α),

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
28 Neutrosophic Sets and Systems, Vol. 20, 2018

then Corollary 3.5. If A = (AT , AI , AF ) is an (∈, ∈)-neutrosophic


subalgebra of X ∈ B(X), then neutrosophic qk -subsets
1−k
AT (x) + α + k ≥ 2α + k > 2 · 2 +k =1 Tqk (A; α), Iqk (A; β) and Fqk (A; γ) are subalgebras of X for
all α, β ∈ (0, 1] and γ ∈ [0, 1) whenever they are nonempty.
and so x ∈ Tqk (A; α). Hence T∈ (A; α) ⊆ Tqk (A; α). Similarly,
we can verify that if β > 1−k2 , then I∈ (A; β) ⊆ Iqk (A; β). Sup- If we take kT = kI = kF = 0 in Theorem 3.4, then we have
pose that γ < 1−k 2 . If x ∈ F ∈ (A; γ), then AF (x) ≤ γ, and the following corollary.
thus
Corollary 3.6 ([4]). If A = (AT , AI , AF ) is an (∈, ∈)-
1−k
AF (x) + γ + k ≤ 2γ + k < 2 · 2 + k = 1, neutrosophic subalgebra of X ∈ B(X), then neutrosophic q-
subsets Tq (A; α), Iq (A; β) and Fq (A; γ) are subalgebras of X
that is, x ∈ Fqk (A; γ). Hence F∈ (A; γ) ⊆ Fqk (A; γ). for all α, β ∈ (0, 1] and γ ∈ [0, 1) whenever they are nonempty.
Definition 3.2. A neutrosophic set A = (AT , AI , AF ) in X ∈ Definition 3.7. A neutrosophic set A = (AT , AI , AF ) in X ∈
B(X) is called an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra B(X) is called a (q(kT ,kI ,kF ) , ∈ ∨q(kT ,kI ,kF ) )-neutrosophic sub-
of X if algebra of X if
x ∈ T∈ (A; αx ), y ∈ T∈ (A; αy ) x ∈ TqkT (A; αx ), y ∈ TqkT (A; αy )
⇒ x ∗ y ∈ T∈∨qkT (A; αx ∧ αy ), ⇒ x ∗ y ∈ T∈∨qkT (A; αx ∧ αy ),
x ∈ I∈ (A; βx ), y ∈ I∈ (A; βy ) x ∈ IqkI (A; βx ), y ∈ IqkI (A; βy )
(3.13) (3.15)
⇒ x ∗ y ∈ I∈∨qkI (A; βx ∧ βy ), ⇒ x ∗ y ∈ I∈∨qkI (A; βx ∧ βy ),
x ∈ F∈ (A; γx ), y ∈ F∈ (A; γy ) x ∈ FqkF (A; γx ), y ∈ FqkF (A; γy )
⇒ x ∗ y ∈ F∈∨qkF (A; γx ∨ γy ) ⇒ x ∗ y ∈ F∈∨qkF (A; γx ∨ γy )
for all x, y ∈ X, αx , αy , βx , βy ∈ (0, 1] and γx , γy ∈ [0, 1). for all x, y ∈ X, αx , αy , βx , βy ∈ (0, 1] and γx , γy ∈ [0, 1).
An (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra with kT =
kI = kF = k is called an (∈, ∈ ∨qk )-neutrosophic subalgebra. A (q(kT ,kI ,kF ) , ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra with
kT = kI = kF = k is called a (qk , ∈ ∨qk )-neutrosophic subal-
Lemma 3.3 ([4]). A neutrosophic set A = (AT , AI , AF ) in gebra.
X ∈ B(X) is an (∈, ∈)-neutrosophic subalgebra of X if and
only if it satisfies: Theorem 3.8. If A = (AT , AI , AF ) is a (q(kT ,kI ,kF ) , ∈
  ∨q (kT ,kI ,kF ) )-neutrosophic subalgebra of X ∈ B(X), then neu-
AT (x ∗ y) ≥ AT (x) ∧ AT (y) trosophic qk -subsets TqkT (A; α), IqkI (A; β) and FqkF (A; γ) are
(∀x, y ∈ X)  AI (x ∗ y) ≥ AI (x) ∧ AI (y)  . (3.14) subalgebras of X for all α ∈ ( 1−k 1−kI
2 , 1], β ∈ ( 2 , 1] and
  T

1−kF
AF (x ∗ y) ≤ AF (x) ∨ AF (y) γ ∈ [0, 2 ) whenever they are nonempty.

Proof. Let x, y ∈ TqkT (A; α) for α ∈ ( 1−k


Theorem 3.4. If A = (AT , AI , AF ) is an (∈, ∈)-neutrosophic 2 , 1]. Then x ∗ y ∈
T

subalgebra of X ∈ B(X), then neutrosophic qk -subsets T∈∨ qkT (A; α), that is, x ∗ y ∈ T∈ (A; α) or x ∗ y ∈ TqkT (A; α).
If x ∗ y ∈ T∈ (A; α), then x ∗ y ∈ TqkT (A; α) by (3.10).
TqkT (A; α), IqkI (A; β) and FqkF (A; γ) are subalgebras of X
Therefore TqkT (A; α) is a subalgebra of X. Similarly, we prove
for all α, β ∈ (0, 1] and γ ∈ [0, 1) whenever they are nonempty.
that IqkI (A; β) is a subalgebra of X. Let x, y ∈ FqkF (A; γ)
Proof. Let x, y ∈ TqkT (A; α). Then AT (x) + α + kT > 1 and
AT (y) + α + kT > 1. It follows from Lemma 3.3 that for γ ∈ [0, 1−k 2 ). Then x ∗ y ∈ F∈∨ qkF (A; γ), and so
F

x∗y ∈ F∈ (A; γ) or x∗y ∈ FqkF (A; γ). If x∗y ∈ F∈ (A; γ), then
AT (x ∗ y) + α + kT ≥ (AT (x) ∧ AT (y)) + α + kT x ∗ y ∈ FqkF (A; γ) by (3.12). Hence FqkF (A; γ) is a subalgebra
of X.
= (AT (x) + α + kT ) ∧ (AT (y) + α + kT ) > 1
Taking kT = kI = kF = 0 in Theorem 3.8 induces the fol-
and so that x∗y ∈ TqkT (A; α). Hence TqkT (A; α) is a subalgebra
lowing corollary.
of X. Similarly, we can prove that IqkI (A; β) is a subalgebra of
X. Now let x, y ∈ FqkF (A; γ). Then AF (x) + γ + kF < 1 and Corollary 3.9 ([4]). If A = (AT , AI , AF ) is a (q, ∈ ∨ q)-
AF (y) + γ + kF < 1, which imply from Lemma 3.3 that neutrosophic subalgebra of X ∈ B(X), then neutrosophic q-
subsets Tq (A; α), Iq (A; β) and Fq (A; γ) are subalgebras of X
AF (x ∗ y) + γ + kF ≤ (AF (x) ∨ AF (y)) + γ + kF for all α, β ∈ (0.5, 1] and γ ∈ [0, 0, 5) whenever they are
= (AF (x) + γ + kF ) ∨ (AF (y) + γ + kF ) < 1. nonempty.

Hence x ∗ y ∈ FqkF (A; γ) and so FqkF (A; γ) is a subalgebra of We provide characterizations of an (∈, ∈ ∨q(kT ,kI ,kF ) )-neu-
X. trosophic subalgebra.

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
Neutrosophic Sets and Systems, Vol. 20, 2018 29

Theorem 3.10. Given a neutrosophic set A = (AT , AI , AF ) in that is, a ∗ b ∈ / FqkF (A; γF ). Thus a ∗ b ∈ / F∈∨ qkF (A; γF ),
X ∈ B(X), the following are equivalent. which is a contradiction. If AF (a) ∨ AF (b) < 1−k2 , then a, b ∈
F

1−kF 1−kF
(1) A = (AT , AI , AF ) is an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic F∈ (A; 2 ) and a ∗ b ∈ / F∈ (A; 2 ). Also,
subalgebra of X.
AF (a ∗ b) + 1−k2
F
> 1−k
2
F
+ 1−k
2
F
= 1 − kF
(2) A = (AT , AI , AF ) satisfies the following assertion.
and so a∗b ∈/ FqkF (A; 1−k 2 ). Hence a∗b ∈
F
/ F∈∨ qkF (A; 1−k
2 ),
F

AT (x ∗ y) ≥ {AT (x), AT (y), 1−k


V
2 }
T
a contradiction. Therefore
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k
V
2 }
I
(3.16) _
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k 2 }
F
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k
W
2
F
}

for all x, y ∈ X. for all x, y ∈ X.


Conversely, let A = (AT , AI , AF ) be a neutrosophic set in X
Proof. Let A = (AT , AI , AF ) be an (∈, ∈ ∨q(kT ,kI ,kF ) )- which satisfies the condition (3.16). Let x, y ∈ X and β , β ∈
x y
neutrosophic subalgebra of X. Assume that there exist a, b ∈ X (0, 1] be such that x ∈ I (A; β ) and y ∈ I (A; β ). Then
∈ x ∈ y
such that
^ ^
^
1−kT AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2
I
} ≥ {βx , βy , 1−k2 }.
I
AT (a ∗ b) < {AT (a), AT (b), 2 }.

1−kT Suppose that βx ≤ 1−k 2


I
or βy ≤ 1−k
2 . Then AI (x ∗ y) ≥
I
If AT (a) ∧ AT (b) < , then AT (a ∗ b) < AT (a) ∧ AT (b).
2 βx ∧ βy , and so x ∗ y ∈ I∈ (A; βx ∧ βy ). Now, assume that
Hence
βx > 1−k
2
I
and βy > 1−k
2 . Then AI (x ∗ y) ≥
I 1−kI
2 , and so
AT (a ∗ b) < αt ≤ AT (a) ∧ AT (b) 1−kI 1−kI
AI (x ∗ y) + βx ∧ βy > 2 + 2 = 1 − kI ,
for some αt ∈ (0, 1]. It follows that a ∈ T∈ (A; αt ) and b ∈
T∈ (A; αt ) but a ∗ b ∈
/ T∈ (A; αt ). Moreover, that is, x ∗ y ∈ IqkI (A; βx ∧ βy ). Hence

AT (a ∗ b) + αt < 2αt < 1 − kT , x ∗ y ∈ I∈∨ qkI (A; βx ∧ βy ).

and so a ∗ b ∈/ TqkT (A; αt ). Thus a ∗ b ∈/ T∈∨ qkT (A; αt ), a con- Similarly, we can verify that if x ∈ T∈ (A; αx ) and y ∈
T∈ (A; αy ), then x ∗ y ∈ T∈∨ qkT (A; αx ∧ αy ). Finally, let
tradiction. If AT (a) ∧ AT (b) ≥ 1−k T
, then a ∈ T∈ (A; 1−k 2 ),
T

1−kT
2
1−kT
x, y ∈ X and γx , γy ∈ [0, 1) be such that x ∈ F∈ (A; γx ) and
b ∈ T∈ (A; 2 ) and a ∗ b ∈ / T∈ (A; 2 ). Also, y ∈ F∈ (A; γy ). Then
1−kT 1−kT 1−kT
AT (a ∗ b) + < + = 1 − kT , _
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k
_
{γx , γy , 1−k
2 }≤ 2 }.
2 2 2 F F

/ TqkT (A; 1−k


i.e., a ∗ b ∈ / T∈∨ qkT (A; 1−k
2 ). Hence a ∗ b ∈
T
2 ), a
T
If γx ≥ 1−k
2
F
or γy ≥ 1−k
2 , then AF (x ∗ y) ≤ γx ∨ γy and thus
F
contradiction. Consequently,
x ∗ y ∈ F∈ (A; γx ∨ γy ). If γx < 1−k
2
F
and γy < 1−k2 , then
F
^ 1−kF
AT (x ∗ y) ≥ {AT (x), AT (y), 1−k AF (x ∗ y) ≤ 2 . Hence
2 }
T

1−kF 1−kF
for all x, y ∈ X. Similarly, we know that AF (x ∗ y) + γx ∨ γy < 2 + 2 = 1 − kF ,

that is, x ∗ y ∈ FqkF (A; γx ∨ γy ). Thus


^
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k
2 }
I

x ∗ y ∈ F∈∨ qkF (A; γx ∨ γy ).


for all x, y ∈ X. Suppose that there exist a, b ∈ X such that
_ Therefore A = (AT , AI , AF ) is an (∈, ∈ ∨ qkF )-neutrosophic
AF (a ∗ b) > {AF (a), AF (b), 1−k 2 }.
F
subalgebra of X.

Then AF (a ∗ b) > γF ≥ {AF (a), AF (b), 1−k


W
2 } for some Corollary 3.11 ([4]). A neutrosophic set A = (AT , AI , AF ) in
F

1−kF
γF ∈ [0, 1). If AF (a) ∨ AF (b) ≥ 2 , then X ∈ B(X) is an (∈, ∈ ∨ q)-neutrosophic subalgebra of X if and
only if it satisfies:
AF (a ∗ b) > γF ≥ AF (a) ∨ AF (b)  
V
AT (x ∗ y) ≥ {AT (x), AT (y), 0.5}
which implies that a, b ∈ F∈ (A; γF ) and a ∗ b ∈/ F∈ (A; γF ). V
(∀x, y ∈ X)  AI (x ∗ y) ≥ {AI (x), AI (y).0.5}  .
 
Also, W
A (a ∗ b) + γ > 2γ ≥ 1 − k , AF (x ∗ y) ≤ {AF (x), AF (y), 0.5}
F F F F

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
30 Neutrosophic Sets and Systems, Vol. 20, 2018

Proof. It follows from taking kT = kI = kF = 0 in Theorem AF (a ∗ b) ≤ γF which is a contradiction. Thus


3.10. _
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k2 }
F

Theorem 3.12. Let A = (AT , AI , AF ) be a neutrosophic set in


X ∈ B(X). Then A = (AT , AI , AF ) is an (∈, ∈ ∨q(kT ,kI ,kF ) )- for all x, y ∈ X. Therefore A = (AT , AI , AF ) is an (∈, ∈
neutrosophic subalgebra of X if and only if neutrosophic ∈- ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X by Theorem 3.10.
subsets T∈ (A; α), I∈ (A; β) and F∈ (A; γ) are subalgebras of X
for all α ∈ (0, 1−k 1−kI 1−kF
2 ], β ∈ (0, 2 ] and γ ∈ [ 2 , 1) when- Corollary 3.13. Let A = (A , A , A ) be a neutrosophic set
T

T I F
ever they are nonempty.
in X ∈ B(X). Then A = (AT , AI , AF ) is an (∈, ∈ ∨ q)-
neutrosophic subalgebra of X if and only if neutrosophic ∈-
Proof. Assume that A = (AT , AI , AF ) is an (∈, ∈
1−kI subsets T∈ (A; α), I∈ (A; β) and F∈ (A; γ) are subalgebras of
∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X. Let β ∈ (0, 2 ]
X for all α, β ∈ (0, 0.5] and γ ∈ [0.5, 1) whenever they are
and x, y ∈ I∈ (A; β). Then AI (x) ≥ β and AI (y) ≥ β. It
nonempty.
follows from Theorem 3.10 that
^ Proof. It follows from taking kT = kI = kF = 0 in Theorem
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2 }≥β∧
I 1−kI

2 3.12.
and so that x ∗ y ∈ I∈ (A; β). Hence I∈ (A; β) is a subalgebra Theorem 3.14. Every (∈, ∈)-neutrosophic subalgebra is an (∈,
of X for all β ∈ (0, 1−k
2 ]. Similarly, we know that T∈ (A; α)
I
∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra.
is a subalgebra of X for all α ∈ (0, 1−k 1−kF
2 ]. Let γ ∈ [ 2 , 1)
T

and x, y ∈ F∈ (A; γ). Then AF (x) ≤ γ and AF (y) ≤ γ. Using Proof. Straightforward.
Theorem 3.10 implies that The converse of Theorem 3.14 is not true as seen in the fol-
_ lowing example.
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k 2 }≤γ∨
F 1−kF
2 = γ.
Example 3.15. Consider a BCI-algebra X = {0, a, b, c} with
Hence x ∗ y ∈ F∈ (A; γ), and therefore F∈ (A; γ) is a subalgebra the binary operation ∗ which is given in Table 1 (see [5]).
of X for all γ ∈ [ 1−k
2 , 1).
F

Conversely, suppose that the nonempty neutrosophic ∈-subsets


T∈ (A; α), I∈ (A; β) and F∈ (A; γ) are subalgebras of X for all Table 1: Cayley table for the binary operation “∗”
1−kT 1−kI 1−kF
α ∈ (0, 2 ], β ∈ (0, 2 ] and γ ∈ [ 2 , 1). If there exist
a, b ∈ X such that ∗ 0 a b c
^ 0 0 a b c
AT (a ∗ b) < {AT (a), AT (b), 1−k 2 },
T
a a 0 c b
b b c 0 a
then a, b ∈ T∈ (A; αT ) by taking c c b a 0
^
αT := {AT (a), AT (b), 1−k 2 }.
T

Let A = (AT , AI , AF ) be a neutrosophic set in X ∈ BI (X)


Since T∈ (A; αT ) is a subalgebra of X, it follows that a ∗ b ∈
defined by Table 2
T∈ (A; αT ), that is, AT (a ∗ b) ≥ αT . This is a contradiction, and
hence
^ Table 2: Tabular representation of “A = (AT , AI , AF )”
AT (x ∗ y) ≥ {AT (x), AT (y), 1−k 2 }
T

for all x, y ∈ X. Similarly, we can verify that X AT (x) AI (x) AF (x)


^ 0 0.6 0.5 0.2
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2 }
I
a 0.7 0.3 0.6
b 0.3 0.6 0.6
for all x, y ∈ X. Now, assume that there exist a, b ∈ X such that c 0.3 0.3 0.4
_
AF (a ∗ b) > {AF (a), AF (b), 1−k 2 }.
F

If kT = 0.36, then
Then AF (a ∗ b) > γF ≥ {AF (a), AF (b), 1−k
W
2 } for some
F

1−kF
γF ∈ [ 2 , 1). Hence a, b ∈ F∈ (A; γF ), and so a ∗ b ∈ X if α ∈ (0, 0.3],
T∈ (A; α) =
F∈ (A; γF ) since F∈ (A; γF ) is a subalgebra of X. It follows that {0, a} if α ∈ (0.3, 0.32].

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
Neutrosophic Sets and Systems, Vol. 20, 2018 31

If kI = 0.32, then and



 {0} if β ∈ [0.38, 0.4),

X if β ∈ (0, 0.3],
I∈ (A; β) = F∈ (A; γ) = {0, c} if β ∈ [0.4, 0.6),
{0, b} if β ∈ (0.3, 0.34].
X if β ∈ [0.6, 1).

If kF = 0.36, then
 Since X, {0}, {0, a}, {0, b} and {0, c} are subalgebras of X,
 {0} if γ ∈ [0.32, 0.4), we know from Theorem 3.12 that A = (AT , AI , AF ) is an (∈,
F∈ (A; γ) = {0, c} if γ ∈ [0.4, 0.6), ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X for kT = 0.2,
X if γ ∈ [0.6, 1].

kI = 0.3 and kF = 0.24. Note that
We know that T∈ (A; α), I∈ (A; β) and F∈ (A; γ) are subalgebras a∗b∈ / Tq0.2 (A; 0.25 ∧ 0.4)
of X for all α ∈ (0, 0.32], β ∈ (0, 0.34] and γ ∈ [0.32, 1). It
follows from Theorem 3.12 that A = (AT , AI , AF ) is an (∈, for a ∈ T∈ (A; 0.4) and b ∈ T∈ (A; 0.25),
∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X for kT = 0.36,
kI = 0.32 and kF = 0.36. Since b∗c∈ / Iq0.3 (A; 0.5 ∧ 0.27)

AT (0) = 0.6 < 0.7 = AT (a) ∧ AT (a) for b ∈ I∈ (A; 0.5) and c ∈ I∈ (A; 0.27), and/or

and/or a∗c∈
/ Fq0.24 (A; 0.6 ∨ 0.44)
AI (0) = 0.5 > 0.3 = AI (c) ∨ AI (c),
for a ∈ F∈ (A; 0.6) and c ∈ F∈ (A; 0.44). Hence A = (AT , AI ,
we know that A = (AT , AI , AF ) is not an (∈, ∈)-neutrosophic AF ) is not an (∈, q(0.2,0.3,0.24) )-neutrosophic subalgebra of X.
subalgebra of X by Lemma 3.3.
Theorem 3.19. If 0 ≤ kT < jT < 1, 0 ≤ kI < jI < 1 and
Definition 3.16. A neutrosophic set A = (AT , AI , AF ) in X ∈
0 ≤ jF < kF < 1, then every (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic
B(X) is called an (∈, q(kT ,kI ,kF ) )-neutrosophic subalgebra of
subalgebra is an (∈, ∈ ∨q(jT ,jI ,jF ) )-neutrosophic subalgebra.
X if
x ∈ T∈ (A; αx ), y ∈ T∈ (A; αy ) Proof. Straightforward.
⇒ x ∗ y ∈ TqkT (A; αx ∧ αy ),
x ∈ I∈ (A; βx ), y ∈ I∈ (A; βy ) The following example shows that if 0 ≤ kT < jT < 1,
(3.17)
⇒ x ∗ y ∈ IqkI (A; βx ∧ βy ), 0 ≤ kI < jI < 1 and 0 ≤ jF < kF < 1, then an
x ∈ F∈ (A; γx ), y ∈ F∈ (A; γy ) (∈, ∈ ∨q(jT ,jI ,jF ) )-neutrosophic subalgebra may not be an (∈,
⇒ x ∗ y ∈ FqkF (A; γx ∨ γy ) ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra.

for all x, y ∈ X, αx , αy , βx , βy ∈ (0, 1] and γx , γy ∈ [0, 1).


Example 3.20. Let X be the BCI-algebra given in Example
3.15 and let A = (AT , AI , AF ) be a neutrosophic set in X
An (∈, q(kT ,kI ,kF ) )-neutrosophic subalgebra with kT = kI =
defined by Table 3
kF = k is called an (∈, qk )-neutrosophic subalgebra.
Theorem 3.17. Every (∈, q(kT ,kI ,kF ) )-neutrosophic subalgebra
is an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra. Table 3: Tabular representation of “A = (AT , AI , AF )”

Proof. Straightforward.
X AT (x) AI (x) AF (x)
The converse of Theorem 3.17 is not true as seen in the fol- 0 0.42 0.40 0.44
lowing example. a 0.40 0.44 0.66
Example 3.18. Consider the BCI-algebra X = {0, a, b, c} and b 0.48 0.36 0.66
the neutrosophic set A = (AT , AI , AF ) which are given in Ex- c 0.40 0.36 0.33
ample 3.15. Taking kT = 0.2, kI = 0.3 and kF = 0.24 imply
that
 If kT = 0.04, then
X if α ∈ (0, 0.3],
T∈ (A; α) =
{0, a} if α ∈ (0.3, 0.4],

 X if α ∈ (0, 0.40],
T∈ (A; α) = {0, b} if α ∈ (0.40, 0.42],
{b} if α ∈ (0.42, 0.48].
 
X if β ∈ (0, 0.3],
I∈ (A; β) =
{0, b} if β ∈ (0.3, 0.35], Note that T∈ (A; α) is not a subalgebra of X for α ∈ (0.42, 0.48].

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
32 Neutrosophic Sets and Systems, Vol. 20, 2018

If kI = 0.08, then subalgebra of X if and only if the neutrosophic set AS =


 (AST , ASI , ASF ) is an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic sub-

 X if β ∈ (0, 0.36], algebra of X.
{0, a} if β ∈ (0.36, 0.40],

I∈ (A; β) =

 {a} if β ∈ (0.40, 0.44], Proof. Let S be a subalgebra of X. Then neutrosophic ∈-
∅ if β ∈ (0.44, 0.46]. subsets T∈ (AST ; α), I∈ (AST ; β) and F∈ (AST ; γ) are obviously

subalgebras of X for all α ∈ (0, 1−k 1−kI
2 ], β ∈ (0, 2 ] and
T

Note that I∈ (A; β) is not a subalgebra of X for β ∈ (0.40, 0.44]. γ ∈ [ 1−kF , 1). Hence A = (A , A , A ) is an (∈,
2 S ST SI SF
If kF = 0.42, then ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X by Theorem 3.12.

∅ if γ ∈ [0.29, 0.33), Conversely, assume that AS = (AST , ASI , ASF ) is an (∈,
∈ ∨q (kT ,kI ,kF ) )-neutrosophic subalgebra of X. Let x, y ∈ S.


{c} if γ ∈ [0.33, 0.44),

F∈ (A; γ) = Then

 {0, c} if γ ∈ [0.44, 0.66),
X if γ ∈ [0.66, 1).
 ^
AST (x ∗ y) ≥ {AST (x), AST (y), 1−k 2 }
T

Note that F∈ (A; γ) is not a subalgebra of X for γ ∈ [0.33, 0.44). =1∧ 1−kT
= 1−kT
,
2 2
Therefore A = (AT , AI , AF ) is not an (∈, ∈ ∨q(kT ,kI ,kF ) )-
neutrosophic subalgebra of X for kT = 0.04, kI = 0.08 and ^
kF = 0.42. ASI (x ∗ y) ≥ {ASI (x), ASI (y), 1−k
2 }
I

If jT = 0.16, then 1−kI 1−kI


=1∧ 2 = 2

X if α ∈ (0, 0.40],
T∈ (A; α) = and
{0, b} if α ∈ (0.40, 0.42].
_
If jI = 0.20, then ASF (x ∗ y) ≤ {ASF (x), ASF (y), 1−k
2 }
F

1−kF 1−kF
 =0∨ 2 = 2 ,
X if β ∈ (0, 0.36],
I∈ (A; β) =
{0, a} if β ∈ (0.36, 0.40]. which imply that
If jF = 0.12, then AST (x ∗ y) = 1, ASI (x ∗ y) = 1 and ASF (x ∗ y) = 0.

{0, c} if γ ∈ [0.44, 0.66), Hence x ∗ y ∈ S, and so S is a subalgebra of X.
F∈ (A; γ) =
X if γ ∈ [0.66, 1).
Theorem 3.22. Let S be a subalgebra of X ∈ B(X). For every
Therefore A = (AT , AI , AF ) is an (∈, ∈ ∨q(jT ,jI ,jF ) )-
α ∈ (0, 1−k 1−kI 1−kF
2 ], β ∈ (0, 2 ] and γ ∈ [ 2 , 1), there ex-
T
neutrosophic subalgebra of X for jT = 0.16, jI = 0.20 and
ists an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra A = (AT ,
jF = 0.12.
AI , AF ) of X such that T∈ (A; α) = S, I∈ (A; β) = S and
Given a subset S of X, consider a neutrosophic set AS = F∈ (A; γ) = S.
(AST , ASI , ASF ) in X defined by
Proof. Let A = (AT , AI , AF ) be a neutrosophic set in X de-

(1, 1, 0) if x ∈ S, fined by
AS (x) :=
(0, 0, 1) otherwise, 
(α, β, γ) if x ∈ S,
A(x) :=
that is, (0, 0, 1) otherwise,

that is,

1 if x ∈ S,
AST (x) :=
0 otherwise, 
α if x ∈ S,
AT (x) :=
0 otherwise,

1 if x ∈ S,
ASI (x) :=
0 otherwise, 
β if x ∈ S,
AI (x) :=
and 0 otherwise,

0 if x ∈ S, and
ASF (x) :=
1 otherwise. 
γ if x ∈ S,
AF (x) :=
Theorem 3.21. A nonempty subset S of X ∈ B(X) is a 1 otherwise.

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
Neutrosophic Sets and Systems, Vol. 20, 2018 33

1−kI
Obviously, T∈ (A; α) = S, I∈ (A; β) = S and F∈ (A; γ) = S. Case 1. AI (x) ≥ β and AI (y) ≥ β. If β > 2 , then
Suppose that ^
^ AI (x ∗ y) ≥ {AI (x), AI (y), 1−k
2 }=
I 1−kI
2 ,
AT (a ∗ b) < {AT (a), AT (b), 1−k
2 }
T

and so AI (x ∗ y) + β > 1−k 2


I
+ 1−k
2
I
= 1 − kI . Hence x ∗ y ∈
for some a, b ∈ X. Since #Im(A T ) = 2, it follows that I (A; β). If β ≤ 1−kI
, then
q 2
{AT (a), AT (b), 1−k
V kI
2 } = α and AT (a ∗ b) = 0. Hence
T

AT (a) = α = AT (b), and so a, b ∈ S. Since S is a subalgebra ^


AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2 } ≥ β,
I
of X, we have a ∗ b ∈ S. Thus AT (a ∗ b) = α, a contradiction.
Therefore
and thus x ∗ y ∈ I∈ (A; β). Hence
^
1−kT
AT (x ∗ y) ≥ {AT (x), AT (y), 2 }
x ∗ y ∈ I∈ (A; β) ∪ IqkI (A; β) = I∈∨ qkI (A; β).
for all x, y ∈ X. Similarly, we can verify that
^ 1−kI
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k Case 2. AI (x) ≥ β and AI (y) + β + kI > 1. If β > 2 ,
2 }
I

then
for all x, y ∈ X. Assume that there exist a, b ∈ X such that ^
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k
2 }
I
_
AF (a ∗ b) > {AF (a), AF (b), 1−k 2 }.
F
= AI (y) ∧ 1−k I
> (1 − β − kI ) ∧ 1−kI
2 2
= 1 − β − kI ,
Then AF (a ∗ b) = 1 and {AF (a), AF (b), 1−k
W
2 } = γ since
F

#Im(AF ) = 2. It follows that AF (a) = γ = AF (b) and so that and so x ∗ y ∈ I (A; β). If β ≤ 1−kI , then
qkI 2
a, b ∈ S. Hence a ∗ b ∈ S, and so AF (a ∗ b) = γ, which is a
contradiction. Thus ^
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k
2 }
I
_
1−kF
AF (x ∗ y) ≤ {AF (x), AF (y), 2 }
^
≥ {β, 1 − β − k , 1−kI } = β,
I 2

for all x, y ∈ X. Therefore A = (AT , AI , AF ) is an (∈, ∈ and thus x ∗ y ∈ I (A; β). Therefore x ∗ y ∈ I
∈ ∈∨ qkI (A; β).
∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X by Theorem 3.10.
Case 3. AI (x) + β + kI > 1 and AI (y) ≥ β. We have
Corollary 3.23. Let S be a subalgebra of X ∈ B(X). For every x ∗ y ∈ I∈∨ qkI (A; β) by the similar way to the Case 2.
α ∈ (0, 0.5], β ∈ (0, 0.5] and γ ∈ [0.5, 1), there exists an (∈,
∈ ∨q)-neutrosophic subalgebra A = (AT , AI , AF ) of X such Case 4. AI (x) + β + kI > 1 and AI (y) + β + kI > 1. If
that T∈ (A; α) = S, I∈ (A; β) = S and F∈ (A; γ) = S. β > 1−k
2 , then 1 − β − kI <
I 1−kI
2 , and so

Proof. It follows from taking kT = kI = kF = 0 in Theorem ^


AI (x ∗ y) ≥ {AI (x), AI (y), 1−k
2 } > 1 − β − kI ,
I
3.22.

Theorem 3.24. Given a neutrosophic set A = (AT , AI , AF ) in i.e., x ∗ y ∈ IqkI (A; β). If β ≤ 1−k
2 , then
I

X ∈ B(X), the following are equivalent. ^


AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2 }
I
(1) A = (AT , AI , AF ) is an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic
subalgebra of X. ≥ (1 − β − kI ) ∧ 1−k
2
I

(2) The neutrosophic (∈ ∨ qk )-subsets T∈∨ qkT (A; α), = 1−k2


I
≥ β,
I∈∨ qkI (A; β) and F∈∨ qkF (A; γ) are subalgebras of X for
i.e., x ∗ y ∈ I∈ (A; β). Hence x ∗ y ∈ I∈∨ qkI (A; β). Con-
all α, β ∈ (0, 1] and γ ∈ [0, 1).
sequently, I∈∨ qkI (A; β) is a subalgebra of X. Similarly, we
Proof. Assume that A = (AT , AI , AF ) is an (∈, ∈ can prove that if x, y ∈ T∈∨ qkT (A; α) for α ∈ (0, 1], then
∨q(kT ,kI ,kF ) )-neutrosophic subalgebra of X. Let x, y ∈ x ∗ y ∈ T∈∨ qkT (A; α), that is, T∈∨ qkT (A; α) is a subalgebra
I∈∨ qkI (A; β) for β ∈ (0, 1]. Then AI (x) ≥ β or AI (x) + β + of X. Let x, y ∈ F∈∨ qkF (A; γ) for γ ∈ [0, 1). Then AF (x) ≤ γ
kI > 1, and AI (y) ≥ β or AI (y) + β + kI > 1. Using Theorem or AF (x)+γ +kF < 1, and AF (y) ≤ γ or AF (y)+γ +kF < 1.
3.10, we have Using Theorem 3.10, we have
^ _
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2 }.
I
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k 2 }.
F

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
34 Neutrosophic Sets and Systems, Vol. 20, 2018

1−kF
Case 1. AF (x) ≤ γ and AF (y) ≤ γ. If γ < 2 , then or AT (x ∗ y) + α + kT > 1, a contradiction. Hence
^
AT (x ∗ y) ≥ {AT (x), AT (y), 1−k
_
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k
2 }=
F 1−kF
2 , 2 }
T

and so AF (x ∗ y) + γ < 1−kF


2 + 1−k2
F
= 1 − kF . Hence for all x, y ∈ X. Similarly, we can verify that
1−kF
x ∗ y ∈ FqkF (A; γ). If γ ≥ 2 , then ^
AI (x ∗ y) ≥ {AI (x), AI (y), 1−k 2 }
I

_
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k
2 } ≤ γ,
F
for all x, y ∈ X. Now assume that there exist a, b ∈ X and
γ ∈ ( 1−k
2 , 1) such that
F

and thus x ∗ y ∈ F∈ (A; γ). Hence


_
x ∗ y ∈ F∈ (A; γ) ∪ FqkF (A; γ) = F∈∨ qkF (A; γ). AF (a ∗ b) > γ ≥ {AF (a), AF (b), 1−k
2 }.
F

Then a, b ∈ F∈ (A; γ) ⊆ F∈∨ qkF (A; γ), which implies that


1−kF
Case 2. AF (x) ≤ γ and AF (y) + γ + kF < 1. If γ < 2 ,
then a ∗ b ∈ F∈∨ qkF (A; γ).
_
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k Thus AF (a ∗ b) ≤ γ or AF (a ∗ b) + γ + kF < 1, which is a
2 }
F

contradiction. Hence
= AF (y) ∨ 1−k
2
F
< (1 − γ − kF ) ∨ 1−kF
2 _
= 1 − γ − kF , AF (x ∗ y) ≥ {AF (x), AF (y), 1−k
2 }
F

1−kF for all x, y ∈ X. Using Theorem 3.10, we conclude that A =


and so x ∗ y ∈ FqkF (A; γ). If γ ≥ 2 , then
(AT , AI , AF ) is an (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra
of X.
_
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k2 }
F

_
≤ {γ, 1 − γ − kF , 1−k
2 } = γ,
F

and thus x ∗ y ∈ F∈ (A; γ). Therefore x ∗ y ∈ F∈∨ qkF (A; γ).


4 Conclusions
Similarly, if AI (x) + β + kI < 1 and AI (y) ≤ β, then x ∗ y ∈ Neutrosophic set theory is a nice mathematical tool which can
F∈∨ qkF (A; γ). be applied to several fields. The aim of this paper is to consider
a general form of neutrosophic points, and to discuss general-
Finally, assume that AF (x) + γ + kF < 1 and AF (y) + γ +
1−kF 1−kF izations of the papers [4] and [6]. We have introduce the no-
kF < 1. If γ < 2 , then 1 − γ − kF > 2 , and so
tions of (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra, and (∈,
_
1−kF q(kT ,kI ,kF ) )-neutrosophic subalgebra in BCK/BCI-algebras,
AF (x ∗ y) ≤ {AF (x), AF (y), 2 } < 1 − γ − kF , and have investigated several properties. We have discussed
characterizations of (∈, ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalge-
i.e., x ∗ y ∈ FqkF (A; γ). If γ ≥ 1−k
2
F
, then bra. We have considered relations between (∈, ∈)-neutrosophic
_ subalgebra, (∈, q(kT ,kI ,kF ) )-neutrosophic subalgebra and (∈,
AF (x ∗ y) ≤ {AF (x), AF (y), 1−k 2
F
} ∈ ∨q(kT ,kI ,kF ) )-neutrosophic subalgebra. We hope the idea and
result in this paper can be a mathematical tool for dealing with
≤ (1 − γ − kF ) ∨ 1−k 2
F
several informations containing uncertainty such as medical diag-
= 1−k2
F
≤ γ, nosis, decision making, graph theory, etc. So, based on the results
in this article, our future research will be focused to solve real-life
i.e., x ∗ y ∈ F∈ (A; γ). Hence x ∗ y ∈ F∈∨ qkF (A; γ). Therefore problems under the opinions of experts in a neutrosophic set envi-
F∈∨ qkF (A; γ) is a subalgebra of X. ronment such as medical diagnosis, decision making, graph the-
Conversely, suppose that (2) is valid. If it is possible, let ory etc. In particular, Bucolo et al. [2] suggested a generalization
of the synchronization principles for the class of array of fuzzy
^
AT (x ∗ y) < α ≤ {AT (x), AT (y), 2 } 1−kT logic chaotic based dynamical systems and evaluated as alterna-
tive approach to build locally connected fuzzy complex systems
1−kT
for some α ∈ (0, 2 ). Then by manipulating both the rules driving the cells and the architec-
ture of the system. We will also try to study complex dynamics
x, y ∈ T∈ (A; α) ⊆ T∈∨ qkT (A; α), through neutrosophic environment. The future works also may
use the study neutrosophic set environment on several related al-
which implies that x ∗ y ∈ T∈∨ qkT (A; α). Thus AT (x ∗ y) ≥ α gebraic structures, for example, M V -algebras, BL-algebras, R0 -
algebras, EQ-algebras, equality algebras, M T L-algebras etc.

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points
Neutrosophic Sets and Systems, Vol. 20, 2018 35

References
[1] K. Atanassov, Intuitionistic fuzzy sets. Fuzzy Sets and Sys- [9] Abdel-Basset, M., Mohamed, M., Smarandache, F., &
Chang, V. (2018). Neutrosophic Association Rule Mining
tems 20 (1986), 87–96. Algorithm for Big Data Analysis. Symmetry, 10(4), 106.
[2] M. Bucolo, L. Fortuna and M. La Rosa, Complex dynamics [10] Abdel-Basset, M., & Mohamed, M. (2018). The Role of
through fuzzy chains, IEEE Trans. Fuzzy Syst. 12 (2004), Single Valued Neutrosophic Sets and Rough Sets in Smart
no. 3, 289–295. City: Imperfect and Incomplete Information Systems.
Measurement. Volume 124, August 2018, Pages 47-55
[3] Y.S. Huang, BCI-algebra, Science Press: Beijing, China,
[11] Abdel-Basset, M., Gunasekaran, M., Mohamed, M., &
2006. Smarandache, F. A novel method for solving the fully
neutrosophic linear programming problems. Neural
[4] Y.B. Jun, Neutrosophic subalgebras of several types Computing and Applications, 1-11.
in BCK/BCI-algebras, Ann. Fuzzy Math. Inform. 14
(2017), no. 1, 75–86. [12] Abdel-Basset, M., Manogaran, G., Gamal, A., &
Smarandache, F. (2018). A hybrid approach of neutrosophic
[5] J. Meng and Y.B. Jun, BCK-algebra, Kyungmoon Sa Co., sets and DEMATEL method for developing supplier selection
criteria. Design Automation for Embedded Systems, 1-22.
Seoul, Korea, 1994.
[13] Abdel-Basset, M., Mohamed, M., & Chang, V. (2018).
[6] A,B. Saeid and Y.B. Jun, Neutrosophic subalgebras of NMCDA: A framework for evaluating cloud computing
BCK/BCI-algebras based on neutrosophic points, Ann. services. Future Generation Computer Systems, 86, 12-29.
Fuzzy Math. Inform. 14 (2017), no. 1, 87–97. [14] Abdel-Basset, M., Mohamed, M., Zhou, Y., & Hezam, I.
(2017). Multi-criteria group decision making based on
[7] F. Smarandache, A Unifying Field in Logics: Neutrosophic
neutrosophic analytic hierarchy process. Journal of Intelligent
Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Prob- & Fuzzy Systems, 33(6), 4055-4066.
ability, American Reserch Press, Rehoboth, NM, USA,
1999. [15] Abdel-Basset, M.; Mohamed, M.; Smarandache, F. An
Extension of Neutrosophic AHP–SWOT Analysis for
[8] F. Smarandache, Neutrosophic set-a generalization of the Strategic Planning and Decision-Making. Symmetry 2018, 10,
116.
intuitionistic fuzzy set, Int. J. Pure Appl. Math. 24 (2005),
no. 3, 287–297.

Received : March 23, 2018. Accepted : April 13, 2018.

S.J. Kim, S.Z. Song, Y.B. Jun, Generalizations of neutrosophic subalgebras in BCK/BCI-algebras based on neutrosophic points

Vous aimerez peut-être aussi