Left (Right)-Quasi Neutrosophic Triplet Loops (Groups) and Generalized BE-Algebras

Abstract

The new notion of a neutrosophic triplet group (NTG) is proposed by Florentin Smarandache; it is a new algebraic structure different from the classical group. The aim of this paper is to further expand this new concept and to study its application in related logic algebra systems. Some new notions of left (right)-quasi neutrosophic triplet loops and left (right)-quasi neutrosophic triplet groups are introduced, and some properties are presented. As a corollary of these properties, the following important result are proved: for any commutative neutrosophic triplet group, its every element has a unique neutral element. Moreover, some left (right)-quasi neutrosophic triplet structures in BE-algebras and generalized BE-algebras (including CI-algebras and pseudo CI-algebras) are established, and the adjoint semigroups of the BE-algebras and generalized BE-algebras are investigated for the first time.

1. Introduction

The symmetry exists in the real world, and group theory is a mathematical tool for describing symmetry. At the same time, in order to describe the generalized symmetry, the concept of group is popularized in different ways, for example, the notion of a generalized group is introduced (see [1,2,3,4]). Recently, F. Smarandache [5,6] introduced another new algebraic structure, namely: neutrosophic triplet group, which comes from the theory of the neutrosophic set (see [7,8,9,10,11]). As a new extension of the concept of group, the neutrosophic triplet group has attracted the attention of many scholars, and a series of related papers have been published [12,13,14,15].

On the other hand, in the last twenty years, the non-classical logics, such as various fuzzy logics, have made great progress. At the same time, the research on non-classical logic algebras that are related to it have also made great achievements [16,17,18,19,20,21,22,23,24,25,26]. As a generalization of BCK-algebra, H.S. Kim and Y.H. Kim [27] introduced the notion of BE-algebra. Since then, some scholars have studied ideals (filters), congruence relations of BE-algebras, and various special BE-algebras have been proposed, these research results are included in the literature [28,29,30,31] and monograph [32]. In 2013 and 2016, the new notions of pseudo BE-algebra and commutative pseudo BE-algebra were introduced, and some new properties were obtained [33,34]. Similar to BCI-algebra as a generalization of BCK-algebra, B.L. Meng introduced the concept of CI-algebra, which is as a generalization of BE-algebra, and studied the structures and closed filters of CI-algebras [35,36,37]. After that, the CI-algebras and their related algebraic structures (such as Q-algebras, pseudo Q-algebras, pseudo CI-algebras, and pseudo BCH- algebras) have been extensively studied [38,39,40,41,42,43,44,45,46].

This paper will combine the above two directions to study general neutrosophic triplet structures and the relationships between these structures and generalized BE-algebras. On the one hand, we introduce various general neutrosophic triplet structures, such as (l-l)-type, (l-r)-type, (r-l)-type, (r-r)-type, (l-lr)-type, (r-lr)-type, (lr-l)-type, and (lr-r)-type quasi neutrosophic triplet loops (groups), and investigate their basic properties. Moreover, we get an important corollary, namely: that for any commutative neutrosophic triplet group, its every element has a unique neutral element. On the other hand, we further study the properties of (pseudo) BE-algebras and (pseudo) CI-algebras, and the general neutrosophic triplet structures that are contained in a BE-algebra (CI-algebra) and pseudo BE-algebra (pseudo CI-algebra). Moreover, for the first time, we introduce the concepts of adjoint semigroups of BE-algebras and generalized BE-algebras (including CI-algebras, pseudo BE-algebras, and pseudo CI-algebras) and discuss some interesting topics.

2. Basic Concepts

Definition 1.

([5,6]) Let N be a set together with a binary operation *. Then, N is called a neutrosophic triplet set if, for any a∈N, there exists a neutral of ‘a’, called neut(a), and an opposite of ‘a’, called anti(a), with neut(a) and anti(a), belonging to N, such that:

a * neut(a) = neut(a) * a = a;

a * anti(a) = anti(a) * a = neut(a).

It should be noted that neut(a) and anti(a) may not be unique here for some a∈N. We call (a, neut(a), and anti(a)) a neutrosophic triplet for the determined neut(a) and anti(a).

Remark 1.

In the original definition, the neutral element is different from the unit element in the traditional group theory. The above definition of this paper takes away such restriction, please see the Remark 3 in Ref. [12].

Definition 2.

([5,6,13]) Let (N, *) be a neutrosophic triplet set.

(1) 

If * is well-defined, that is, for any a, b ∈ N, one has a * b ∈ N. Then, N is called a neutrosophic triplet loop.

(2) 

If N is a neutrosophic triplet loop, and * is associative, that is, (a * b) * c= a * (b * c) for all a, b, c ∈ N. Then, N is called a neutrosophic triplet group.

(3) 

If N is a neutrosophic triplet group, and * is commutative, that is, a * b = b * a for all a, b ∈ N. Then, N is called a commutative neutrosophic triplet group.

Definition 3.

([27,35,41,42]) A CI-algebra (dual Q-algebra) is an algebra (X; →, 1) of type (2, 0), satisfying the following conditions:

(i) x → x = 1,

(ii) 1 → x = x,

(iii) x → (y → z) = y → (x → z), for all x, y, z ∈ X.

A CI-algebra (X; →, 1)is called a BE-algebra, if it satisfies the following axiom:

(iv) x → 1 = 1, for all x ∈ X.

A CI-algebra (X; →, 1)is called a dual BCH-algebra, if it satisfies the following axiom:

(v) x → y = y→x = 1 ⇒ x = y.

A binary relation ≤ on CI-algebra (BE-algebra) X, is defined by x ≤ y if, and only if, x → y = 1.

Definition 4.

([33,43,45]) An algebra (X; →, ⇝, 1) of type (2, 2, 0) is called a dual pseudo Q-algebra if, for all x, y, z ∈ X, it satisfies the following axioms:

(dpsQ1) x → x = x ⇝ x = 1,

(dpsQ2) 1 → x = 1 ⇝ x = x,

(dpsQ3) x → (y ⇝ z) = y ⇝ (x → z).

A dual pseudo Q-algebra X is called a pseudo CI-algebra, if it satisfies the following condition:

(psCI) x → y = 1 ⇔ x ⇝ y = 1.

A pseudo CI-algebra X is called a pseudo BE-algebra, if it satisfies the following condition:

(psBE) x → 1 = x ⇝ 1 = 1, for all x ∈ X.

A pseudo CI-algebra X is called a pseudo BCH-algebra, if it satisfies the following condition:

