mathematics

Article
Some Examples of BL-Algebras Using Commutative Rings
Cristina Flaut 1, * and Dana Piciu 2

1 Faculty of Mathematics and Computer Science, Ovidius University, Bd. Mamaia 124,
900527 Constant, a, Romania
2 Faculty of Science, University of Craiova, A.I. Cuza Street, 13, 200585 Craiova, Romania
* Correspondence: [email protected] or [email protected]

Abstract: BL-algebras are algebraic structures corresponding to Hajek’s basic fuzzy logic. The aim of
this paper is to analyze the structure of BL-algebras using commutative rings. Due to computational
considerations, we are interested in the finite case. We present new ways to generate finite BL-
algebras using commutative rings and provide summarizing statistics. Furthermore, we investigated
BL-rings, i.e., commutative rings whose the lattice of ideals can be equipped with a structure of
BL-algebra. A new characterization for these rings and their connections to other classes of rings is
established. Furthermore, we give examples of finite BL-rings for which the lattice of ideals is not
an MV-algebra and, using these rings, we construct BL-algebras with 2r + 1 elements, r ≥ 2, and
BL-chains with k elements, k ≥ 4. In addition, we provide an explicit construction of isomorphism
classes of BL-algebras of small n size (2 ≤ n ≤ 5).

Keywords: commutative ring; BL-ring; ideal; residuated lattice; MV-algebra; BL-algebra

MSC: 03G10; 03G25; 06A06; 06D05; 08C05; 06F35

Citation: Flaut, C.; Piciu, D. Some

Examples of BL-Algebras Using
Commutative Rings. Mathematics 1. Introduction
2022, 10, 4739. https://doi.org/ The origin of residuated lattices is in mathematical logic. They were introduced by
10.3390/math10244739 Dilworth and Ward, through the papers [1,2]. The study of residuated lattices originated
Academic Editors: Irina Cristea,
in 1930 in the context of the theory of rings, with the study of ring ideals. It is known
Yuriy Rogovchenko, Justo Puerto,
that the lattice of ideals of a commutative ring is a residuated lattice; see [3]. Several
Gintautas Dzemyda and researchers ([3–6], etc.) have been interested in this construction.
Patrick Siarry Two important subvarieties of residuated lattices are BL-algebras (corresponding to
Hajek’s logic; see [7]) and MV-algebras (corresponding to Łukasiewicz’s many-valued
Received: 11 November 2022
logic; see [8,9]). For instance, rings for which the lattice of ideals is a BL-algebra are called
Accepted: 3 December 2022
BL-rings and were introduced in [5].
Published: 13 December 2022
In this paper, we obtain a description for BL-rings using a new characterization of
Publisher’s Note: MDPI stays neutral BL-algebras, given in Theorem 1, i.e., residuated lattices L in which [ x ( x → y)] → z =
with regard to jurisdictional claims in ( x → z) ∨ (y → z) for every x, y, z ∈ L. Then, BL-rings are unitary and commutative rings
published maps and institutional affil- A with the property that K : [ I ⊗ ( J : I )] = (K : I ) + (K : J ), for every I, J, K ∈ Id( A); see
iations. Corollary 1.
Additionally, we show that the class of BL-rings contains other known classes of
commutative rings: rings that are principal ideal domains and some types of finite unitary
commutative rings; see Theorem 2, Corollaries 2 and 3.
Copyright: © 2022 by the authors.
One recent application of BCK algebras is in coding theory. In fact, MV-algebras are
Licensee MDPI, Basel, Switzerland.
commutative BCK-algebras, see [10].
This article is an open access article
Due to computational considerations, in this paper, we are interested in finding ways
distributed under the terms and
to generate finite BL-algebras using finite commutative rings, since a solution that is
conditions of the Creative Commons
Attribution (CC BY) license (https://
computationally tractable is to consider algebras with a small number of elements. First,
creativecommons.org/licenses/by/
we give examples of finite BL-rings whose lattice of ideals is not an MV-algebra. Using
4.0/).

Mathematics 2022, 10, 4739. https://doi.org/10.3390/math10244739 https://www.mdpi.com/journal/mathematics

Mathematics 2022, 10, 4739 2 of 15

these rings, we construct BL-algebras with 2r + 1 elements, r ≥ 2 (see Theorem 3) and

BL-chains with k ≥ 4 elements (see Theorem 4).
In [11], isomorphism classes of BL-algebras of size n ≤ 12 were only counted, not
constructed, using computer algorithms. Up to an isomorphism, there is 1 BL-algebra of
size 2, 2 BL-algebras of size 3, 5 BL-algebras of size 4, 9 BL-algebras of size 5, 20 BL-algebras
of size 6, 38 BL-algebras of size 7, 81 BL-algebras of size 8, 160 BL-algebras of size 9, 326 BL-
algebras of size 10, 643 BL-algebra of size 11 and 1314 BL-algebras of size 12. In Theorem 6,
we present a way to generate (up to an isomorphism) finite BL-algebras with 2 ≤ n ≤ 5
elements by using the ordinal product of residuated lattices, and we present summarizing
statistics. The described method can be used to construct finite BL-algebras of larger size,
the inconvenience being the large number of BL-algebras that must be generated.

2. Preliminaries
Definition 1 ([1,2]). A (commutative) residuated lattice is an algebra ( L, ∧, ∨, , →, 0, 1)
such that:
(LR1) ( L, ∧, ∨, 0, 1) is a bounded lattice;
(LR2) ( L, , 1) is a commutative ordered monoid;
(LR3) z ≤ x → y iff x z ≤ y, for all x, y, z ∈ L.

The property (LR3) is called residuation, where ≤ is the partial order of the lattice
( L, ∧, ∨, 0, 1).
In a residuated lattice, an additional operation is defined; for x ∈ L, we denote
x ∗ = x → 0.

Example 1 ([12]). Let (B , ∧, ∨,0 , 0, 1) be a Boolean algebra. If we define for every x, y ∈ B , x

y = x ∧ y and x → y = x 0 ∨ y, then (B , ∧, ∨, , →, 0, 1) becomes a residuated lattice.

Example 2. It is known that, for a commutative unitary ring A, if we denote by Id( A) the set of
all ideals, then for I, J ∈ Id( A), the following sets

I + J =< I ∪ J >= {i + j, i ∈ I, j ∈ J },
n
I ⊗ J = { ∑ ik jk , ik ∈ I, jk ∈ J },
k =1

( I : J ) = { x ∈ A, x · J ⊆ I },
Ann( I ) = (0 : I ), where 0 =< 0 >,
are also ideals of A, called sum, product, quotient and annihilator; see [13]. If we preserve these
notations, ( Id( A), ∩, +, ⊗ →, 0 = {0}, 1 = A) is a residuated lattice in which the order relation
is ⊆ and I → J = ( J : I ), for every I, J ∈ Id( A); see [6].

In a residuated lattice ( L, ∧, ∨, , →, 0, 1), we consider the following identities:

( prel ) ( x → y) ∨ (y → x ) = 1 (prelinearity);
(div) x ( x → y) = x ∧ y (divisibility).

Definition 2 ([10,12,14]). A residuated lattice L is called a BL-algebra if L verifies ( prel ) + (div)

conditions.

A BL-chain is a totally ordered BL-algebra, i.e., a BL-algebra such that its lattice order
is total.

