Next Article in Journal
Fractional Integration and Differentiation of the Generalized Mathieu Series
Next Article in Special Issue
Factorization of Graded Traces on Nichols Algebras
Previous Article in Journal
An Evaluation of ARFIMA (Autoregressive Fractional Integral Moving Average) Programs

Metrics 0

## Export Article

Axioms 2017, 6(3), 17; doi:10.3390/axioms6030017

Article
An Independent Set of Axioms of MV-Algebras and Solutions of the Set-Theoretical Yang–Baxter Equation
Tahsin Oner 1, Ibrahim Senturk 1,* and Gulsah Oner 2
1
Department of Mathematics, Ege University, İzmir 35100, Turkey
2
Multidisciplinary Vocational School Technical Programme, Dokuz Eylul University, İzmir 35210, Turkey
*
Correspondence: Tel.: +90-232-311-2317
Received: 3 May 2017 / Accepted: 20 June 2017 / Published: 22 June 2017

## Abstract

:
The aim of this paper is to give a new equivalent set of axioms for MV-algebras, and to show that the axioms are independent. In addition to this, we handle Yang–Baxter equation problem. In conclusion, we construct a new set-theoretical solution for the Yang–Baxter equation by using MV-algebras.
Keywords:
MV-algebras; equivalence of set of axioms; independence; Yang–Baxter equation

## 1. Introduction

An axiomatic system is composed of a certain undefined or primitive term (or terms) together with a set of statements which are called axioms. Axioms are presupposed to be true. A theorem is any statement that can be deduced from the axioms by using inference rules. So, when an axiomatic system is given, a natural question arises: are its axioms independent? For instance, independence of the Axiom of Choice from Zermelo–Fraenkel set theory’s axioms took many decades to be confirmed.
An independent axiomatization of any set of formulas from propositional or predicate logic was difficult to settle down. Many logicians have tried to undertake a solution, but they failed. The first partial success for countable sets was obtained by Tarski [1]. Kreisel [2] worked through research on independent recursive axiomatization.
A set of sentences $Γ$ is $independent$ if for all $φ ∈ Γ$, $φ$ is not a logical consequence of $Γ − { φ }$, or equivalently, if there is a model of $( Γ − { φ } ) ∪ { ¬ φ }$, where ¬ is the negation operation.
To show that a given finite set of formulas ${ F 1 , F 2 , . . . , F n }$ is independent, it is sufficient to find an assignment of truth values that satisfies all the formulas $F j$ for each $1 ≤ i ≤ n$, where $j ≠ i$, and that does not satisfy $F i$. On the contrary, to demonstrate that it is not independent, one shows that one of the formulas $F i$ is a consequence of the other formulas.
Two sets of formulas are said to be $equivalent$ if any formula of one set is a consequence of the other set, and conversely.
Oner and Terziler [3] have exemplified the situation by considering axioms for Boolean algebras; the proof of independence is obtained by using model forming. Additionally, Chajda and Kolaŕík [4] have proved that the axioms of basic algebras given in Chajda and Emanovský [5] are not independent.
Here, we consider MV-algebras which were originally introduced by Chang [6] and further developed by Chang [7]. A simplified axiomatization of MV-algebras in use today can be found in the monograph Algebraic Foundations of Many-valued Reasoning [8].
Definition 1.
[8] An $MV − algebra$ is an algebra $A = ( A , ⊕ , ¬ , 0 )$ satisfying the following axioms (where A is a nonempty set,is a binary operation on A, ¬ is a unary operation on A, and 0 is a constant element of A):
• $( M V 1 )$ $x ⊕ 0 = x$
• $( M V 2 )$ $¬ ¬ x = x$
• $( M V 3 )$ $x ⊕ y = y ⊕ x$
• $( M V 4 )$ $( x ⊕ y ) ⊕ z = x ⊕ ( y ⊕ z )$
• $( M V 5 )$ $¬ ( ¬ x ⊕ y ) ⊕ y = ¬ ( ¬ y ⊕ x ) ⊕ x$
• $( M V 6 )$ $x ⊕ ¬ 0 = ¬ 0$.
In [9,10], this axiomatic system for $M V −$algebras was shown not to be independent. Moreover, M. Kolaŕík [10] proved that if the commutativity axiom is omitted in the above set of axiomatic system, the remaining axioms are independent.
On the other hand, firstly used in theoretical physics [11] and statistical mechanics [12,13,14], the Yang–Baxter equation has received more and more attention from researchers in a wide range of disciplines in the last years. Intending to apply the Yang–Baxter equation to individual works with different aspects from theoretical to practical in almost all sciences, technology, and industry, researchers have found uncountable and varied applications of this equation in fields such as link invariants, quantum computing, quantum groups, braided categories, knot theory, the analysis of integrable systems, quantum mechanics, etc. ([15,16]). In addition to these, one of the areas which the Yang–Baxter equation was practised is pure mathematics, and there have been many studies in this field, as in other areas. Several researchers have benefited from the axioms of various algebraic structures to solve this equation. Since it is well known that $M V −$algebras which provide an algebraic proof of the completeness theorem of infinite-valued Logics (or ukasiewicz logics) are important algebraic tools to study in quantum structures, set-theoretical solutions for the Yang–Baxter equation could be examined in $M V −$algebras.
In this paper, we give some theorems in $M V −$algebras and obtain an equivalent set of axioms for $M V −$algebras in Section 2. In Section 3, we prove the independence of this equivalent set of axioms. In the last section, we find some solutions of the set-theoretical Yang–Baxter equation in $M V −$algebras.