(psBCH) x → y = y ⇝ x = 1 ⇒ x = y.

In a dual pseudo-Q algebra, one can define the following binary relations:

x ≤_→ y ⇔ x → y = 1. x ≤_⇝ y ⇔ x ⇝ y = 1.

Obviously, a dual pseudo-Q algebra X is a pseudo CI-algebra if, and only if, ≤_→ = ≤_⇝.

3. Various Quasi Neutrosophic Triplet Loops (Groups)

Definition 5.

Let N be a set together with a binary operation * (that is, (N, *) be a loop) and a ∈ N.

(1) 

If exist b, c ∈ N, such that a * b = a and a * c = b, then a is called an NT-element with (r-r)- property;

(2) 

If exist b, c ∈ N, such that a * b = a and c * a = b, then a is called an NT-element with (r-l)- property;

(3) 

If exist b, c ∈ N, such that b * a = a and c * a = b, then a is called an NT-element with (l-l)- property;

(4) 

If exist b, c ∈ N, such that b * a = a and a * c = b, then a is called an NT-element with (l-r)- property;

(5) 

If exist b, c ∈ N, such that a * b = b * a = a and c * a = b, then a is called an NT-element with (lr-l)-property;

(6) 

If exist b, c ∈ N, such that a * b = b * a = a and a * c = b, then a is called an NT-element with (lr-r)-property;

(7) 

If exist b, c ∈ N, such that b * a = a and a * c = c * a = b, then a is called an NT-element with (l-lr)-property;

(8) 

If exist b, c ∈ N, such that a * b = a and a * c = c * a = b, then a is called an NT-element with (r-lr)-property;

(9) 

If exist b, c ∈ N, such that a * b = b * a = a and a * c = c * a = b, then a is called an NT-element with (lr-lr)-property.

It is easy to verify that, (i) if a is an NT-element with (l-lr)-property, then a is an NT-element with (l-l)-property and (l-r)-property; if a is an NT-element with (lr-l)-property, then a is an NT-element with (l-l)-property and (r-l)-property; and so on; (ii) a neutrosophic triplet loop (N, *) is a neutrosophic triplet group if, and only if, every element in N is an NT-element with (lr-lr)-property; (iii) if * is commutative, then the above properties coincide. Moreover, the following example shows that (r-l)-property and (r-r)-property cannot infer to (r-lr)-property, and (r-r)-property and (l-lr)-property cannot infer to (lr-lr)-property.

Example 1.

Let N = {a, b, c, d}. The operation * on N is defined as

Table 1. Neutrosophic triplet (NT)-elements in a loop.

*	a	b	c	d
a	a	a	a	d
b	c	a	b	c
c	c	b	d	a
d	a	d	b	a

. Then, (N, *) is a loop, and a is an NT-element with (lr-lr)-property; b is an NT-element with (lr-r)-property; c is an NT-element with (r-l)-property and (r-r)-property, but c is not an NT-element with (r-lr)-property; and d is an NT-element with (r-r)-property and (l-lr)-property, but d is not an NT-element with (lr-lr)-property.

Definition 6.

Let (N, *) be a loop (semi-group). If for every element a in N, a is an NT-element with (r-r)-property, then (N, *) is called (r-r)-quasi neutrosophic triplet loop (group). Similarly, if for every element a in N, a is an NT-element with (r-l)-, (l-l)-, (l-r)-, (lr-l)-, (lr-r)-, (l-lr)-, (r-lr)-property, then (N, *) is called (r-l)-, (l-l)-, (l-r)-, (lr-l)-, (lr-r)-, (l-lr)-, (r-lr)-quasi neutrosophic triplet loop (group), respectively. All of these generalized neutrosophic triplet loops (groups) are collectively known as quasi neutrosophic triplet loops (groups).

Remark 2.

For quasi neutrosophic triplet loops (groups), we will use the notations like neutrosophic triplet loops (groups), for example, to denote a (r-r)-neutral of ‘a’ by neut_(r-r)(a), denote a (r-r)-opposite of ‘a’ by anti_(r-r)(a), where ‘a’ is an NT-element with (r-r)-property. If neut_(r-r)(a) and anti_(r-r)(a) are not unique, then denote the set of all (r-r)-neutral of ‘a’ by {neut_(r-r)(a)}, denote the set of all (r-r)-opposite of ‘a’ by {anti_(r-r)(a)}.

For the loop (N, *) in Example 1, we can verify that (N, *) is a (r-r)-quasi neutrosophic triplet loop, and we have the following:

neut_(r-r)(a) = a, anti_(r-r)(a) = a; neut_(r-r)(b) = c, {anti_(r-r)(b)} = {a, d};

neut_(r-r)(c) = a, anti_(r-r)(c) = d; neut_(r-r)(d) = b, anti_(r-r)(d) = c.

Theorem 1.

If (N, *) is a (l-lr)-quasi neutrosophic triplet group, then (N, *) is a neutrosophic triplet group. Moreover, if (N, *) is a (r-lr)-quasi neutrosophic triplet group, then (N, *) is a neutrosophic triplet group.

Proof. 

Suppose that (N, *) is a (l-lr)-quasi neutrosophic triplet group. For any a ∈ N, by Definitions 5 and 6, we have the following:

neut_(l-lr)(a) * a = a, anti_(l-lr)(a) * a = a * anti_(l-lr)(a) = neut_(l-lr)(a).

Here, neut_(l-lr)(a) ∈ {neut_(l-lr)(a)}, anti_(l-lr)(a) ∈ {anti_(l-lr)(a)}. Applying associative law we get the following:

a * neut_(l-lr)(a) = a * (anti_(l-lr)(a) * a) = (a * anti_(l-lr)(a)) * a = neut_(l-lr)(a) * a = a.

This means that neut_(l-lr)(a) is a right neutral of ‘a’. From the arbitrariness of a, it is known that (N, *) is a neutrosophic triplet group.

Another result can be proved similarly. □

Theorem 2.

Let (N, *) be a (r-lr)-quasi neutrosophic triplet group such that:

(s * p) * a = a * (s * p), ∀ s ∈ {neut_(r-lr)(a)}, ∀ p ∈ {anti_(r-lr)(a)}.

Then,

(1) 

for any a ∈ N, s ∈ {neut_(r-lr)(a)} ⇒s * s = s.

(2) 

for any a ∈ N, s, t ∈{neut_(r-lr)(a)} ⇒s * t = t.

(3) 

when * is commutative, for any a ∈ N, neut_(r-lr)(a) is unique.

Proof. 