Definition 3 ([8,9]). An MV-algebra is an algebra ( L, ⊕,∗ , 0) satisfying the following axioms:

(MV1) ( L, ⊕, 0) is an abelian monoid;
Mathematics 2022, 10, 4739 3 of 15

(MV2) ( x ∗ )∗ = x;
(MV3) x ⊕ 0∗ = 0∗ ;
(MV4) ( x ∗ ⊕ y)∗ ⊕ y = (y∗ ⊕ x )∗ ⊕ x, for all x, y ∈ L.

In fact, a residuated lattice L is an MV-algebra iff it satisfies the additional condition:

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

for every x, y ∈ L; see [12].

Remark 1 ([12]). If, in a BL- algebra L, x ∗∗ = x, for every x ∈ L, and for x, y ∈ L we denote

x ⊕ y = (x∗ y∗ )∗ ,

then we obtain an MV-algebra ( L, ⊕,∗ , 0). Conversely, if ( L, ⊕,∗ , 0) is an MV-algebra, then

( L, ∧, ∨, , →, 0, 1) becomes a BL-algebra, in which for x, y ∈ L :

x y = ( x ∗ ⊕ y∗ )∗ ,

x → y = x ∗ ⊕ y, 1 = 0∗ ,
x ∨ y = ( x → y) → y = (y → x ) → x and x ∧ y = ( x ∗ ∨ y∗ )∗ .
In fact, MV-algebras are exactly involutive BL-algebras.

Example 3 ([10]). We give an example of a finite BL-algebra which is not an MV-algebra. Let
L = {0, a, b, c, 1}; we define the following operations on L:

→ 0 c a b 1 0 c a b 1
0 1 1 1 1 1 0 0 0 0 0 0
c 0 1 1 1 1 c 0 c c c c
, .
a 0 b 1 b 1 a 0 c a c a
b 0 a a 1 1 b 0 c c b b
1 0 c a b 1 1 0 c a b 1

We have,0 ≤ c ≤ a, b ≤ 1, but a, b are incomparable; hence, L is a BL-algebra that is

not a chain. We remark that x ∗∗ = 1 for every x ∈ L, x 6= 0.

3. BL-Rings
Definition 4 ([5]). A commutative ring whose lattice of ideals is a BL-algebra is called a BL-ring.

In particular, we can call a commutative ring whose lattice of ideals is an MV-algebra

an MV-ring.
We recall that, in [15], we showed that a commutative unitary ring A is an MV-ring iff
it has the Chang property, i.e.,
I + J = ( J : ( J : I )),
for every I, J ∈ Id( A). Obviously, every MV-ring is also a BL-ring.
BL-rings are closed under finite direct products, arbitrary direct sums and homomor-
phic images; see [5].
In the following, using the connections between BL-algebras and BL-rings, we give
new characterizations for commutative and unitary rings for which the lattice of ideals is a
BL-algebra.

Proposition 1 ([10]). Let ( L, ∨, ∧, , →, 0, 1) be a residuated lattice. Then, we have the equiva-

lences:
(i) L satisfies ( prel ) condition;
Mathematics 2022, 10, 4739 4 of 15

(ii) ( x ∧ y) → z = ( x → z) ∨ (y → z), for every x, y, z ∈ L.

Lemma 1. Let ( L, ∨, ∧, , →, 0, 1) be a residuated lattice. The following assertions are equivalent:

(i) L satisfies ( prel ) condition;
(ii) For every x, y, z ∈ L, if x ∧ y ≤ z, then ( x → z) ∨ (y → z) = 1.

Proof. (i ) ⇒ (ii ). Following Proposition 1.

(ii ) ⇒ (i ). Using (ii), for z = x ∧ y we deduce that 1 = ( x → ( x ∧ y)) ∨ (y →
( x ∧ y)) = [( x → x ) ∧ ( x → y)] ∨ [(y → x ) ∧ (y → y)] = ( x → y) ∨ (y → x ), so L satisfies
( prel ) condition.

Lemma 2. Let ( L, ∨, ∧, , →, 0, 1) be a residuated lattice. The following assertions are equivalent:

(i) L satisfies (div) condition;
(ii) For every x, y, z ∈ L, if x ( x → y) ≤ z, then x ∧ y ≤ z.

Proof. (i ) ⇒ (ii ), evidently.

(ii ) ⇒ (i ). Using (ii), for z = x ( x → y) we can deduce that x ∧ y ≤ x ( x →
y). Since in a residuated lattice, x ( x → y) ≤ x ∧ y, we deduce that L satisfies (div)
condition.

Using Lemmas 1 and 2 we deduce Proposition 2.

Proposition 2. Let ( L, ∨, ∧, , →, 0, 1) be a residuated lattice. The following assertions are

equivalent:
(i) L is a BL-algebra;
(ii) For every x, y, z ∈ L, if x ( x → y) ≤ z, then ( x → z) ∨ (y → z) = 1;
(iii) [ x ( x → y)] → z = ( x → z) ∨ (y → z), for every x, y, z ∈ L.

Proof. (i ) ⇒ (ii ). Let x, y, z ∈ L such that x ( x → y) ≤ z. Since every BL-algebra satisfies

(div) condition, by Lemma 2, we can deduce that x ∧ y ≤ z. Since every BL-algebra satisfies
( prel ) condition, following Lemma 1, we can deduce that 1 = ( x → z) ∨ (y → z).
(ii ) ⇒ (i ). First, we prove that L satisfies condition (ii) from Lemma 1. Therefore, let
x, y, z ∈ L such that x ∧ y ≤ z. Thus, ( x ∧ y) → z = 1. Since x ( x → y) ≤ x ∧ y, we
deduce that 1 = ( x ∧ y) → z ≤ ( x ( x → y)) → z. Then, x ( x → y) ≤ z. By hypothesis,
( x → z) ∨ (y → z) = 1.
To prove that L verifies condition (ii ) from Lemma 2, let x, y, z ∈ L such that x ( x →
y) ≤ z. By hypothesis, we deduce that, ( x → z) ∨ (y → z) = 1. Since ( x → z) ∨ (y → z) ≤
( x ∧ y) → z, we obtain ( x ∧ y) → z = 1, that is, x ∧ y ≤ z.
(iii ) ⇒ (ii ), evidently.
(ii ) ⇒ (iii ). If we denote t = [ x ( x → y)] → z, we have 1 = t → t = t → [( x ( x →
y)) → z] = [ x ( x → y)] → (t → z); hence, x ( x → y) ≤ t → z.
By hypothesis, we deduce that, ( x → (t → z)) ∨ (y → (t → z)) = 1.
Then, 1 = (t → ( x → z)) ∨ (t → (y → z)) ≤ t → [( x → z) ∨ (y → z)]. Thus,
t ≤ ( x → z ) ∨ ( y → z ).
However, ( x → z) ∨ (y → z) ≤ ( x ∧ y) → z ≤ [ x ( x → y)] → z = t.
We conclude that t = ( x → z) ∨ (y → z), that is, [ x ( x → y)] → z = ( x → z) ∨ (y →
z), for every x, y, z ∈ L.

Using Proposition 2 we obtain a new characterization for BL-algebras:

Theorem 1. A residuated lattice L is a BL-algebra if and only if for every x, y, z ∈ L,