## 2. An Equivalent Set of Axioms for MV-Algebras

In this section, we introduce a modified set of axioms for $M V −$algebras. To this end, we add a new axiom and remove axioms $( M V 1 )$ and $( M V 6 )$ from the above axiomatization of $M V −$algebras, and we prove that these two sets of axioms are equivalent to each other.
Theorem 1.
Let $A = ( A , ⊕ , ¬ , 0 )$ be an $M V −$algebra. Then, there exists a unique element $y = 0 ∈ A$ such that $y ⊕ x = x$ for all $x ∈ A$.
Proof.
By using $( M V 1 )$ and $( M V 3 )$, there exists a $0 ∈ A$ such that $0 ⊕ x = x$ for all $x ∈ A$. For the uniqueness of this element, we take $x = 0$. Then, by the hypothesis:
$y ⊕ 0 = 0 ,$
and since $( M V 1 )$ implies that $y ⊕ 0 = y$, we have
$y = 0 .$
For $x = 0$, the solution set of y contains only 0. In that case, the intersection sets of y solution values which verify this equation also contains 0. Thus, $y = 0$ is the unique element of A which holds $y ⊕ x = x$ for all $x ∈ A$. ☐
Theorem 2.
Let $A = ( A , ⊕ , ¬ , 0 )$ be an $M V −$algebra. Then
$∀ x ∈ A , x ⊕ y = x ⇔ y = 0 .$
Proof.
Necessity: It is clear by $( M V 3 )$ and Theorem 1.
Sufficiency: It follows from $( M V 1 )$. ☐
Theorem 3.
$A = ( A , ⊕ , ¬ , 0 )$ is an $M V −$algebra if and only if it satisfies the following axioms:
• $( M V 1 ′ )$ $x ⊕ y = y ⇔ x = 0$
• $( M V 2 )$ $¬ ¬ x = x$
• $( M V 3 )$ $x ⊕ y = y ⊕ x$
• $( M V 4 )$ $( x ⊕ y ) ⊕ z = x ⊕ ( y ⊕ z )$
• $( M V 5 )$ $¬ ( ¬ x ⊕ y ) ⊕ y = ¬ ( ¬ y ⊕ x ) ⊕ x$.
Proof.
Necessity follows from Theorem 1 and [10]. For sufficiency, we have to show that the axioms $( M V 1 )$ and $( M V 6 )$ follow from the axioms in Theorem 3. We have $0 ⊕ x = x$ by $( M V 1 ′ )$. For $( M V 1 )$, it follows from $( M V 3 )$ that $0 ⊕ x = x = x ⊕ 0$. Now, we give a deduction of $( M V 6 )$ as follows:
$¬ x ⊕ 0 = ¬ x ( by ( M V 1 ) ) ⇒ ¬ ( ¬ x ⊕ 0 ) = ¬ ¬ x ⇒ ¬ ( ¬ x ⊕ 0 ) = x ( by ( M V 2 ) ) ⇒ ¬ ( ¬ x ⊕ 0 ) ⊕ 0 = x ⊕ 0 = x ( by ( M V 1 ) ) ⇒ ¬ ( ¬ 0 ⊕ x ) ⊕ x = x ( by ( M V 5 ) ) ⇒ ¬ ( ¬ 0 ⊕ x ) = 0 ( by ( M V 1 ′ ) ) ⇒ ¬ ¬ ( ¬ 0 ⊕ x ) = ¬ 0 ⇒ ¬ 0 ⊕ x = ¬ 0 ( by ( M V 2 ) ) ⇒ x ⊕ ¬ 0 = ¬ 0 ( by ( M V 3 ) ) .$
Therefore, the set of axioms $( M V 1 ′ ) − ( M V 5 )$ is an equivalent set of axioms for $M V$-algebras.  ☐