(1) Assume s∈{neut_(r-lr)(a)}, then a * s = a, and exist p ∈ N, such that p * a = a *p = s. Thus,

(s * p) * a = s * (p * a) = s * s,

a * (s * p) = (a * s) * p = a * p = s.

According to the hypothesis, (s * p) * a = a * (s * p), it follows that s * s = s.

(2) Assume s, t∈{neut_(r-lr)(a)}, then a * s = a, a * t = a, and exist p, q ∈ N, such that p * a = a * p = s, q * a = a * q = t. Thus,

(s * q) * a = s * (q * a) = s * t,

a * (s * q) = (a * s) * q = a * q = t.

According to the hypothesis, (s * p) * a = a * (s * p), it follows that s * t = t.

(3) Suppose a ∈ N, s, t∈{neut_(r-lr)(a)}. Applying Theorem (2) to s and t we have s * t = t. Moreover, applying Therorem (2) to t and s we have t * s = s. Hence, when * is commutative, s * t = t * s. Therefore, s = t, that is, neut_(r-lr)(a) is unique. □

Corollary 1.

Let (N, *) be a commutative neutrosophic triplet group. Then neut(a) is unique for any a ∈ N.

Proof. 

Since all neutrosophic triplet groups are (r-lr)-quasi neutrosophic triplet groups, and * is commutative, then the assumption conditions in Theorem 2 are valid for N, so applying Theorem 2 (3), we get that neut(a) is unique for any a ∈ N. □

The following examples show that the neutral element may be not unique in the neutrosophic triplet loop.

Example 2.

Let N = {1, 2, 3}. Define binary operation * on N as following

Table 2. Commutative neutrosophic triplet loop.

*	1	2	3
1	1	1	2
2	1	2	3
3	2	3	3

. Then, (N, *) is a commutative neutrosophic triplet loop, and {neut(1)} = {1, 2}. Since (1 * 3) * 3 ≠ 1 * (3 * 3), so (N, *) is not a neutrosophic triplet group.

Example 3.

Let N = {1, 2, 3, 4}. Define binary operation * on N as following

Table 3. Non-commutative neutrosophic triplet loop.

*	1	2	3	4
1	3	1	1	3
2	4	2	2	4
3	1	3	3	4
4	3	4	4	2

. Then, (N, *) is a neutrosophic triplet loop, and {neut(4)} = {2, 3}. Since (4 * 1) * 1 ≠ 4 * (1 * 1), so (N, *) is not a neutrosophic triplet group.

4. Quasi Neutrosophic Triplet Structures in BE-Algebras and CI-Algebras

From the definition of BE-algebra and CI-algebra (see Definition 3), we can see that ‘1’ is a left neutral element of every element, that is, BE-algebras and CI-algebras are directly related to quasi neutrosophic triplet structures. This section will reveal the various internal connections among them.

4.1. BE-Algebras (CI-Algebras) and (l-l)-Quasi Neutrosophic Triplet Loops

Theorem 3.

Let (X; →, 1) be a BE-algebra. Then (X, →) is a (l-l)-quasi neutrosophic triplet loop. And, when |X|>1, (X, →) is not a (lr-l)-quasi neutrosophic triplet loop with neutral element 1.

Proof. 

By Definition 3, for all x ∈ X, 1 → x = x and x → x = 1. According Definition 6, we know that (X, →) is a (l-l)-quasi neutrosophic triplet loop, such that:

1 ∈ {neut_(l-l)(x)}, x ∈ {anti_(l-l)(x)}, for any x ∈ X.

If |X| > 1, then exist x ∈ X, such that x ≠ 1. Using Definition 3 (iv), x → 1 =1 ≠ x, this means that 1 is not a right neutral element of x. Hence, (X, →) is not a (lr-l)-quasi neutrosophic triplet loop with neutral element 1. □

Example 4.

Let X = {a, b, c, 1}. Define binary operation * on N as following

Table 4. BE-algebra and (l-l)-quasi neutrosophic triplet loop (1).

→	a	b	c	1
a	1	b	b	1
b	a	1	a	1
c	1	1	1	1
1	a	b	c	1

. Then, (X; →, 1) is a BE-algebra, and (X, →) is a (l-l)-quasi neutrosophic triplet loop, such that:

{neut_(l-l)(a)} = {1}, {anti_(l-l)(a)} = {a, c}; {neut_(l-l)(b)} = {1}, {anti_(l-l)(b)} = {b, c};

{neut_(l-l)(c)} = {1}, {anti_(l-l)(c)} = {c}; {neut_(l-l)(1)} = {1}, {anti_(l-l)(1)} = {1}.

Example 5.

Let X = {a, b, c, 1}. Define binary operation * on N as following

Table 5. BE-algebra and (l-l)-quasi neutrosophic triplet loop (2).

→	a	b	c	1
a	1	b	c	1
b	a	1	c	1
c	a	b	1	1
1	a	b	c	1

. Then, (X; →, 1) is a BE-algebra, and (X, →) is a (l-l)-quasi neutrosophic triplet loop such that:

{neut_(l-l)(a)} = {1}, {anti_(l-l)(a)} = {a}; {neut_(l-l)(b)} = {1}, {anti_(l-l)(b)} = {b};

{neut_(l-l)(c)} = {1}, {anti_(l-l)(c)} = {c}; {neut_(l-l)(1)} = {1}, {anti_(l-l)(1)} = {1}.

Definition 7.

([36]) Let (X; →, 1) be a CI-algebra and a ∈ X. If for any x ∈X, a → x = 1 implies a = x, then a is called an atom in X. Denote A(X) = {a ∈ X| a is an atom in X}, it is called the singular part of X. A CI-algebra (X; →, 1) is said to be singular if every element of X is an atom.

Lemma 1.

([35,36,37]) If (X; →, 1) is a CI-algebra, then for all x, y ∈ X:

(1) 

x → ((x → y) → y) = 1,

(2) 

1 → x = 1 (or equivalently, 1 ≤ x) implies x = 1,

(3) 

(x → y) → 1 = (x → 1) → (y → 1).

Lemma 2.

([36]) Let (X; →, 1) be a CI-algebra. If a, b ∈ X are atoms in X, then the following are true:

(1) 

a = (a → 1) → 1,

(2) 

(a → b) → 1 = b → a,

(3) 

((a → b) → 1) → 1 = a → b,

(4) 

for any x ∈ X, (a → x) → (b → x) = b → a,

(5) 

for any x ∈ X, (a → x) → b = (b → x) → a,

(6) 