[x ( x → y)] → z = ( x → z) ∨ (y → z).

Using this result, we can give a new description for BL-rings:

Mathematics 2022, 10, 4739 5 of 15

Corollary 1. Let A be a commutative and unitary ring. The following assertions are equivalent:
(i) A is a BL-ring;
(ii) K : [ I ⊗ ( J : I )] = (K : I ) + (K : J ), for every I, J, K ∈ Id( A).

Theorem 2. Let A be a commutative ring that is a principal ideal domain. Then, A is a BL-ring.

Proof. Since A is a principal ideal domain, let I =< a >, J =< b > be the principal
non-zero ideals generated by a, b ∈ A \{0}.
If d =gcd{ a, b}, then d = a · α + b · β, a, b ∈ A, a = a1 d and b = b1 d, with 1 =gcd{ a1 , b1 }.
Thus, I + J =< d >, I ∩ J =< ab/d >, I ⊗ J =< ab > and ( I : J ) = < a1 > .
The conditions ( prel ) are satisfied, ( I : J ) + ( J : I ) =< a1 > + < b1 >=< 1 >= A
and (div) is also satisfied: J ⊗ ( I : J ) =< b > ⊗ < a1 >=< ab/d >= I ∩ J.
If I = {0}, since A is an integral domain, we have that (0 : J ) + ( J : 0) = Ann( J ) +
A = A and J ⊗ (0 : J ) = J ⊗ Ann( J ) = 0 = 0 ∩ J = 0 ⊗ ( J : 0) for every J ∈ Id( A)\{0}.
Moreover, we remark that ( I : ( I : J )) = ( J : ( J : I )) = I + J for every non-zero ideal
I, J ∈ Id( A). Additionally, since A is an integral domain, we obtain Ann( Ann( I )) = A, for
every I ∈ Id( A)\{0}. We conclude that Id( A) is a BL-algebra that is not an MV-algebra.

Corollary 2. A ring factor of a principal ideal domain is a BL-ring.

Proof. We use Theorem 2 since BL-rings are closed under homomorphic images; see [5].
Moreover, we remark that a ring factor of a principal ideal domain is, in particular, an MV-ring,
see [15].

Corollary 3. A finite commutative unitary ring of the form A = Zk1 × Zk2 × ... × Zkr (direct
α
product of rings, equipped with componentwise operations) where k i = pi i , with pi a prime number,
is a BL-ring.

Proof. We apply Corollary 2 using the fact that BL-rings are closed under finite direct
products; see [5].
Moreover, we remark that if A is a finite commutative unitary ring of the above form,
then Id( A) = Id(Zk1 ) × Id(Zk2 ) × ... × Id(Zkr ) is an MV-algebra ( Id( A), ⊕,∗ , 0 = {0}) in
which
I ⊕ J = Ann( Ann( I ) ⊗ Ann( J )) and I ∗ = Ann( I )
for every I, J ∈ Id( A) since, Ann( Ann( I )) = I; see [15].

Example 4. (1) Following Theorem 2, the ring of integers (Z, +, ·) is a BL-ring in which ( Id(Z),
∩, +, ⊗ →, 0 = {0}, 1 = A) is not an MV-algebra. Indeed, since Z is the principal ideal domain,
we have Ann( Ann( I )) = Z, for every I ∈ Id(Z)\{0}.
(2) Let K be a field and K [ X ] be the polynomial ring. For f ∈ K [ X ], the quotient ring
A = K [ X ]/( f ) is a BL-ring. Indeed, the lattice of ideals of this ring is an MV-algebra; see [15].

4. Examples of BL-Algebras Using Commutative Rings

In this section, we present ways to generate finite BL-algebras using finite commutative
rings.
First, we give examples of finite BL-rings whose lattice of ideals is not an MV-algebra.
Using these rings we construct BL-algebras with 2r + 1 elements, r ≥ 2 (see Theorem 3)
and BL-chains with k ≥ 4 elements (see Theorem 4).
We recall that, in [15], we proved the following proposition.

Proposition 3 ([15]). If A is a finite commutative unitary ring of the form Zk1 × Zk2 × ... × Zkr
α
(direct product of rings, equipped with componentwise operations), where k i = pi i , with pi
a prime number, for all i ∈ {1, 2..., r } and Id( A) denotes the set of all ideals of the ring A,
then ( Id( A), ∨, ∧, , →, 0, 1) is an MV-algebra, where the order relation is ⊆, I J = I ⊗ J,
Mathematics 2022, 10, 4739 6 of 15

I ∗ = Ann( I ), I → J = ( J : I ), I ∨ J = I + J, I ∧ J = I ∩ J, 0 = {0} and 1 = A. The set Id( A)

r
has N A = ∏ (αi + 1) elements.
i =1

In the following, we give examples of finite BL-rings whose lattice of ideals is not an
MV-algebra.

Definition 5 ([13]). Let R be a commutative unitary ring. The ideal M of the ring R is maximal if
it is maximal with respect of the set inclusion, amongst all proper ideals of the ring R. That means
there are no other ideals different from R contained in M. The ideal J of the ring R is a minimal
ideal if it is a nonzero ideal that contains no other nonzero ideals. A commutative local ring R is a
ring with a unique maximal ideal.

Example 5. (i) A field F is a local ring, with {0} being the maximal ideal in this ring.
(ii) In (Z8 , +, ·), the ideal J = {b 4} is a minimal ideal and the ideal M = {b
0, b 2, b
0, b 6} is the
4, b
maximal ideal.

Remark 2. Let R be a local ring with M its maximal ideal. Then, the quotient ring R[ X ]/( X n )
with n being a positive integer is local. Indeed, the unique maximal ideal of the ring R[ X ]/( X n ) is
−
→ −
→
M = { f ∈ R[ X ]/( X n )/ f ∈ R[ X ], f = a0 + a1 X + ... + an−1 X n−1 , with a0 ∈ M}. For other
details, the reader is referred to [16].

In the following, we consider the ring (Zn , +, ·) with n = p1 p
2 ...pr , p1 , p2 , ..., pr being
distinct prime numbers, r ≥ 2 and the factor ring R = Zn [ X ]/ X 2 .

Remark 3. (i) With the above notations, in the ring (Zn ,+ , ·), the ideals generated by pbi , M pi =
( pbi ), are maximals. The ideals of Zn are of the form Id = d , where d is a divisor of n.
b
(ii) Each element from Zn − { M p1 ∪ M p2 ∪ ... ∪ M pr } is an invertible element. Indeed, if
xb ∈ Zn − { M p1 ∪ M p2 ∪ ... ∪ M pr }, we have gcd { x, n} = 1; therefore, x is an invertible element.

Proposition 4. (i) With the above notations, the factor ring R = Zn [ X ]/ X 2 has 2r + 1 ideals

including {0} and R.

b ∈ Zn − { M p1 ∪ M p2 ∪ ... ∪ M pr }, the element X + γ
(ii) For γ b is an invertible element in R.