## 3. Proof of the Independence of the Equivalent Set of Axioms

Theorem 4.
The axioms $( M V 1 ′ )$, $( M V 2 )$, $( M V 3 )$, $( M V 4 )$, and $( M V 5 )$ are independent.
Proof.
To prove this claim, we construct a model for each axiom in which this axiom is false while the others are true. Let $M$ be our model with the universe $U = { 0 , 1 , 2 }$. The symbols $⊕ M$, $¬ M$, and $0 M$ are interpreted as a binary operation, a unary operation, and a constant, respectively. Let $A = ( { 0 , 1 , 2 } , ⊕ , ¬ , 0 )$ be an algebra whose operations are defined as in the following tables:
(1)
Independence of $( M V 1 ′ )$:
We can define the operations $⊕ M$ and $¬ M$ as in the Table 1:
The algebra $A$ is not a model for $( M V 1 ′ )$ because, if we choose $x = 0$ and $y = 1$, we obtain $x ⊕ y = 0 ⊕ 1 = 0$, which is a contradiction with $( M V 1 ′ )$. Clearly, the algebra $A$ satisfies $( M V 2 )$ and $( M V 3 )$. To see that $( M V 4 )$ and $( M V 5 )$ are satisfied by the algebra $A$, it is sufficient to consider the following:
For $( M V 4 )$:
(i)
If $x = 0$, then $0 ⊕ ( y ⊕ z ) = 0 = ( 0 ⊕ y ) ⊕ z$.
(ii)
If $x = 1$, then $1 ⊕ ( y ⊕ z ) = ( 1 ⊕ y ) ⊕ z$ is true.
(iii)
If $x = 2$, then $2 ⊕ ( y ⊕ z ) = ( 2 ⊕ y ) ⊕ z$ is also true.
As for $( M V 5 )$:
(i)
If $y = 0$, then $¬ ( ¬ x ⊕ 0 ) ⊕ 0 = 0 = ¬ ( ¬ 0 ⊕ x ) ⊕ x$.
(ii)
If $y = 1$, then $¬ ( ¬ x ⊕ 1 ) ⊕ 1 = ¬ ( ¬ 1 ⊕ x ) ⊕ x$. It can be checked from the operations in Table 1 that the equation holds for $y = 1$.
(iii)
If $y = 2$, then $¬ ( ¬ x ⊕ 2 ) ⊕ 2 = ¬ ( ¬ 2 ⊕ x ) ⊕ x$. It can be also controlled from the operations in Table 1 that the equation holds for $y = 2$.
(2)
Independence of $( M V 2 )$:
The operations $⊕ M$ and $¬ M$ are defined as in the Table 2:
The algebra $A$ satisfies $( M V 1 ′ )$, $( M V 3 )$, $( M V 4 )$, $( M V 5 )$ but not $( M V 2 )$ because $¬ ¬ 0 ≠ 0$.
(3)
Independence of $( M V 3 )$:
The operations $⊕ M$ and $¬ M$ are defined as in the Table 3:
The algebra $A$ satisfies $( M V 1 ′ )$, $( M V 2 )$, $( M V 4 )$, $( M V 5 )$, but not $( M V 3 )$ because $0 ⊕ 2 = 2$ but $2 ⊕ 0 = 1$.
(4)
Independence of $( M V 4 )$:
The operations $⊕ M$ and $¬ M$ are defined as in the Table 4:
The algebra $A$ satisfies $( M V 1 ′ )$, $( M V 2 )$, $( M V 3 )$, $( M V 4 )$, but not $( M V 5 )$ because $( 1 ⊕ 1 ) ⊕ 2 = 1$ but $( 1 ⊕ 1 ) ⊕ 2 = 2$. So, $( 1 ⊕ 1 ) ⊕ 2 ≠ 1 ⊕ ( 1 ⊕ 2 )$.
(5)
Independence of $( M V 5 )$:
The operations $⊕ M$ and $¬ M$ are defined as in the Table 5:
The algebra $A$ satisfies $( M V 1 ′ )$, $( M V 2 )$, $( M V 3 )$, $( M V 5 )$, but not $( M V 4 )$, because $¬ ( ¬ 0 ⊕ 2 ) ⊕ 2 = 1$ but $¬ ( ¬ 2 ⊕ 0 ) ⊕ 0 = 2$. So, $¬ ( ¬ 0 ⊕ 2 ) ⊕ 2 ≠ ¬ ( ¬ 2 ⊕ 0 ) ⊕ 0 = 2$. ☐