for any x ∈ X, (a → x) → (y → b) = (b → x) → (y → a).

Definition 8.

Let (X; →, 1) be a CI-algebra. If for any x ∈X, x → 1 = x, then (X; →, 1) is said to be a strong singular.

Proposition 1.

If (X; →, 1) is a strong singular CI-algebra. Then (X; →, 1) is a singular CI-algebra.

Proof. 

For any x ∈ X, assume that a → x = 1, where a ∈ X. By Definition 8, we have x → 1 = x, a → 1 = a. Hence, applying Definition 3,

a = a → 1 = a → (x → x) = x → (a → x) = x → 1 = x.

By Definition 7, x is an atom. Therefore, (X; →, 1) is singular CI-algebra. □

Proposition 2.

Let (X; →, 1) be a CI-algebra. Then (X; →, 1) is a strong singular CI-algebra if, and only if, (X; →, 1) is an associative BCI-algebra.

Proof. 

Obviously, every associative BCI-algebra is a strong singular CI-algebra (see [36] and Proposition 1 in Ref. [12]).

Assume that (X; →, 1) is a strong singular CI-algebra.

(1)

For any x, y ∈ X, if x → y = y → x = 1, then, by Definitions 8 and 3, we have the following:

x = x → 1 = x → (y → x) = y → (x → x) = y → 1 = y.

(2)

For any x, y, z ∈ X, by Proposition 1 and Lemma 2 (4), we can get the following:

(y → z) → ((z → x) → (y → x)) = (y → z) → (y → z) = 1.

Combining Proof (1) and (2), we know that (X; →, 1) is a BCI-algebra. From this, applying Definition 8 and Proposition 1 in Ref. [12], (X; →, 1) is an associative BCI-algebra. □

Theorem 4.

Let (X; →, 1) be a CI-algebra. Then, (X, →) is a (l-l)-quasi neutrosophic triplet loop. Moreover, (X, →) is a neutrosophic triplet group if, and only if, (X; →, 1) is a strong singular CI-algebra (associative BCI-algebra).

Proof. 

It is similar to the proof of Theorem 3, and we know that (X, →) is a (l-l)-quasi neutrosophic triplet loop.

If (X; →, 1) is a strong singular CI-algebra, using Proposition 2, (X; →, 1) is an associative BCI-algebra. Hence, → is associative and commutative, it follows that (X, →) is a neutrosophic triplet group.

Conversely, if (X, →) is a neutrosophic triplet group, then → is associative, thus

x → 1 = x → (x → x) = (x → x) → x = 1 → x = x.

By Definition 8 we know that (X; →, 1) is a strong singular CI-algebra. □

Example 6.

Let X = {a, b, c, d, e,1}. Define operation → on X, as following

Table 6. CI-algebra and (l-l)-quasi neutrosophic triplet loop.

→	a	b	c	d	e	1
a	1	1	c	c	c	1
b	1	1	c	c	c	1
c	d	1	1	a	b	c
d	c	c	1	1	1	c
e	c	c	1	1	1	c
1	a	b	c	d	e	1

. Then, (X; →, 1) is a CI-algebra, and (X, →) is a (l-l)-quasi neutrosophic triplet loop, such that

{neut_(l-l)(a)} = {1}, {anti_(l-l)(a)} = {a,b}; {neut_(l-l)(b)} = {1}, {anti_(l-l)(b)} = {a,b,c};

{neut_(l-l)(c)} = {1}, {anti_(l-l)(c)} = {c,d,e}; {neut_(l-l)(d)} = {1}, {anti_(l-l)(d)} = {d,e};

{neut_(l-l)(e)}={1}, {anti_(l-l)(e)}={d,e}; {neut_(l-l)(1)}={1}, {anti_(l-l)(1)}={1}.

4.2. BE-Algebras (CI-Algebras) and Their Adjoint Semi-Groups

I. Fleischer [16] studied the relationship between BCK-algebras and semigroups, and W. Huang [17] studied the close connection between the BCI-algebras and semigroups. In this section, we have studied the adjoint semigroups of the BE-algebras and CI-algebras, and will give some interesting examples.

For any BE-algebra or CI-algebra (X; →, 1), and any element a in X, we use p_a to denote the self-map of X defined by the following:

p_a: X → X; ↦ a → x, for all x ∈ X.

Theorem 5.

Let (X; →, 1) be a BE-algebra (or CI-algebra), and M(X) be the set of finite products p_a * …* p_b of self-map of X with a, …, b ∈X, where * represents the composition operation of mappings. Then, (M(X), *) is a commutative semigroup with identity p₁.

Proof. 

Since the composition operation of mappings satisfies the associative law, (M(X), *) is a semigroup. Moreover, since

p₁: X→X ↦ 1 → x, for all x ∈ X.

Applying Definition 3 (ii), we get that p₁(x)=x for any x∈X. Hence, p₁*m= p₁*m=m for any m∈M(X).

For any a, b∈X, using Definition 3 (iii) we have (∀x∈X) the following:

(p_a* p_b)(x) = p_a(b → x) = a → (b → x) = b → (a → x) = p_b(a → x) = (p_b* p_a)(x).

Therefore, (M(X), *) is a commutative semigroup with identity p₁. □

Now, we call (M(X), *) the adjoint semigroup of X.

Example 7.

Let X = {a, b, c, 1}. Define operation → on X, as following

Table 7. BE-algebra.

→	a	b	c	1
a	1	1	1	1
b	c	1	a	1
c	1	1	1	1
1	a	b	c	1

. Then, (X; →, 1) is a BE-algebra, and

p_a: X → X; a $\mapsto$ 1, b $\mapsto$ 1, c $\mapsto$ 1, 1 $\mapsto$ 1. It is abbreviated to p_a = (1, 1, 1, 1).

p_b: X → X; a $\mapsto$ c, b $\mapsto$ 1, c $\mapsto$ a, 1 $\mapsto$ 1. It is abbreviated to p_b = (c, 1, a, 1).

p_c: X → X; a $\mapsto$ 1, b $\mapsto$ 1, c $\mapsto$ 1, 1 $\mapsto$ 1. It is abbreviated to p_c = (1, 1, 1, 1).

p₁: X → X; a $\mapsto$ a, b $\mapsto$ b, c $\mapsto$ c, 1 $\mapsto$ 1. It is abbreviated to p₁ = (a, b, c, 1).