Proof. (i) Indeed,

 the ideals
 are: J pi = (b αX + b αi ∈ M p i , i ∈ {1, 2, ..., r }, which are
α i ), b
maximal, Jd = βXb + βbd , βbd ∈ Id , Id is not maximal, b α, βb ∈ R, d 6= n, where d is a proper
divisor of n, the ideals ( X ), for d = n and (0). Therefore, we have {0n ideals for ideal ( X ),
{1n ideals for ideals J pi , {2n ideals for ideals J pi p j , pi 6= p j ,...,{nn ideals for ideal R, for d = 1,
 
r k k
resulting in a total of 2 + 1, if we add ideal (0). Here, {n = are combinations.
n
b ∈ Zn − { M p1 ∪ M p2 ∪ ... ∪ M pr }, we have that γ
(ii) Since γ b is invertible, with δb being
its inverse. Therefore, ( X + γ b)[−δb−2 ( X − γ
b)] = 1. As a result, X + γ b is invertible; therefore,
(X + γ b) = R.

Since, for any commutative unitary ring, the lattice of ideals is a residuated lattice
2 , we have


(see [6]), in particular, for the unitary and commutative ring A = Z n [ X ] / X
that ( Id(Zn / X 2 ), ∩, +, ⊗ →, 0 = {0}, 1 = A) is a residuated lattice with 2r + 1 elements.

Remark 4. As we remarked above, the ideals in the ring R = Zn [ X ]/ X 2 are:

(i) (0);  
(ii) of the form Jd = b α ∈ R, βbd ∈ Id , where d is a proper divisor of n =
α X + βbd , b
p1 p2 ...pr , p1 , p2 , ..., pr being distinct prime numbers, r ≥ 2, by using the notations from Remark 3.
If Id = ( pbi ), then Jd is denoted J pi and is a maximal ideal in R = Zn [ X ]/ X 2 ;


Mathematics 2022, 10, 4739 7 of 15

(iii) The ring R, if d = 1;

(iv) ( X ), if d = n.

Remark 5. We remark that for all nonzero ideals
I of the above ring R, we have ( X ) ⊆ I and the
ideal ( X ) is the only minimal ideal of Zn [ X ]/ X 2 .

Remark 6. Let Dd = { p / p ∈ { p1 , p2 , ..., pr } such that d = ∏ p}, d 6= 1.

(1) We have Jd1 ∩ Jd2 = Jd1 ⊗ Jd2 = Jd3 , where Dd3 = { p ∈ Dd1 ∪ Dd2 , d3 = ∏ p} for
d1 , d2 proper divisors.
If d1 = 1, we have R ⊗ Jd2 = Jd2 = R ∩ Jd2 .
If d1 = n, d2 6= n, we have ( X ) ⊗ Jd2 = ( X ) ∩ Jd2 = ( X ). If d2 = n, we have ( X ) ⊗ ( X ) =
(0).
(2) We have ( Jd1 : Jd2 ) = Jd3 , with Dd3 = Dd1 − Dd2 . Indeed, ( Jd1 : Jd2 ) = {y ∈ R, y · Jd2 ⊆
Jd1 } = Jd3 , for d1 , d2 proper divisors.
If Jd1 = (0), we have (0 : Jd2 ) = (0). Indeed, if (0 : Jd2 ) = J 6= (0), J ⊗ Jd2 = (0). However,
from the above, J ⊗ Jd2 = J ∩ Jd2 6= (0), which is false
If Jd2 = (0), we have ( Jd1 :
0) = R.

If d1 = 1, we have R : Jd2 = R and Jd2 : R = Jd2 .
If d1 = n, d2 6= n, we have Jd1 = ( X ); therefore, ( Jd1 : Jd2 ) = Jd1 = ( X ). If d1 6= n, d2 = n,
we have Jd2 = ( X ); therefore, ( Jd1 : Jd2 ) = R. If d1 = d2 = n, we have Jd1 = Jd2 = ( X ) and
( Jd1 : Jd2 ) = R.

the residuated lattice ( Id(Zn [ X ]/ X 2 ), ∩,

Theorem 3. (i) For n ≥ 2,with the above notations,
+, ⊗ →, 0 = {0}, 1 = R), R = Zn [ X ]/ X 2 is a BL-algebra with 2r + 1 elements.

(ii) By using notations from Remark
4, we have that ( Id pi (Zn [ X ]/ X 2 ), ∩, +, ⊗ →, 0 =

{0}, 1 = R),
where Id pi (Zn [ X ]/ X 2 ) = {(0), J pi , R} is a BL-sublattice of the lattice

Id(Zn [ X ]/ X 2 ) with 3 elements.

Proof. (i) First, we will prove the ( prel ) condition:

 
( I → J ) ∨ ( J → I ) = ( J : I ) ∨ ( I : J ) = Zn [ X ] / X 2 ,

for every I, J ∈ Id(Zn [ X ]/ X 2 ).

Case 1. If d1 and d2 are proper divisors of n, we have Jd1 → Jd2 ∨ Jd2 → Jd1 = ( Jd2 :
Jd1 ) ∨ ( Jd1 : Jd2 ) = Jd4 ∨ Jd5 , where Dd5 = Dd1 − Dd2 and Dd4 = Dd2 − Dd1 . We remark that
Dd4 ∩ Dd5 = ∅; then, gcd {d4 , d5 } = 1. From here, there are the integers a and b such that
ad4 + bd5 = 1. We obtain that Jd4 ∨ Jd5 =< Jd4 ∪ Jd5 >= R from Proposition 4, (ii).
Case 2.
If d1 is a proper

divisor of n and d2 = n, we have Jd2 = ( X ). Therefore,
Jd1 → Jd2 ∨ Jd2 → Jd1 = ( Jd2 : Jd1 ) ∨ ( Jd1 : Jd2 ) = Jd2 ∨ R = R using Remark

6.

Case 3. If d1 is a proper divisor of n and Jd2 = (0), we have Jd1 → Jd2 ∨ Jd2 → Jd1 =
(0 : Jd1 ) ∨ ( Jd1 : 0) = 0 ∨ R = R using Remark 6.
Case 4. If d1 is a proper divisor of n and Jd2 = R, it is clear. From here, the condition
( prel ) is satisfied.
Now, we prove condition (div) :

I ⊗ ( I → J ) = I ⊗ ( J : I ) = I ∩ J,

for every I, J ∈ Id(Zn [ X ]/ X 2 ).

Case 1. If d1 and d2 are proper divisors of n, we have Jd1 ⊗ Jd2 : Jd1 = Jd1 ⊗ Jd3 =
Jd4 = Jd1 ∩ Jd2 , since Dd3 = Dd2 − Dd1 and Dd4 = { p ∈ Dd1 ∪ Dd3 , d4 = ∏ p} = { p ∈
Dd 1 ∪ Dd 2 , d 4 = ∏ p } .
Case 2. If
d1 is a proper divisor

of n and d2 = n, we have Jd2 = ( X ). We obtain
Jd1 ⊗ Jd2 : Jd1 = Jd1 ⊗ ( X ) : Jd1 = Jd1 ⊗ ( X ) = Jd1 ∩ ( X ) since ( X ) ⊂ Jd1 .
Case 3. If
d1 = n and d2 is a
proper divisor of n, we have Jd1 = ( X ). We obtain
Jd1 ⊗ Jd2 : Jd1 = ( X ) ⊗ Jd2 : ( X ) = ( X ) ⊗ R = ( X ) = Jd2 ∩ ( X ) since ( X ) ⊂ Jd2 .
Mathematics 2022, 10, 4739 8 of 15

Case 4.
If d1 is a proper divisor of n and Jd2 = (0), we have Jd1 ⊗ Jd2 : Jd1 =
Jd1 ⊗ 0 : Jd1 = Jd1 ⊗ (0) = (0) = Jd1 ∩ (0) from Remark 6.

Case 5.
If Jd1 = (0) and d2 is a proper divisor of n, we have Jd1 ⊗ Jd2 : Jd1 =
0 ⊗ Jd2 : 0 = 0.

Case
6. If d1 is a proper divisor of n and Jd2 = R, we have Jd1 ⊗ Jd2 : Jd1 = Jd1 ⊗
R : Jd1
= Jd1 ⊗ R = J
d1 . If Jd1 = R and d2 is a proper divisor of n, we have Jd1 ⊗
Jd2 : Jd1 = R ⊗ Jd2 : R = R ⊗ Jd2 = Jd2 . From here, the condition (div) is satisfied and
the proposition is proven.
(ii) It is clear that J pi J pi = J pi ⊗ J pi = J pi ; we obtain the following tables:

→ O J pi R O J pi R
O R R R O O O O
,
J pi O R R J pi O J pi J pi
R O J pi R R O J pi R
therefore showing a BL-algebra of order 3.

Theorem 4. Let n = p
r with p a prime number, p
≥ 2, r a positive integer, r ≥ 2. We consider the
ring R = Zn [ X ]/ X 2 . The set ( Id(Zn [ X ]/ X 2 ), ∩, +, ⊗ →, 0 = {0}, 1 = R) is a BL-chain
with r + 2 elements. In this way, for a given positive integer k ≥ 4, we can construct BL-chains
with k elements.

Proof. The
ideals in Zn are of the form: (0) ⊆ pr−1 ⊆ pr−2 ⊆ ... ⊆ ( p) ⊆ Zn . The

ideal pr−1 and the ideal ( p) are the only maximal ideals of Zn . The ideals in the ring
R are (0) ⊆ ( X ) ⊆ (αr−1 X + β r−1 ) ⊆
(αr−2 X + β r−2
) ⊆ ... ⊆ (α1 X + β 1 ) ⊆ R, where
αi ∈ Zn , i ∈ {1, ..., r − 1}, β r−1 ∈ pr−1 , β r−2 ∈ pr−2 , ..., β 1 ∈ ( p), meaning r + 2 ideals.
We denote these ideals with (0), ( X ), I pr−1 , I pr−2 , ...I p , R, with I p being the only maximal
ideal in R.
First, we prove the ( prel ) condition:
 
( I → J ) ∨ ( J → I ) = ( J : I ) ∨ ( I : J ) = Zn [ X ] / X 2 ,

for every I, J ∈ Id(Zn [ X ]/ X 2 ).

Case 1. We suppose that I and J are proper ideals and I ⊆ J. We have ( I → J ) ∨

( J → I ) = ( J : I ) ∨ ( I : J ) = R ∨ ( I : J ) = R.
Case 2. I = (0) and J are a proper ideal, we have ( I → J ) ∨ ( J → I ) = ( J : (0)) ∨ ((0) :
J ) = R. Therefore, the condition ( prel ) is satisfied.
Now, we prove the (div) condition:

I ⊗ ( I → J ) = I ⊗ ( J : I ) = I ∩ J,

for every I, J ∈ Id(Zn [ X ]/ X 2 ).

Case 1. We suppose that I and J are proper ideals and I ⊆ J. We have I ⊗ ( I → J ) =

I ⊗ ( J : I ) = I ⊗ R = I = I ∩ J. If J ⊆ I, we have I ⊗ ( I → J ) = I ⊗ ( J : I ) = J = I ∩ J.
Case 2. I = (0) and J is a proper ideal. We have (0) ⊗ ((0) → J ) = (0) ⊗ ( J : (0)) =
(0) = I ∩ J. If I 6= ( X ) is a proper ideal and J = (0), we have I ⊗ ( I → J ) = I ⊗ ((0) : I ) =
I ⊗ (0) = (0). If I = ( X ) and J = (0), we have I ⊗ ( I → J ) = ( X ) ⊗ ((0) : ( X )) =
( X ) ⊗ ( X ) = (0) and (0) ∩ ( X ) = (0).
From here, the condition (div) is satisfied and the theorem is proven.

Example 6. In Theorem 3, we take n = 2 · 3 ; therefore,

the ideals of Z6 are (0), (2), (3), Z6 , with
2
(2) and (3) maximal ideals. The ring Z6 [ X ]
/ X has five ideals: O = (0) ⊂ A = ( X ), B =
(αX + β), C = (γX + δ), E = Z6 [ X ]/ X 2 , with α, γ ∈
Z4 , β ∈ (2) and δ ∈ (3). From the
following tables, we have a BL-structure on Id(Z6 [ X ]/ X 2 ):
Mathematics 2022, 10, 4739 9 of 15

→ O A B C E O A B C E
O E E E E E O O O O O O
A A E E E E A O O A A A
.
B O C E C E B O A B A B
C O B B E E C O A A C C
E O A B C E E O A B C E
From Theorem 3, if we consider J pi = B, we have the following BL-algebra of order 3:

→ O B E O B E
O E E E O O O O
.
B O E E B O B B
E O B E E O B E

Example 7. In Theorem 3, we take n = 2 · 3 · 5 ; therefore, the ideals of the ring Z30 are
(0), (2), (3),
(5), (6), (10), (15), Z30 , with (2), (3) and (5) being maximal ideals. The ring
Z30 [ X ]/ X 2 has nine ideals: O = (0) ⊂ A = ( X ), B = (α1 X + β 1 ), C = (α2 X + β 2 ),
D = (α3 X + β 3 ), E = (α4 X + β 4 ), F = (α5 X + β 5 ), G = (α6 X + β 6 ), R = Z30 [ X ]/ X 2 ,


with αi ∈ Z30 , i ∈ {1, 2, 3, 4, 5, 6}, β 1 ∈ (6), β 2 ∈ (10), β 3 ∈ (15), β 4 ∈ (2), β 5 ∈ (3) and
β 6 ∈ (5). The ideals

E, F and G are maximal. From the following tables, we have a BL-structure on
Id(Z30 [ X ]/ X 2 ):

→ O A B C D E F G R O A B C D E F G R
O R R R R R R R R R O O O O O O O O O O
A A R R R R R R R R A O O A A A A A A A
B O G R G G R R G R B O A B A A B B A B
C O F F R F R F R R C O A A C A C C A C
.
D O E E E R E R R R D O A A A D A D D D
E O D F G D R F G R E O A B C A E A A E
F O C E C G E R G R F O A B A D A F A F
G O B B E F E F R R G O A A C D A A G G
R O A B C D E F G R R O A B C D E F G R

Example 8. In Theorem 4, we consider p = 2,
r = 2. The ideals in (Z4 , +, ·) are (0) ⊂ (2) ⊂ Z4
and Z4 is a local ring. The ring Z4 [ X ]/ X 2 has four ideals: O = (0) ⊂ A = ( X ) ⊂ B =
(αX + β) ⊂ E = Z4 [ X ]/ X 2
, with α ∈ Z4 , β ∈ (2). From the following tables, we have a

BL-structure for Id(Z4 [ X ]/ X 2 ):

→ O A B E O A B E
O E E E E O O O O O
A A E E E A O O A A .
B O B E E B O A A B
E O A B E E O A B E

Example 9. In Theorem 4, we consider p = 2, r = 3. The ideals in (Z8 , +, ·) are (0) ⊂ (4) ⊂

(2) ⊂ Z8 . The ring Z8 [ X ]/ X
2 has five ideals: O = (0) ⊂ A = ( X ) ⊂ B = (αX + β) ⊂ C =

(γX + δ) ⊂ E = Z8 [ X ]/ X 2 , with α, γ
∈ Z8 , β ∈ (4) and δ ∈ (2). From the following tables,

we have a BL-structure for Id(Z8 [ X ]/ X 2 ):

→ O A B C E O A B C E
O E E E E E O O O O O O
A A E E E E A O O A A A
.
B O B E E E B O A A A B
C O B B E E C O A A B C
E O A B C E E O A B C E
Mathematics 2022, 10, 4739 10 of 15

In the following, we present a way to generate finite BL-algebras using the ordinal
product of residuated lattices.
We recall that, in [10], Iorgulescu studied the influence of the conditions ( prel ) and
(div) on the ordinal product of two residuated lattices.
It is known that if L1 = ( L1 , ∧1 , ∨1 , 1 , →1 , 01 , 11 ) and L2 = ( L2 , ∧2 , ∨2 , 2 , →2 ,
02 , 12 ) are two residuated lattices such that 11 = 02 and ( L1 \{11 }) ∩ ( L2 \{02 }) = , then
the ordinal product of L1 and L2 is the residuated lattice L1  L2 = ( L1 ∪ L2 , ∧, ∨, , →,
0, 1) where
0 = 01 and 1 = 12 ,
x ≤ y if ( x, y ∈ L1 and x ≤1 y) or ( x, y ∈ L2 and x ≤2 y) or ( x ∈ L1 and y ∈ L2 ) ,

 1, if x ≤ y,
x→y= x →i y, if x  y, x, y ∈ Li , i = 1, 2,
y, if x  y, x ∈ L2 , y ∈ L1 \{11 }.


 x 1 y, if x, y ∈ L1 ,
x y= x 2 y, if x, y ∈ L2 ,
x, if x ∈ L1 \{11 } and y ∈ L2 .


The ordinal product is associative, but is not commutative; see [10].

Proposition 5 ([10] (Corollary 3.5.10)). Let L1 and L2 be BL-algebras.

(i) If L1 is a chain, then the ordinal product L1  L2 is a BL-algebra;
(ii) If L1 is not a chain, then the ordinal product L1  L2 is only a residuated lattice
satisfying (div) condition.

Remark 7. (i) An ordinal product of two BL-chains is a BL-chain. Indeed, using the definition of
implication in an ordinal product for every x, y we have x → y = 1 or y → x = 1;
(ii) An ordinal product of two BL-algebras is a BL-algebra that is not an MV-algebra. Indeed,
if L1 and L2 are two BL-algebras (the first being a chain), using Proposition 5, the residuated lattice
L1  L2 is a BL-algebra in which we have (11 )∗∗ = (11 → 01 )∗ = (01 )∗ = 01 → 01 = 1 =
12 6= 11 . Thus, L1  L2 is not an MV-algebra.

For a natural number n ≥ 2, we consider the decomposition (which is not unique) of n

in factors greater than 1. We only count the decompositions one time with the same terms,
but with other orders of terms in the product. We denote by π (n) the number of all such
decompositions. Obviously, if n is prime, then π (n) = 0.
We recall that an MV-algebra is finite iff it is isomorphic to a finite product of MV-
chains; see [17]. Furthermore, for two MV-algebras L1 and L2 , the algebras L1 × L2 and
L2 × L1 are isomorphic; see [18]. Using these results, in [15], we showed that for every
natural number n ≥ 2, there are π (n) + 1 non-isomorphic MV-algebras with n elements of
which only one is a chain.

Example 10. For n = 6, we have 6 = 2 · 3 = 3 · 2; thus, π (6) = 1. Therefore, there are

π (6) + 1 = 2 types (up to an isomorphism) of MV-algebras with six elements.

In Table 1, we briefly describe a way of generating finite MV-algebras M with 2 ≤ n ≤ 8

elements using commutative rings; see [15].
Mathematics 2022, 10, 4739 11 of 15

Table 1. Rings that Generate MV-algebras of order n, 2 ≤ n ≤ 8.

No. of
| M |= n Rings that Generate MV
MVs
n=2 1 Id(Z2 ) (chain)
n=3 1 Id(Z4 ) (chain)
n=4 2 Id(Z8 ) (chain) and Id(Z2 × Z2 )
n=5 1 Id(Z16 ) (chain)
n=6 2 Id(Z32 ) (chain) and Id(Z2 × Z4 )
n=7 1 Id(Z64 ) (chain)
n=8 3 Id(Z128 ) (chain) and Id(Z2 × Z8 ) and Id(Z2 × Z2 × Z2 )

Using the construction of the ordinal product, Proposition 5 and Remark 7, we can
generate BL-algebras (which are not MV-algebras) using commutative rings.

Example 11. In [15] we show that there is one MV-algebra with three elements (up to an isomor-
phism); see Table 1. This MV-algebra is isomorphic to Id(Z4 ) and is a chain. To generate a BL-chain
with three elements (which is not an MV-algebra) using the ordinal product, we must consider only
the MV-algebra with two elements (which is, in fact, a Boolean algebra). In the commutative ring
(Z2 , +, ·), the ideals are Id(Z2 ) = {{b
0}, Z2 }. Obviously, ( Id(Z2 ), ∩, +, ⊗ →, 0 = {0}, 1 = Z2 )
is an MV-chain. Now we consider two MV-algebras isomorphic with Id(Z2 ) denoted L1 = ( L1 =
{0, a}, ∧, ∨, , →, 0, a) and L2 = ( L2 = { a, 1}, ∧, ∨, , →, a, 1). Using Proposition 5, we can
construct the BL-algebra L1  L2 = ( L1 ∪ L2 = {0, a, 1}, ∧, ∨, , →, 0, 1) with 0 ≤ a ≤ 1 and
the following operations:

→ 0 a 1 0 a 1
0 1 1 1 0 0 0 0
and ,
a 0 1 1 a 0 a a
1 0 a 1 1 0 a 1

obtaining the same BL-algebra of order 3 as in Example 6.

Obviously, L1  L2 is a BL-chain that is not an MV-chain, since, for example, a∗∗ = 1 6= a.

Example 12. To generate the non-linearly ordered BL-algebra with five elements from  Example
  3,
we consider the commutative rings (Z2 , +, ·) and (Z2 × Z2 , +, ·). For Z2 × Z2 = { b 0, b
0 , b0, b1 ,
             
1, b
b 0 , b 1 }, we obtain the lattice Id(Z2 × Z2 ) = { b
1, b 0 ,{ b
0, b 0, b
0 , b 1 }, { b
0, b 0, b
0 , b 0 },
1, b
 
Z2 × Z2 } = {O, R, B, E}, which is an MV-algebra ( Id(Z2 × Z2 ), ∩, +, ⊗ →, 0 = { b 0 }, 1 =
0, b
Z2 × Z2 ). In Id(Z2 × Z2 ), we have the following operations:

→ O R B E ⊗=∩ O R B E + O R B E
O E E E E O O O O O O O R B E
R B E B E , R O R O R and R R R E E .
B R R E E B O O B B B B E B E
E O R B E E O R B E E E E E E

If we consider two MV-algebras isomorphic

 with ( Id(Z2 ), ∩, +, ⊗ →, 0 = {0}, 1 = Z2 ) and
( Id(Z2 × Z2 ), ∩, +, ⊗ →, 0 = { 0, 0 }, 1 = Z2 × Z2 ), denoted by L1 = ( L1 = {0, c}, ∧1 , ∨1 ,
b b
1 , →1 , 0, c ) and L2 = ( L2 = { c, a, b, 1}, ∧2 , ∨2 , 2 , →2 , c, 1), then, using Proposition 5, we
generate the BL-algebra L1  L2 = ( L1 ∪ L2 = {0, c, a, b, 1}, ∧, ∨, , →, 0, 1) from Example 3.
Mathematics 2022, 10, 4739 12 of 15

Remark 8. Using the model from Examples 11 and 12 for two BL-algebras L1 and L2 we can use
these algebras to obtain two BL-algebras L10 and L20 , isomorphic with L1 and L2 , respectively, that
satisfy the conditions imposed by the ordinal product.
We denote by L1 L2 the ordinal product L10  L20 .

From Proposition 5 and Remark 7, we deduce the following.

Theorem 5. (i) To generate a BL-algebra with n ≥ 3 elements as an ordinal product L1  L2 of

two BL-algebras L1 and L2 we have the following possibilities:

L1 is a BL-chain with i elements and L2 is a BL-algebra with j elements

and
L1 is a BL-chain with j elements and L2 is a BL-algebra with i elements
or
L1 is a BL-chain with k elements and L2 is a BL-algebra with k elements
for i, j ≥ 2, i + j = n + 1, i < j and k ≥ 2, k = n+ 1
2 ∈ N,
(ii) To generate a BL-chain with n ≥ 3 elements as the ordinal product L1  L2 of two
BL-algebras L1 and L2 , we have the following possibilities:

L1 is a BL-chain with i elements and L2 is a BL-chain with j elements

and
L1 is a BL-chain with j elements and L2 is a BL-chain with i elements
or
L1 is a BL-chain with k elements and L2 is a BL-chain with k elements
n +1
for i, j ≥ 2, i + j = n + 1, i < j and k ≥ 2, k = 2 ∈ N.

We make the following notations:

BLn = the set of BL-algebras with n elements;

BLn (c) = the set of BL-chains with n elements;

MV n = the set of MV-algebras with n elements;
MV n (c) = the set of MV-chains with n elements.

Theorem 6. (i) Finite BL-algebras (up to an isomorphism) that are not MV-algebras with 3 ≤ n ≤
5 elements can be generated using the ordinal product of BL-algebras.
(ii) The number of non-isomorphic BL-algebras with n elements (with 2 ≤ n ≤ 5) is

|BL2 | = |MV 2 | = π (2) + 1,

|BL3 | = |MV 3 | + |BL2 | = π (3) + π (2) + 2,

|BL4 | = |MV 4 | + |BL3 | + |BL2 | = π (4) + π (3) + 3 · π (2) + 4,
|BL5 | = |MV 5 | + |BL4 | + |BL3 | + |BL2 | =
= π (5) + π (4) + 2 · π (3) + 5 · π (2) + 8.

Proof. From Proposition 5 and Remark 7, we remark that using the ordinal product of two
BL-algebras, we can generate only BL-algebras that are not MV-algebras.
We generate all BL-algebras with n elements (2 ≤ n ≤ 5) that are not MV-algebras.
Case n = 2.
Mathematics 2022, 10, 4739 13 of 15

We obviously only have a BL-algebra (up to an isomorphism) isomorphic with

( Id(Z2 ), ∩, +, ⊗ →, 0 = {0}, 1 = Z2 ).

In fact, this residuated lattice is a BL-chain and is the only MV-algebra with 2 elements.
We deduce that
|MV 2 | = |BL2 | = π (2) + 1 = 1
|MV 2 (c)| = |BL2 (c)| = 1.
Case n = 3.
Using Theorem 5, to generate a BL-algebra with 3 elements as an ordinal product
L1  L2 of two BL-algebras L1 and L2 , we must consider:

L1 is a BL-chain with two elements and L2 is a BL-algebra with two elements.

Since there is only one BL-algebra (up to an isomorphism) with two elements and it is a
chain, we obtain the BL-algebra
Id(Z2 ) Id(Z2 ),
which is a chain.
We deduce that

|MV 3 | = π (3) + 1 and |BL3 | = |MV 3 | + 1 · |BL2 | = π (3) + π (2) + 2 = 2

|MV 3 (c)| = 1 and |BL3 (c)| = |MV 3 (c)| + 1 = 1 + 1 = 2.

We remark that |BL3 | = |MV 3 | + |BL2 |.
Case n = 4.
Using Theorem 5, to generate a BL-algebra with four elements as the ordinal product
L1  L2 of two BL-algebras L1 and L2 ,we must consider:

L1 is a BL-chain with two elements and L2 is a BL-algebra with three elements;

L1 is a BL-chain with three elements and L2 is a BL-algebra with two elements.

We obtain the following BL-algebras:

Id(Z2 ) Id(Z4 ) and Id(Z2 ) ( Id(Z2 ) Id(Z2 ))

and
Id(Z4 ) Id(Z2 ) and ( Id(Z2 ) ( Id(Z2 )) Id(Z2 ).
Since  is associative, we obtain three BL-algebras (up to an isomorphism) that are
chains with Remark 7.
We deduce that
|MV 4 | = π (4) + 1
|BL4 |=|MV 4 | + 1 · |BL3 | + 2 · |BL2 | − 1=π (4) + π (3) + 3 · π (2) + 4=5
|MV 4 (c)| = 1 and |BL4 (c)| = |MV 3 (c)| + 3 = 1 + 3 = 4.
We remark that |BL4 | = |MV 4 | + |BL3 | + |BL2 |.
Case n = 5.
To generate a BL-algebra with five elements as the ordinal product L1  L2 of two
BL-algebras L1 and L2 , we must consider:

L1 is a BL-chain with two elements and L2 is a BL-algebra with four elements;

L1 is a BL-chain with four elements and L2 is a BL-algebra with two elements;

Mathematics 2022, 10, 4739 14 of 15

L1 is a BL-chain with three elements and L2 is a BL-algebra with three elements.

We obtain the following BL-algebras:

Id(Z2 ) Id(Z8 ), Id(Z2 ) Id(Z2 × Z2 ), Id(Z2 ) [ Id(Z2 ) Id(Z4 )],

Id(Z2 ) [ Id(Z4 ) Id(Z2 )] and Id(Z2 ) [ Id(Z2 ) ( Id(Z2 ) Id(Z2 ))]

and

Id(Z8 ) Id(Z2 ), [ Id(Z2 ) Id(Z4 )] Id(Z2 ),

[ Id(Z4 ) Id(Z2 )] Id(Z2 ) and [ Id(Z2 ) ( Id(Z2 ) Id(Z2 ))] Id(Z2 )

and

Id(Z4 ) Id(Z4 ), [ Id(Z2 ) Id(Z2 )] [ Id(Z2 )) Id(Z2 )]

Id(Z4 ) [ Id(Z2 ) Id(Z2 )] and [ Id(Z2 ) Id(Z2 )] Id(Z4 )

Since  is associative, Id(Z2 ) [ Id(Z4 ) Id(Z2 )] = [ Id(Z2 ) Id(Z4 )] Id(Z2 ),

Id(Z2 ) [ Id(Z2 ) ( Id(Z2 ) Id(Z2 ))] = [ Id(Z2 ) ( Id(Z2 ) Id(Z2 ))] Id(Z2 )
= [ Id(Z2 ) Id(Z2 )] [ Id(Z2 )) Id(Z2 )], [ Id(Z4 ) Id(Z2 )] Id(Z2 ) = Id(Z4 ) [ Id(Z2 )
Id(Z2 )] and Id(Z2 ) ( Id(Z2 ) Id(Z4 )) = [ Id(Z2 ) Id(Z2 )] Id(Z4 ).
We obtain eight BL-algebras of which seven are chains from Remark 7.
We deduce that

|MV 5 |=π (5) + 1 = 1 and |BL5 |=9 = |MV 5 | + |BL4 | + |BL3 | + |BL2 |

|MV 5 (c)| = 1 and |BL5 (c)| = 8.

Table 2 presents a basic summary of the structure of BL-algebras L with 2 ≤ n ≤ 5

elements:

Table 2. The structure of BL-algebras of order n, 2 ≤ n ≤ 5.

| L|= n No. of BL-alg Structure

n=2 1 { Id(Z2 ) (chain, MV)

n=3 2 Id(Z4 ) (chain, MV)
Id(Z2 ) Id(Z2 ) (chain)


 Id(Z8 ) (chain, MV)
n=4 5 Id(Z2 × Z2 ) (MV)



Id(Z2 ) Id(Z4 ) (chain)
Id(Z4 ) Id(Z2 ) (chain)




Id(Z2 ) ( Id(Z2 ) Id(Z2 )) (chain)



 Id(Z16 ) (chain, MV)



 Id (Z2 ) Id(Z8 ) (chain)
n=5 9



 Id(Z2 ) Id(Z2 × Z2 )
Id(Z2 ) ( Id(Z2 ) Id(Z4 )) (chain)



Id(Z2 ) ( Id(Z4 ) Id(Z2 )) (chain)
Id (Z ) ( Id(Z2 ) ( Id(Z2 ) Id(Z2 ))) (chain)

2



Id(Z8 ) Id(Z2 ) (chain)




( Id(Z4 ) Id(Z2 )) Id(Z2 ) (chain)




Id(Z4 ) Id(Z4 ) (chain)


Finally, Table 3 present a summary of the number of MV-algebras, MV-chains, BL-

algebras and BL-chains with n ≤ 5 elements obtained used commutative rings:
Mathematics 2022, 10, 4739 15 of 15

Table 3. A summary of the number of the obtained BL-algebras.

n=2 n=3 n=4 n=5

MV-algebras 1 1 2 1
MV-chains 1 1 1 1
BL-algebras 1 2 5 9
BL-chains 1 2 4 8

5. Conclusions
It is known that BL-algebras are a particular kind of residuated lattices.
In this paper, we studied rings whose ideals have a BL-algebra structure and we used
some commutative rings to build certain finite BL-algebras by passing to the ideal lattice.
Using the results obtained in this paper, in further research, we will try to describe a
recursive algorithm to construct all isomorphism classes of finite BL-algebras of a given
size. Furthermore, we hope to obtain important results about BL-rings by studying the
binary block codes associated with a BL-algebra in further research.

Author Contributions: Conceptualization, C.F. and D.P.; methodology, C.F. and D.P.; software,
C.F. and D.P.; validation, C.F. and D.P.; formal analysis, C.F. and D.P.; investigation, C.F. and D.P.;
resources, C.F. and D.P.; data curation, C.F. and D.P.; writing—original draft preparation, C.F. and
D.P.; writing—review and editing, C.F. and D.P.; visualization, C.F. and D.P.; supervision, C.F. and
D.P.; project administration, C.F. and D.P. All authors have read and agreed to the published version
of the manuscript.
Funding: This research received no external funding.
Data Availability Statement: Not applicable.
Acknowledgments: The authors express their gratitude to the anonymous reviewers and editor for
their careful reading of the manuscript and many valuable remarks and suggestions.
Conflicts of Interest: The authors declare no conflict of interest.

References
1. Dilworth, R.P. Abstract residuation over lattices . Bull. Am. Math. Soc. 1938, 44, 262–268. [CrossRef]
2. Ward, M.; Dilworth, R.P. Residuated lattices. Trans. Am. Math. Soc. 1939, 45, 335–354. [CrossRef]
3. Blair, R.L. Ideal lattices and the structure of rings. Trans. Am. Math. Soc. 1953, 75, 136–153. [CrossRef]
4. Belluce, L.P.; Di Nola, A. Commutative rings whose ideals form an MV-algebra. Math. Log. Quart. 2009, 55, 468–486. [CrossRef]
5. Heubo-Kwegna, O.A.; Lele, C.; Nganou, J.B. BL-rings. Log. J. IGPL 2016, 26, 290–299. [CrossRef]
6. Tchoffo Foka, S.V.; Tonga, M. Rings and residuated lattices whose fuzzy ideals form a Boolean algebra. Soft Comput. 2022, 26,
535–539. [CrossRef]
7. Hájek, P. Metamathematics of Fuzzy Logic. In Trends in Logic-Studia Logica Library 4; Kluwer Academic Publishers: Dordrecht,
The Netherlands, 1998.
8. Cignoli, R.; D’Ottaviano, I.M.L.; Mundici, D. Algebraic Foundations of Many-Valued Reasoning. In Trends in Logic-Studia Logica
Library 7; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000.
9. Chang, C.C. Algebraic analysis of many-valued logic. Trans. Am. Math. Soc. 1958, 88, 467–490. [CrossRef]
10. Iorgulescu, A. Algebras of Logic as BCK Algebras; A.S.E.: Bucharest, Romania, 2009.
11. Belohlavek, R.; Vychodil, V. Residuated lattices of size n ≤ 12. Order 2010, 27, 147–161. [CrossRef]
12. Turunen, E. Mathematics Behind Fuzzy Logic; Physica-Verlag: Heidelberg, Germany, 1999.
13. Busneag, D.; Piciu, D. Lectii de Algebra; Ed. Universitaria: Craiova, Romania, 2002.
14. Di Nola, A.; Lettieri, A. Finite BL-algebras. Discret. Math. 2003, 269, 93–112. [CrossRef]
15. Flaut, C.; Piciu, D. Connections between commutative rings and some algebras of logic. Iran. J. Fuzzy Syst. 2022, 19, 93–110.
16. Lam, T.Y. A first course in noncommutative rings. In Graduate Texts in Mathematics, 2nd ed.; Springer: Berlin/Heidelberg, Germany,
2001.
17. Hőhle, U.; Rodabaugh, S.E. Mathematics of Fuzzy Sets: Logic, Topology and Measure Theory; Springer: Berlin, Germany, 1999.
18. Flaut, C.; Vasile, R. Wajsberg algebras arising from binary block codes. Soft Comput. 2020, 24, 6047–6058. [CrossRef]