## 4. Solutions of the Yang–Baxter Equation in MV-Algebras

Firstly used in theoretical physics by C.N. Yang and in statistical mechanics by R.J. Baxter almost fifty years ago, the Yang–Baxter equation has been studied as the master equation in integrable models in statistical mechanics and quantum field theory. Recent progress in other fields such as $C * −$ algebras, Hopf algebras, simple Lie algebras, representation theory, conformal field theory, etc. shed light on the significance of the equation, and has drawn attention among many researchers which have used the axioms of these algebraic structures in order to solve this equation.
In this section, we present solutions of the set-theoretical Yang–Baxter equation in $M V −$algebras. Let k be a field and tensor products be defined over the field k. For V a k-space, we denote by $τ : V ⊗ V → V ⊗ V$ the twist map defined by $τ ( v ⊗ w ) = w ⊗ v$ and by $I : V → V$ the identity map of the space V; for $R : V ⊗ V → V ⊗ V$ a $k −$linear map, let $R 12 = R ⊗ I$, $R 23 = I ⊗ R$, and $R 13 = ( I ⊗ τ ) ( R ⊗ I ) ( τ ⊗ I )$.
Definition 2.
[16] A Yang–Baxter operator is $k −$linear map $R : V ⊗ V → V ⊗ V$, which is invertible, and it satisfies the braid condition (called the Yang–Baxter equation):
$R 12 ∘ R 23 ∘ R 12 = R 23 ∘ R 12 ∘ R 23 .$
If R satisfies Equation (1), then both $R ∘ τ$ and $τ ∘ R$ satisfy the quantum Yang–Baxter equation (QYBE):
$R 12 ∘ R 13 ∘ R 23 = R 23 ∘ R 13 ∘ R 12 .$
Lemma 1.
[16] Equations (1) and (2) are equivalent to each other.
To establish a relation between the set-theoretical Yang–Baxter equation and $M V −$algebras, we need the following definition.
Definition 3.
[16] LetX be a set and $S : X × X → X × X$, $S ( u , v ) = ( u ′ , v ′ )$ be a map. The map S is a solution for the set-theoretical Yang–Baxter equation if it satisfies the following equation:
$S 12 ∘ S 23 ∘ S 12 = S 23 ∘ S 12 ∘ S 23 ,$
which is also equivalent
$S 12 ∘ S 13 ∘ S 23 = S 23 ∘ S 13 ∘ S 12 ,$
where
$S 12 : X × X × X → X × X × X , S 12 ( u , v , w ) = ( u ′ , v ′ , w ) , S 23 : X × X × X → X × X × X , S 23 ( u , v , w ) = ( u , v ′ , w ′ ) , S 13 : X × X × X → X × X × X , S 13 ( u , v , w ) = ( u ′ , v , w ′ ) .$
Now, we give a new method to construct solutions of the set theoretical Yang–Baxter equation by using $M V −$algebras.
Lemma 2.
Let $( A , ⊕ , ¬ , 0 )$ be an $M V −$algebra. Then, $S ( x , y ) = ( x ⊕ y , 0 )$ is a solution of the set-theoretical Yang–Baxter equation.
Proof.
Let $S 12$ and $S 23$ be defined as follows:
$S 12 ( x , y , z ) = ( x ⊕ y , 0 , z ) , S 23 ( x , y , z ) = ( x , y ⊕ z , 0 ) .$
We verify the equality $S 12 ∘ S 23 ∘ S 12 = S 23 ∘ S 12 ∘ S 23$ for all $( x , y , z ) ∈ A × A × A$. By using $( M V 1 ′ )$ and $( M V 4 )$, we get
$( S 12 ∘ S 23 ∘ S 12 ) ( x , y , z ) = S 12 ( S 23 ( S 12 ( x , y , z ) ) ) = S 12 ( S 23 ( x ⊕ y , 0 , z ) = S 12 ( x ⊕ y , 0 ⊕ z , 0 ) = S 12 ( x ⊕ y , z , 0 ) ) = ( ( x ⊕ y ) ⊕ z , 0 , 0 ) = ( x ⊕ ( y ⊕ z ) , 0 , 0 ) = ( x ⊕ ( y ⊕ z ) , 0 ⊕ 0 , 0 ) = S 23 ( x ⊕ ( y ⊕ z ) , 0 , 0 ) = S 12 ( S 23 ( x , y ⊕ z , 0 ) ) = ( S 23 ∘ S 12 ∘ S 23 ) ( x , y , z ) .$
Hence $S ( x , y ) = ( x ⊕ y , 0 )$ is a solution of the set-theoretical Yang–Baxter equation in $M V −$algebras. ☐
Lemma 3.
Let $( A , ⊕ , ¬ , 0 )$ be an $M V −$algebra. Then, $S ( x , y ) = ( ¬ y , ¬ x )$ is a solution of the set-theoretical Yang–Baxter equation.
Proof.
We define $S 12$ and $S 23$ as follows:
$S 12 ( x , y , z ) = ( ¬ y , ¬ x , z ) , S 23 ( x , y , z ) = ( x , ¬ z , ¬ y ) .$
We show that the equality $S 12 ∘ S 23 ∘ S 12 = S 23 ∘ S 12 ∘ S 23$ holds for all $( x , y , z ) ∈ A × A × A$. By using $( M V 2 )$, we attain
$( S 12 ∘ S 23 ∘ S 12 ) ( x , y , z ) = S 12 ( S 23 ( S 12 ( x , y , z ) ) ) = S 12 ( S 23 ( ¬ y , ¬ x , z ) = S 12 ( ¬ y , ¬ z , ¬ ¬ x ) = S 12 ( ¬ y , ¬ z , x ) ) = ( ¬ ¬ z , ¬ ¬ y , x ) = ( z , y , x )$
and
$( S 23 ∘ S 12 ∘ S 23 ) ( x , y , z ) = S 23 ( S 12 ( S 23 ( x , y , z ) ) ) = S 23 ( S 12 ( x , ¬ z , ¬ y ) = S 23 ( ¬ ¬ z , ¬ x , ¬ y ) = S 23 ( z , ¬ x , ¬ y ) ) = ( z , ¬ ¬ y , ¬ ¬ x ) = ( z , y , x ) .$
Thus, $S ( x , y ) = ( ¬ y , ¬ x )$ is a solution of the set-theoretical Yang–Baxter equation in $M V −$algebras. ☐
Definition 4.
[8] Let A be an $M V −$algebra.The binary relation ≤ defined on A as below
$x ≤ y i f a n d o n l y i f ¬ x ⊕ y = 1$
is a partial order on A. It is called the natural order of A.
Proposition 1.
[8] Let A be an $M V −$algebra with the natural order. If the join and the meet operators are defined as below:
then the natural order determines a lattice structure on A.
Lemma 4.
[8] Any $M V −$algebra A is a Boolean algebra if and only if the operationis idempotent on A.
Lemma 5.
[17] Let $( A , ∨ , ∧ , 0 , 1 , ¬ )$ be a Boolean algebra. Then $S ( x , y ) = ( x ∨ y , x ∧ y )$ is a solution of the set-theoretical Yang–Baxter equation.
Proposition 2.
Let $( A , ⊕ , ¬ , 0 )$ be an $M V −$algebra. If the identities $¬ ( ¬ ( x ⊕ y ) ⊕ ¬ z ) = ¬ ( ¬ x ⊕ ¬ z ) ⊕ ¬ ( ¬ y ⊕ ¬ z )$ or $¬ ( ¬ x ⊕ ¬ y ) ⊕ z = ¬ ( ¬ ( x ⊕ z ) ⊕ ¬ ( y ⊕ z ) )$ are satisfied for all $x , y , z ∈ A$, then
are solutions for the set-theoretical Yang–Baxter equation in $M V −$algebra A.
Proof.
Assume that $¬ ( ¬ ( x ⊕ y ) ⊕ ¬ z ) = ¬ ( ¬ x ⊕ ¬ z ) ⊕ ¬ ( ¬ y ⊕ ¬ z )$ or $¬ ( ¬ x ⊕ ¬ y ) ⊕ z = ¬ ( ¬ ( x ⊕ z ) ⊕ ¬ ( y ⊕ z ) )$ holds for all $x , y , z ∈ A$. Now substituting $[ x : = 1 , y : = 1 ]$ or $[ x : = 0 , y : = 0 ]$ in these identities, respectively, we get $z = z ⊕ z$ or $¬ z = ¬ z ⊕ ¬ z$ for all $z ∈ A$. Then, the operation ⊕ is idempotent on A and so by Lemma 4, A is a Boolean algebra. From the definitions of meet and join operators, we obtain $S ( x , y ) = ( ¬ ( ¬ x ⊕ y ) ⊕ y , ¬ ( ¬ x ⊕ ¬ ( ¬ x ⊕ y ) ) ) = ( x ∨ y , x ∧ y )$. Therefore, $S ( x , y ) = ( ¬ ( ¬ x ⊕ y ) ⊕ y , ¬ ( ¬ x ⊕ ¬ ( ¬ x ⊕ y ) ) )$ is a solution of the Yang–Baxter equation in $M V −$algebra A from Lemma 5. In addition, since the operation is idempotent, we have $( ¬ ( ¬ x ⊕ y ) ⊕ y , ¬ ( ¬ x ⊕ ¬ ( ¬ x ⊕ y ) ) ) = ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) )$. Hence, $S ( x , y ) = ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) )$ is also a solution of Yang–Baxter equation in $M V −$algebra A. ☐
Lemma 6.
[8] The below equations hold in every $M V −$algebra A:
(i)
$x ⊕ y ⊕ ¬ ( ¬ x ⊕ ¬ y ) = x ⊕ y ,$
(ii)
$¬ ( ¬ x ⊕ y ) ⊕ ¬ ( ¬ ( x ⊕ ¬ y ) ⊕ ¬ y ) = x ,$
(iii)
$¬ ( ¬ x ⊕ ¬ y ) ⊕ ¬ ( ¬ ( x ⊕ y ) ⊕ ¬ z ) = ¬ ( ¬ x ⊕ ¬ z ) ⊕ ¬ ( ¬ ( x ⊕ z ) ⊕ ¬ y ) .$
Munduci et al. [8] needed the following proposition for the proof of the above lemma.
Proposition 3.
[8] The following identity
$¬ ( ¬ x ⊕ ¬ y ) ⊕ ¬ ( ¬ ( x ⊕ y ) ⊕ ¬ z ) = ¬ ( ¬ ( x ⊕ y ) ⊕ ¬ ( ¬ ( ¬ x ⊕ ¬ y ) ⊕ z ) )$
holds for each $M V −$algebra.
Theorem 5.
Let $( A , ⊕ , ¬ , 0 )$ be an $M V −$algebra. Then, $S ( x , y ) = ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) )$ is a solution of the set-theoretical Yang–Baxter equation in $M V −$algebra A.
Proof.
Through the instrumentality of equalities in Lemma 6 and Proposition 3, we obtain the following equalities:
$( S 12 ∘ S 23 ∘ S 12 ) ( x , y , z ) = S 12 ( S 23 ( S 12 ( x , y , z ) ) ) = S 12 ( S 23 ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) , z ) ) = S 12 ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) ⊕ z , ¬ ( ¬ ¬ ( ¬ x ⊕ ¬ y ) ⊕ ¬ z ) ) = S 12 ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) ⊕ z , ¬ ( ( ¬ x ⊕ ¬ y ) ⊕ ¬ z ) ) = ( ( x ⊕ y ) ⊕ ( ¬ ( ¬ x ⊕ ¬ y ) ⊕ z ) , ¬ ( x ⊕ y ) ⊕ ¬ ( ¬ ( ¬ x ⊕ ¬ y ) ⊕ z ) , ¬ ( ( ¬ x ⊕ ¬ y ) ⊕ ¬ z ) ) = ( ( ( x ⊕ y ) ⊕ ¬ ( ¬ x ⊕ ¬ y ) ) ⊕ z , ¬ ( ¬ ( x ⊕ y ) ⊕ ¬ ( ¬ ( ¬ x ⊕ ¬ y ) ⊕ z ) ) , ¬ ( ( ¬ x ⊕ ¬ y ) ⊕ ¬ z ) ) = ( x ⊕ y ⊕ z , ¬ ( ¬ ( x ⊕ y ) ⊕ ¬ ( ¬ ( ¬ x ⊕ ¬ y ) ⊕ z ) ) , ¬ ( ¬ x ⊕ ¬ y ⊕ ¬ z ) ) ,$
and for the other direction of the set-theoretical Yang baxter equation, we attain
$( S 23 ∘ S 12 ∘ S 23 ) ( x , y , z ) = S 23 ( S 12 ( S 23 ( x , y , z ) ) ) = S 23 ( S 12 ( x , y ⊕ z , ¬ ( ¬ y ⊕ ¬ z ) ) ) = S 23 ( x ⊕ ( y ⊕ z ) , ¬ ( ¬ x ⊕ ¬ ( y ⊕ z ) ) , ¬ ( ¬ y ⊕ ¬ z ) ) = ( x ⊕ ( y ⊕ z ) , ¬ ( ¬ x ⊕ ¬ ( y ⊕ z ) ) ⊕ ¬ ( ¬ y ⊕ ¬ z ) , ¬ ( ¬ ¬ ( ¬ x ⊕ ¬ y ⊕ z ) ⊕ ¬ ¬ ( ¬ y ⊕ ¬ z ) ) ) = ( x ⊕ y ⊕ z , ¬ ( ¬ x ⊕ ¬ ( y ⊕ z ) ) ⊕ ¬ ( ¬ y ⊕ ¬ z ) , ¬ ( ( ¬ x ⊕ ¬ ( y ⊕ z ) ) ⊕ ( ¬ y ⊕ ¬ z ) ) ) = ( x ⊕ y ⊕ z , ¬ ( ¬ x ⊕ ¬ ( y ⊕ z ) ) ⊕ ¬ ( ¬ y ⊕ ¬ z ) , ¬ ( ¬ x ⊕ ( ¬ ( y ⊕ z ) ⊕ ( ¬ y ⊕ ¬ z ) ) ) ) = ( x ⊕ y ⊕ z , ¬ ( ¬ x ⊕ ¬ y ) ⊕ ¬ ( ¬ ( x ⊕ y ) ⊕ ¬ z ) , ¬ ( ¬ x ⊕ ¬ y ⊕ ¬ z ) .$
Therefore, $S ( x , y ) = ( x ⊕ y , ¬ ( ¬ x ⊕ ¬ y ) )$ is a solution of the set-theoretical Yang–Baxter equation in $M V −$algebra A. ☐

## Acknowledgments

The authors thank the academic editor for his valuable comments and suggestions and the anonymous referees for his/her remarks which helped them to improve the presentation of the paper.

## Author Contributions

The coauthors, Tahsin Oner, Ibrahim Senturk and Gulsah Oner wrote the paper jointly and contributed equally to this work.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Tarski, A. Logic, Semantics, Metamathematics; The Clarendon Press: Oxford, UK, 1956. [Google Scholar]
2. Kreisel, G. Independent recursive axiomatization. J. Symb. Log. 1957, 22, 109. [Google Scholar]
3. Oner, T.; Terziler, M. Independent of countable sets of formulas of the propositional logic. ARS Comb. 2013, 12, 73–80. [Google Scholar]
4. Chajda, I.; Kolaŕík, M. Independence of the axiomatic system of basic algebras. Soft Comput. 2009, 13, 41–43. [Google Scholar] [CrossRef]
5. Chajda, I.; Emanovský, P. Bounded lattices with antitone involutions and properties of MV-Algebras. Discuss. Math. Gen. Algebra Appll. 2008, 24, 31–42. [Google Scholar] [CrossRef]
6. Chang, C.C. Algebraic analysis of many-valued logics. Trans. Am. Soc. 1958, 88, 467–490. [Google Scholar] [CrossRef]
7. Chang, C.C. A new proof of the completeness of the Łukasiewicz axioms. Trans. Am. Soc. 1958, 93, 74–80. [Google Scholar]
8. Cignoli, R.; D’Ottaviano, I.; Mundici, D. Algebraic Foundations of Many-Valued Reasoning; Kluwer Academic Publishers: Dordrech, The Netherlands, 2000. [Google Scholar]
9. Cattaneo, G. Independent axiomatization of MV-Algebras. Tatra Mt. Math. Publ. 1998, 15, 227–232. [Google Scholar]
10. Kolaŕík, M. Independence of the axiomatic system for MV-Algebras. Math. Slov. 2013, 63, 1–4. [Google Scholar] [CrossRef]
11. Perk, J.H.H.; Au, Y.H. Yang-Baxter Equations. In Encyclopedia of Mathematical Physics; Françoise, J.-P., Naber, G.L., Tsou, S.T., Eds.; Elseiver: Oxford, UK, 2006; Volume 5, pp. 465–473. [Google Scholar]
12. Baxter, R.J. Exactly Solved Models in Statistical Mechanics; Academy Press: London, UK, 1982. [Google Scholar]
13. Baxter, R.J. Partition function of the eight-vertex lattice model. Ann. Phys. 1972, 70, 193–228. [Google Scholar] [CrossRef]
14. Yang, C.N. Some exact results for the many-body problem in one dimension with repulsive delta-function interaction. Phys. Rev. Lett. 1967, 19, 1312–1315. [Google Scholar] [CrossRef]
15. Nichita, F.F. Special Issue “Hopf Algebras, QuantumGroups and Yang–Baxter Equations, 2014”. Available online: http://www.mdpi.com/journal/axioms/special_issues/hopf_algebras_2014 (accessed on 22 June 2017).
16. Nichita, F.F. Yang-Baxter Equations, Computational Methods and Applications. Axioms 2015, 4, 423–435. [Google Scholar] [CrossRef]
17. Nichita, F.F. On the set-theoretical Yang-Baxter equation. Acta Univ. Apulensis Math.-Inf. 2003, 5, 97–100. [Google Scholar]
Table 1. Operations tables for the independence of $( M V 1 ′ )$.
 ⊕ 0 1 2 0 0 0 0 1 0 1 1 2 0 1 1 x 0 1 2 ¬x 0 1 2
Table 2. Operations Tables for Independence of $( M V 2 )$.
 ⊕ 0 1 2 0 0 1 2 1 1 2 2 2 2 2 2 x 0 1 2 ¬x 2 2 2
Table 3. Operations Tables for Independence of $( M V 3 )$.
 ⊕ 0 1 2 0 0 1 2 1 1 1 1 2 1 1 1 x 0 1 2 ¬x 0 1 2
Table 4. Operations tables for the independence of $( M V 4 )$.
 ⊕ 0 1 2 0 0 1 2 1 1 2 1 2 2 1 1 x 0 1 2 ¬x 1 0 2
Table 5. Operations tables for the independence of $( M V 5 )$.
 ⊕ 0 1 2 0 0 1 2 1 1 1 1 2 2 1 1 x 0 1 2 ¬x 2 1 0