We can verify that p_a * p_a = p_a, p_a * p_b = p_a, p_a * p_c = p_a; p_b * p_b = (a, 1, c, 1), p_b * p_c = p_c = p_a; p_a * (p_b * p_b) = p_a, p_b * (p_b * p_b) = p_b, p_c * (p_b * p_b) = p_c = p_a. Denote p_bb = p_b* p_b = (a, 1, c, 1), then M(X) = {p_a, p_b, p_bb, p₁}, and its Cayley table is

Table 8. Adjoint semigroup of the above BE-algebra.

*	pa	pb	pbb	p1
pa	pa	pa	pa	pa
pb	pa	pbb	pb	pb
pbb	pa	pb	pbb	pbb
p1	pa	pb	pbb	p1

. Obviously, (M(X), *) is a commutative neutrosophic triplet group and

neut(p_a) = p_a, anti(p_a) = p_a; neut(p_b) = p_bb, anti(p_b) = p_b; neut(p_bb) = p_bb, anti(p_bb) = p_bb; neut(p₁) = p₁, anti(p₁) = p₁.

Example 8.

Let X = {a, b, 1}. Define operation → on X, as following

Table 9. CI-algebra.

→	a	b	1
a	1	a	b
b	b	1	a
1	a	b	1

. Then, (X; →, 1) is a CI-algebra, and

p_a: X → X; a $\mapsto$ 1, b $\mapsto$ a, 1 $\mapsto$ b. It is abbreviated to p_a = (1, a, b).

p_b: X → X; a $\mapsto$ b, b $\mapsto$ 1, 1 $\mapsto$ a. It is abbreviated to p_b = (b, 1, a).

p₁: X → X; a $\mapsto$ a, b $\mapsto$ b, 1 $\mapsto$ 1. It is abbreviated to p₁ = (a, b, 1).

We can verify that p_a * p_a = p_b, p_a * p_b = p₁; p_b * p_b = p_a. Then M(X) = {p_a, p_b, p₁} and its Cayley table is

Table 10. Adjoint semigroup of the above CI-algebra.

*	pa	pb	p1
pa	pb	p1	pa
pb	p1	pa	pb
p1	pa	pb	p1

. Obviously, (M(X), *) is a commutative group with identity p₁ and (p_a)⁻¹ = p_b, (p_b)⁻¹ = p_a.

Theorem 6.

Let (X; →, 1) be a singular CI-algebra, and M(X) be the adjoint semigroup. Then (M(X), *) is a commutative group with identity p₁, where M(X) = {p_a | a ∈X} and |M(X)| = |X|.

Proof. 

(1) First, we prove that for any singular CI-algebra, a → (b → x) = ((a → 1) → b) → x, $\forall$ a, b, x ∈ X.

In fact, by Definition 7 and Lemma 2, we have the following:

((a → 1) → b) → x = ((a → 1) → b) → ((x → 1) → 1)
= (x → 1) → (((a → 1) → b) → 1)
= (x → 1) → (((a → 1) → 1) → (b → 1))
= (x →1) → (a → (b → 1))
= a → ((x → 1) → (b → 1))
= a → (b → x).

(2) Second, we prove that for any singular CI-algebra, a ≠ b ⇒ p_a ≠ p_b, ∀ a, b ∈ X.

Assume p_a = p_b, a, b ∈ X. Then, for all x in X, p_a(x) = p_b(x). Hence,

a → b = p_a(b) = p_b(b) = b → b = 1.

From this, applying Lemma 2 (1) and (6) we get

a = (a → 1) → 1 = (a → 1) → (a → b) = (b → 1) → (a → a) = (b → 1) → 1 = b.

(3) Using Lemma 2 (1), we know that for any a, b ∈ X, there exist c ∈ X, such that p_a * p_b = p_c, where c = (a → 1) → b. This means that M(X) $\subseteq$ {p_a|a ∈ X}. By the definition of M(X), {p_a a ∈ X} $\subseteq$ M(X). Hence, M(X) = {p_a|a ∈ X}.

(4) Using Lemma 2 (2) and (3), we know that |M(X)|=|X|. □

5. Quasi Neutrosophic Triplet Structures in Pseudo BE-Algebras and Pseudo CI-Algebras

Like the above Section 4, we can discuss the relationships between pseudo BE-algebras (pseudo CI-algebras) and quasi neutrosophic triplet structures. This section will give some related results and examples, but part of the simple proofs will be omitted.

5.1. Pseudo BE-Algebras (Pseudo CI-Algebras) and (l-l)-Quasi Neutrosophic Triplet Loops

Theorem 7.

Let (X; →, ⇝, 1) be pseudo BE-algebra. Then (X, →) and (X, ⇝) are (l-l)-quasi neutrosophic triplet loops. And, when |X| > 1, (X, →) and (X, ⇝) are not (lr-l)-quasi neutrosophic triplet loops with neutral element 1.

Example 9.

Let X = {a, b, c, 1}. Define operations → and ⇝ on X as following

Table 11. Pseudo BE-algebra (1).

→	a	b	c	1
a	1	1	b	1
b	a	1	c	1
c	1	1	1	1
1	a	b	c	1

and

Table 12. Pseudo BE-algebra (2).

⇝	a	b	c	1
a	1	1	a	1
b	a	1	a	1
c	1	1	1	1
1	a	b	c	1

. Then, (X; →, ⇝, 1) is a pseudo BE-algebra, and (X, →) and (X, ⇝) are (l-l)-quasi neutrosophic triplet loops.

Definition 9.

([44,46]) Let a be an element of a pseudo CI-algebra (X; →, ⇝, 1). a is said to be an atom in X if for any x ∈ X, a → x = 1 implies a = x.

Applying the results in Ref. [44,45,46] we have the following propositions (the proofs are omitted).

Proposition 3.

If (X; →,⇝, 1) is a pseudo CI-algebra, then for all x, y ∈X

(1) 

x ≤ (x → y) ⇝ y, x ≤ (x ⇝ y) → y,

(2) 

x ≤ y → z ⇔y ≤ x ⇝ z,

(3) 

(x → y) → 1 = (x → 1) ⇝ (y ⇝ 1), (x ⇝ y) ⇝ 1 = (x ⇝ 1) → (y → 1),

(4) 

x → 1 = x ⇝ 1,

(5) 

x ≤ y implies x → 1 = y → 1.

Proposition 4.

Let (X; →,⇝, 1) be a pseudo CI-algebra. If a, b ∈X are atoms in X, then the following are true:

(1) 

a = (a → 1) → 1,

(2) 

for any x ∈ X, (a → x) ⇝ x = a, (a ⇝ x) → x = a,

(3) 

for any x ∈ X, (a → x) ⇝ 1 = x → a, (a ⇝ x) → 1 = x⇝ a,

(4) 

for any x ∈ X, x → a = (a → 1) ⇝ (x → 1), x ⇝ a = (a ⇝ 1) → (x ⇝ 1).

Definition 10.

A pseudo CI-algebra (X; →,⇝, 1) is said to be singular if every element of X is an atom. A pseudo CI-algebra (X; →,⇝, 1) is said to be strong singular if for any x ∈X, x → 1 = x = x⇝ 1.

Proposition 5.

If (X; →,⇝, 1) is a strong singular pseudo CI-algebra. Then (X; →,⇝, 1) is singular.

Proof. 

For any x ∈ X, assume that a → x = 1, where a ∈ X. It follows from Definition 10,

x → 1 = x= x ⇝ 1, a → 1 = a = a ⇝ 1.

Hence, applying Definition 4 and Proposition 3,

a = a → 1 = a → (x ⇝ x) = x ⇝ (a → x) = x ⇝ 1 =x.

By Definition 9, x is an atom. Therefore, (X; →, ⇝, 1) is singular pseudo CI-algebra. □

Applying Theorem 3.11 in Ref. [46], we can get the following:

Lemma 3.

Let (X; →, ⇝, 1) be a pseudo CI-algebra. Then the following statements are equivalent:

(1) 

x → (y → z) = (x → y) → z, for all x, y, z in X;

(2) 

x → 1 = x= x⇝ 1, for every x in X;

(3) 

x → y= x ⇝ y = y → x, for all x, y in X;

(4) 

x ⇝ (y ⇝ z) = (x ⇝ y) ⇝ z, for all x, y, z in X.

Proposition 6.

Let (X; →,⇝, 1) be a pseudo CI-algebra. Then (X; →,⇝, 1) is a strong singular pseudo CI-algebra if, and only if, → =⇝ and (X; →, 1) is an associative BCI-algebra.

Proof. 

We know that every associative BCI-algebra is a strong singular pseudo CI-algebra. □

Now, suppose that (X; →, 1) is a strong singular pseudo CI-algebra. By Definition 10 and Lemma 3 (3), x → y = x ⇝ y, ∀x, y ∈ X. That is, → = ⇝. Hence, (X; →, 1) is a strong singular CI-algebra. It follows that (X; →, 1) is an associative BCI-algebra (using Proposition 2).

Theorem 8.

Let (X; →,⇝, 1) be a pseudo CI-algebra. Then (X, →) and (X,⇝) are(l-l)-quasi neutrosophic triplet loops. Moreover, (X, →) and (X,⇝) are neutrosophic triplet groups if, and only if, (X; →,⇝, 1) is a strong singular pseudo CI-algebra (associative BCI-algebra).

Proof. 

Applying Lemma 3, and the proof is omitted. □

5.2. Pseudo BE-Algebras (Pseudo CI-Algebras) and Their Adjoint Semi-Groups

For any pseudo BE-algebra or pseudo CI-algebra (X; →, ⇝, 1) as well as any element a in X, we use p_a^→ and p_a^⇝ to denote the self-map of X, which is defined by the following:

p_a^→: X → X; ↦ a → x, for all x ∈ X.

p_a^⇝: X → X; ↦ a ⇝ x, for all x ∈ X.

Theorem 9.

Let (X; →, ⇝, 1) be a pseudo BE-algebra (or pseudo CI-algebra), and

M^→(X) = {finite products p_a^→ * …* p_b^→ of self-map of X | a, …, b ∈ X},

M^⇝(X) = {finite products p_a^⇝ * …* p_b^⇝ of self-map of X | a, …, b ∈ X},

M(X) = {finite products p_a^→ (or p_a^⇝) * …* p_b^→ (or p_b^⇝) of self-map of X | a, …, b ∈ X},

where * represents the composition operation of mappings. Then (M^→(X), *), (M^⇝(X), *), and (M(X), *) are all semigroups with the identity p₁ = p₁^→ = p₁^⇝.

Proof. 

It is similar to Theorem 5. □

Now, we call (M^→(X), *), (M^⇝(X), *), and (M(X), *) the adjoint semigroups of X.

Example 10.

Let X = {a, b, c, 1}. Define operations → and ⇝ on X as following

Table 13. Pseudo BE-algebra and adjoint semigroups (1).

→	a	b	c	1
a	1	b	b	1
b	a	1	c	1
c	1	1	1	1
1	a	b	c	1

and

Table 14. Pseudo BE-algebra and adjoint semigroups (2).

⇝	a	b	c	1
a	1	b	c	1
b	a	1	a	1
c	1	1	1	1
1	a	b	c	1

. Then, (X; →, ⇝, 1) is a pseudo BE-algebra, and

p_a^→ = (1, b, b, 1), p_b^→ = (a, 1, c, 1), p_c^→ = (1, 1, 1, 1), p₁^→ = (a, b, c, 1).

We can verify the following:

p_a^→ * p_a^→ = p_a^→, p_a^→ * p_b^→ = (1, 1, b, 1), p_a^→ * p_c^→ = p_c^→, p_a^→ * p₁^→ = p_a^→;

p_b^→ * p_a^→ = p_c^→, p_b^→ * p_b^→ = p_b^→, p_b^→ * p_c^→ = p_c^→, p_b^→ * p₁^→ = p_b^→;

p_c^→ * p_a^→ = p_c^→, p_c^→ * p_b^→ =p_c^→, p_c^→ * p_c^→ =p_c^→, p_c^→ * p₁^→ = p_c^→;

p₁^→ * p_a^→ = p_a^→, p₁^→ * p_b^→ = p_b^→, p₁^→ * p_c^→ = p_c^→, p₁^→ * p₁^→ = p₁^→.

Denote p_ab^→ = p_a^→ * p_b^→ = (1, 1, b, 1), then p_ab^→ * p_a^→ = p_c^→, p_ab^→ * p_b^→ = p_ab^→, p_ab^→ * p_ab^→ = p^→, p_ab^→ * p_c^→ = p_c^→. Hence, M^→(X) = {p_a^→, p_b^→, p_ab^→, p_c^→, p₁^→} and its Cayley table is

Table 15. Pseudo BE-algebra and adjoint semigroups (3).

*	pa→	pb→	pab→	pc→	p1→
pa→	pa→	pab→	pab→	pc→	pa→
pb→	pc→	pb→	pc→	pc→	pb→
pab→	pc→	pab→	pc→	pc→	pab→
pc→	pc→	pc→	pc→	pc→	pc→
p1→	pa→	pb→	pab→	pc→	p1→

. Obviously, (M^→(X), *) is a non-commutative semigroup, but it is not a neutrosophic triplet group.

Similarly, we can verify that

p_a^⇝ = (1, b, c, 1), p_b^⇝ = (a, 1, a, 1), p_c^⇝ = (1, 1, 1, 1), p₁^⇝ = (a, b, c, 1).

p_a^⇝ * p_a^⇝ = p_a^⇝, p_a^⇝ * p_b^⇝ = p_a^⇝ * p_c^⇝ = (1, 1, 1, 1), p_a^⇝ * p₁^⇝ = p_a^⇝;

p_b^⇝ * p_a^⇝ = (1, 1, a, 1), p_b^⇝ * p_b^⇝ = p_b^⇝, p_b^⇝ * p_c^⇝ = p_c^⇝, p_b^⇝ * p₁^⇝ = p_b^⇝;

p_c^⇝ * p_a^⇝ = p_c^⇝, p_c^⇝ * p_b^⇝ = p_c^⇝, p_c^⇝ * p_c^⇝ = p_c^⇝, p_c^⇝ * p₁^⇝ = p_c^⇝.

Denote p_ba^⇝ = p_b^⇝ * p_a^⇝ = (1, 1, a, 1), then p_ba^⇝ * p_a^⇝ = p_ba^⇝, p_a^⇝ * p_ba^⇝ = p_c^⇝; p_ba^⇝ * p_b^⇝ = p_c^⇝, p_b^⇝ * p_ba^⇝ = p_ba^⇝; p_ba^⇝ * p_ba^⇝ = p_c^⇝; p_ba^⇝ * p_c^⇝ = p_c^⇝, p_c^⇝ * p_ba^⇝ = p_c^⇝. Hence, M^⇝(X) = {p_a^⇝, p_b^⇝, p_ba^⇝, p_c^⇝, p₁^⇝} and its Cayley table is

Table 16. Pseudo BE-algebra and adjoint semigroups (4).

*	pa⇝	pb⇝	pba⇝	pc⇝	p1⇝
pa⇝	pa⇝	pc⇝	pc⇝	pc⇝	pa⇝
pb⇝	pba⇝	pb⇝	pba⇝	pc⇝	pb⇝
pba⇝	pba⇝	pc⇝	pc⇝	pc⇝	pba⇝
pc⇝	pc⇝	pc⇝	pc⇝	pc⇝	pc⇝
p1⇝	pa⇝	pb⇝	pba⇝	pc⇝	p1⇝

. Obviously, (M^⇝(X), *) is a non-commutative semigroup, but it is not a neutrosophic triplet group.

Now, we consider M(X). Since

p_c^→ = (1, 1, 1, 1) = p_c^⇝, p₁^→ = (a, b, c, 1) = p₁^⇝;

p_a^→ * p_a^⇝ = p_a^→, p_a^⇝ * p_a^→ = p_a^→;

p_a^→ * p_b^⇝ = (1, 1, 1, 1) = p_c^→, p_b^⇝ * p_a^→ = (1, 1, 1, 1) = p_c^→;

p_a^⇝ * p_b^→= p_b^→ * p_a^⇝ = (1, 1, c, 1);

p_a^⇝ * p_ab^→ = p_ab^→, p_ab^→ * p_a^⇝ = p_ab^→; p_b^→ * p_b^⇝ = p_b^⇝, p_b^⇝ * p_b^→ = p_b^⇝;

p_ab^→ * p_b^⇝ = (1, 1, 1, 1) = p_c^→, p_b^⇝ * p_ab^→ = (1, 1, 1, 1) = p_c^→;

p_a^→ * p_ba^⇝ = (1, 1, 1, 1) = p_c ^→, p_ba^⇝ * p_a^→ = (1, 1, 1, 1) = p_c^→;

p_b^→ * p_ba^⇝ = p_ba^⇝, p_ba^⇝ * p_b^→ = p_ba^⇝ ;

p_ab^→ * p_ba^⇝ = (1, 1, 1, 1) = p_c^→, p_ba^⇝ * p_ab^→ = (1, 1, 1, 1) = p_c^→.

Denote p = (1, 1, c, 1), then M(X) = {p_a^→, p_a^⇝, p_b ^→, p_b^⇝, p_ab ^→, p_ba^⇝, p, p_c ^→, p₁^→}, and

Table 17. Pseudo BE-algebra and adjoint semigroups (5).

*	pa→	pa⇝	pb→	pb⇝	pab→	pba⇝	p	pc→	p1→
pa→	pa→	pa→	pab→	pc→	pab→	pc→	pab→	pc→	pa→
pa⇝	pa→	pa⇝	p	pc→	pab→	pba⇝	p	pc→	pa⇝
pb→	pc→	p	pb→	pb⇝	pc→	pba⇝	p	pc→	pb→
pb⇝	pc→	pba⇝	pb⇝	pb⇝	pc→	pba⇝	pba⇝	pc→	pb⇝
pab→	pc→	pab→	pab→	pc→	pc→	pc→	pab→	pc→	pab→
pba⇝	pc→	pba⇝	pba⇝	pc→	pc→	pc→	pba⇝	pc→	pba⇝
p	pc→	p	p	pc→	pc→	pc→	p	pc→	p
pc→	pc→	pc→	pc→	pc→	pc→	pc→	pc→	pc→	pc→
p1→	pa→	pa⇝	pb→	pb⇝	pab→	pba⇝	p	pc→	p1→

is its Cayley table (it is a non-commutative semigroup, but it is not a neutrosophic triplet group).

The following example shows that the adjoint semigroups of a pseudo BE-algebra may be a commutative neutrosophic triplet group.

Example 11.

Let X= {a, b, c, d, 1}. Define operations → and ⇝ on X as

Table 18. Pseudo BE-algebra and commutative neutrosophic triplet groups (1).

→	a	b	c	d	1
a	1	c	c	1	1
b	d	1	1	d	1
c	d	1	1	d	1
d	1	c	c	1	1
1	a	b	c	d	1

and

Table 19. Pseudo BE-algebra and commutative neutrosophic triplet groups (2).

⇝	a	b	c	d	1
a	1	b	c	1	1
b	d	1	1	d	1
c	d	1	1	d	1
d	1	b	c	1	1
1	a	b	c	d	1

. Then, (X; →, ⇝, 1) is a pseudo BE-algebra, as well as the following:

p_a^→ = (1, c, c, 1, 1), p_b^→ = (d, 1, 1, d, 1), p_c^→ = (d, 1, 1, d, 1), p_d^→ = (1, c, c, 1, 1), p₁^→ = (a, b, c, d, 1).

We can verify the following:

p_a^→ * p_a^→ = p_a^→, p_a^→ * p_b^→ = p_a^→ * p_c^→ = (1, 1, 1, 1, 1), p_a^→ * p_d^→ = p_a^→, p_a^→ * p₁^→ = p_a^→;

p_b^→ * p_a^→ = (1, 1, 1, 1, 1), p_b^→ * p_b^→ = p_b^→ * p_c^→ =p_b^→, p_b^→ * p_d^→ = (1, 1, 1, 1, 1), p_b^→ * p₁^→ = p_b^→;

p_c^→ * p_a^→ = (1, 1, 1, 1, 1), p_c^→ * p_b^→ = p_c^→ * p_c^→ =p_c^→, p_c^→ * p_d^→ = (1, 1, 1, 1, 1), p_c^→ * p₁^→ = p_b^→;

p_d^→ * p_a^→ = p_d^→, p_d^→ * p_b^→ = p_d^→ * p_c^→ = (1, 1, 1, 1, 1), p_d^→ * p_d^→ = p_d^→, p_d^→ * p₁^→ = p_d^→.

Denote p_ab^→ = p_a^→ * p_b^→ = (1, 1, 1, 1, 1), then p_ab^→ * p_a^→ = p_ab^→ * p_b^→ = p_ab^→ * p_c^→ = p_ab^→ * p_d^→ = p_ab^→ * p_ab^→ = p_ab^→ * p₁^→ = p_ab^→. Hence, M^→(X) = {p_a^→, p_b^→, p_ab^→, p₁^→} and its Cayley table is

Table 20. Pseudo BE-algebra and commutative neutrosophic triplet groups (3).

*	pa→	pb→	pab→	p1→
pa→	pa→	pab→	pab→	pa→
pb→	pab→	pb→	pab→	pb→
pab→	pab→	pab→	pab→	pab→
p1→	pa→	pb→	pab→	p1→

. Obviously, (M^→(X), *) is a commutative neutrosophic triplet group.

Similarly, we can verify the following:

p_a^⇝ = (1, b, c, 1, 1), p_b^⇝ = (d, 1, 1, d, 1), p_c^⇝ = (d, 1, 1, d, 1), p_d^⇝ = (1, b, c, 1, 1), p₁^⇝ = (a, b, c, d, 1).

p_a^⇝ * p_a^⇝ = p_a^⇝, p_a^⇝ * p_b^⇝ = p_a^⇝ * p_c^⇝ = (1, 1, 1, 1, 1), p_a^⇝ * p_d^⇝ = p_a^⇝;

p_b^⇝ * p_a^⇝ = (1, 1, 1, 1, 1), p_b^⇝ * p_b^⇝ = p_b^⇝ * p_c^⇝ = p_b^⇝, p_b^⇝ * p_d^⇝ = (1, 1, 1, 1, 1).

Denote p_ab^⇝ = p_a^⇝* p_b^⇝= (1, 1, 1, 1, 1), then M^⇝(X) = {p_a^⇝, p_b^⇝, p_ab^⇝, p₁^⇝} and its Cayley table is

Table 21. Pseudo BE-algebra and commutative neutrosophic triplet groups (4).

*	pa⇝	pb⇝	pab⇝	p1⇝
pa⇝	pa⇝	pab⇝	pab⇝	pa⇝
pb⇝	pab⇝	pb⇝	pab⇝	pb⇝
pab⇝	pab⇝	pab⇝	pab⇝	pab⇝
p1⇝	pa⇝	pb⇝	pab⇝	p1⇝

. Obviously, (M^⇝(X), *) is a commutative neutrosophic triplet group.

Now, we consider M(X). Since the following:

p_b^→ = p_c^→ = (d, 1, 1, d, 1) = p_b^⇝ = p_c^⇝, p_a^→ = p_d^→ = (1, c, c, 1, 1), p_a^⇝ = p_d^⇝ = (1, b, c, 1, 1);

p_a^→ * p_a^⇝ = p_a^→, p_a^⇝ * p_a^→ = p_a^→; p_a^→ * p_b^⇝ = (1, 1, 1, 1, 1) = p_ab ^→ = p_ab^⇝, p_b^⇝ * p_a^→ = (1, 1, 1, 1, 1).

Hence, M(X) = {p_a^→, p_a^⇝, p_b ^→, p_ab ^→, p₁^→}, and

Table 22. Pseudo BE-algebra and commutative neutrosophic triplet groups (5).

*	pa→	pa⇝	pb→	pab→	p1→
pa→	pa→	pa→	pab→	pab→	pa→
pa⇝	pa→	pa⇝	pab→	pab→	pa⇝
pb→	pab→	pab→	pb→	pab→	pb→
pab→	pab→	pab→	pab→	pab→	pab→
p1→	pa→	pa⇝	pb→	pab→	p1→

is its Cayley table (it is a commutative neutrosophic triplet group).

Remark 3.

Through the discussions of Examples 10 and 11 above, we get the following important revelations: (1) (M^→(X), *), (M^⇝(X), *), and (M(X), *) are usually three different semi-groups; (2) (M^→(X), *) and (M^⇝(X), *) are all sub-semi-groups of (M(X), *), which can also be proved from their definitions; (3) (M^→(X), *), (M^⇝(X), *), and (M(X), *) may be neutrosophic triplet groups. Under what circumstances they will become neutrosophic triplet groups, will be examined in the next study.

6. Conclusions

In this paper, the concepts of neutrosophic triplet loops (groups) are further generalized, and some new concepts of generalized neutrosophic triplet structures are proposed, including (l-l)-type, (l-r)-type, (r-l)-type, (r-r)-type, (l-lr)-type, (r-lr)-type, (lr-l)-type, and (lr-r)-type quasi neutrosophic triplet loops (groups), and their basic properties are discussed. In particular, as a corollary of these new properties, an important result is proved. For any commutative neutrosophic triplet group, its every element has only one neutral element. At the same time, the BE-algebras and its various extensions (including CI-algebras, pseudo BE-algebras, and pseudo CI-algebras) have been studied, and some related generalized neutrosophic triplet structures that are contained in these algebras are presented. Moreover, the concept of adjoint semigroups of (generalized) BE-algebras are proposed for the first time, abundant examples are given, and some new results are obtained.