# Compatible Deductive Systems of Pulexes

Authors: Shokoofeh Ghorbani
Journal: International Journal of Mathematics and Mathematical Sciences
 (2014)

---

## Abstract

The notion of (compatible) deductive system of a pulex is defined and some properties of deductive systems are investigated. We also define a congruence relation on a pulex and show that there is a bijective correspondence between the compatible deductive systems and the
congruence relations. We define the quotient algebra induced by a compatible deductive system and study its properties.


---

## Body

## 1. Introduction

Imai and Iséki [1] introduced the concept of BCK-algebra as a generalization of notions of set difference operation and propositional calculus. The notion of pseudo-BCK algebra was introduced by Georgescu and Iorgulescu [2] as generalization of BCK-algebras not assuming commutativity.Hájek [3] introduced the concept of BL-algebras as the general semantics of basic fuzzy logic (BL-logic). Iorgulescu studied BCK-algebras and their relation to BL-algebras [4, 5]. BL-algebra has been generalized in different ways [6–8]. Hájek in [9] introduced flea-algebra as a generalization of BL-algebra. He proved that the implication reduct of a flea-algebra is a pseudo-BCK algebra with three additional conditions. The pseudo-BCK algebra with these conditions is called pulex.In this section some preliminary definitions and theorems are stated. In Section2, we introduce the notions of deductive system, lattice filter, and subalgebra of pulexes and obtain some properties which are not true in a pseudo-BCK lattice in general. In Section 3, we define concepts of compatible deductive system and congruence relation on a pulex and show that there is a correspondence between the set of all compatible deductive systems of a pulex and the set of all congruence relations on a pulex which is not true in a pseudo-BCK lattice. After that we prove that the quotient algebra defined by a congruence relation is a pulex and we obtain some related results.Definition 1 (see [10]).
Apseudo-BCK algebra is a structure A=(A,≤,→,⇝,1), where (A,≤) is a poset with the greatest element 1 and →, ⇝ are binary operations on A such that, for all x, y, z∈A, we have(1)
x→y≤(y→z)⇝(x→z), x⇝y≤(y⇝z)→(x⇝z),(2)
x≤(x→y)⇝y, x≤(x⇝y)→y,(3)
x≤y iff x→y=1 iff x⇝y=1.Theorem 2 (see [11]).
An algebraA=(A,→,⇝,1) of type (2,2,0) is a pseudo-BCK algebra if and only if it satisfies the following:(1)
(x→y)⇝[(y→z)⇝(x→z)]=1 and (x⇝y)→[(y⇝z)→(x⇝z)]=1;(2)
1→x=x, 1⇝x=x;(3)
x→1=1, x⇝1=1;(4)
x→y=1 and y→x=1 implies x=y, the same for ⇝.Definition 3 (see [11]).
If the partial order≤ of a pseudo-BCK algebra A=(A,≤,→,⇝,1) is a lattice order, with the lattice operations ∧ and ∨, then A is said to be apseudo-BCK lattice and it will be denoted by A=(A,∧,∨,→,⇝,1).Example 4.
LetA={0,a,b,c,d,1} such that 0<a<b<c<1, 0<d<c<1, and a,b are incomparable with d. The operations → and ⇝ are given as follows:
(1)⟶0abcd10111111a0111c1b0b11c1c0bb1c1d0bb11110abcd1⇝0abcd10111111a0111c1b0c11c1c0ab1c1d0ab11110abcd1
Then A=(A,∧,∨→,⇝,1) is a pseudo-BCK lattice.Definition 5 (see [9]).
Apulex is a structure P=(P,∧,∨,→,⇝,1) such that(1)
P=(P,∧,∨,→,⇝,1) is a pseudo-BCK lattice;(2)
(x→y)→z≤[(y→x)→z]→z, the same for ⇝;(3)
x∨y=[(x→y)⇝y]∧[(y→x)⇝x]=[(x⇝y)→y]∧[(y⇝x)→x];(4)
(x→y)→(x→(x∧y))=1, the same for ⇝.Remark 6.
We see that the pseudo-BCK lattice of Example4 is not a pulex because (b→d)→(b→(b∧d))=0≠1.Definition 7 (see [9]).
Aflea-algebra is a structure (F,∧,∨,*,→,⇝,1) where(1)
(F,∧,∨,1) is a lattice with the greatest element 1;(2)
* is a binary associative operation with 1 as a both-side unit;(3)
x*y≤z iff x≤y→z iff y≤x⇝z (residuation);(4)
(x→y)∨(y→x)=1, (x⇝y)∨(y⇝x)=1 (prelinearity).Proposition 8 (see [9]).
Let(F,∧,∨,*,→,⇝,1) be a flea-algebra. Then (F,∧,∨,→,⇝,1) is a pulex.Proposition 9 (see [9, 10]).
In any pulex, the following rules hold:(1)
x→[(x⇝y)→y]=1,(2)
x⇝[(x→y)⇝y]=1,(3)
x→x=x⇝x=1,(4)
x→y=1iffx⇝y=1,(5)
x≤yimplies thatz→x≤z→yandz⇝x≤z⇝y,(6)
x≤yimplies thaty→z≤x→zandy⇝z≤x⇝z,(7)
x⇝(y→z)=y→(x⇝z),(8)
x≤y→ziffy≤x⇝z,(9)
x≤y→xandx≤y⇝x,(10)
((x⇝y)→y)⇝y=x⇝yand((x→y)⇝y)→y=x→y,(11)
x→y≤(z→x)→(z→y)andx⇝y≤(z⇝x)⇝(z⇝y),(12)
((x→y)⇝y)⇝y≤x⇝yand((x⇝y)→y)→y≤x→y.Proposition 10.
In every pulexP=(P,∧,∨,→,⇝,1), the following relations hold for all a,b,c∈P:
(2)a⟶b≤(a∧c)⟶(b∧c),a⇝b≤(a∧c)⇝(b∧c).Proof.
Sincea∧c≤a, then a→b≤(a∧c)→b by Proposition 9 part (6). We have (a∧c)→b≤(a∧c)→(a∧b∧c) by Definition 5 part (4). Since a∧b∧c≤b, we get that (a∧c)→(a∧b∧c)≤(a∧c)→(b∧c) by Proposition 9 part (5). Therefore a→b≤(a∧c)→(b∧c).
Similarly, we can showa⇝b≤(a∧c)⇝(b∧c).Proposition 11.
LetP=(P,∧,∨,→,⇝,1) be a pulex. Then the following relations hold:(1)
(a∨b)→c=(a→c)∧(b→c)and(a∨b)⇝c=(a⇝c)∧(b⇝c),(2)
a→b≤(a∨c)→(b∨c)anda⇝b≤(a∨c)⇝(b∨c), for alla,b,c∈P.Proof.
(
1
) Since a,b≤a∨b, by Proposition 9 part (6),
(3)(a∨b)⟶c≤a⟶c,(a∨b)⟶c≤b⟶c.
Hence (a∨b)→c≤(a→c)∧(b→c). On the other hand, we have
(4)(a⟶c)∧(b⟶c)≤a⟶c,(a⟶c)∧(b⟶c)≤b⟶c.
By Proposition 9 parts (2), (6),
(5)a≤(a⟶c)⇝c≤[(a⟶c)∧(b⟶c)]⇝c,b≤(b⟶c)⇝c≤[(a⟶c)∧(b⟶c)]⇝c.
Therefore a∨b≤[(a→c)∧(b→c)]⇝c. By Proposition 9 parts (1), ( 6),
(6)(a⟶c)∧(b⟶c)≤[(a⟶c)∧((b⟶c))⇝c]⟶cbbbbbbbbbbbbbbbbb,≤a∨b⟶c.
(
2
) By part (1), (a∨c)→(b∨c)=(a→(b∨c))∧(b→(b∨c))=(a→(b∨c)). Since b≤b∨c, we have a→(b∨c)≥a→b by Proposition 9 part (5). Thus a→b≤(a∨c)→(b∨c).


## 2. Deductive Systems

In this section, we introduce and study deductive systems of a pulex. From logical point of view, deductive systems correspond to the sets of formulas which are closed under the inference rule modus ponens. In what follows, we denote a pulexP=(P,∧,∨,→,⇝,1) by P.Definition 12.
LetF be a subset of a pulex P. We say that F is adeductive system if(1)
1∈F, and(2)
ifa,a→b∈F, then b∈F for all a,b∈P.Example 13.
LetP be the pulex with the universe {0,a,b,c,1} such that 0<a<b, c<1, and b,c are incomparable. The operations → and ⇝ are given by the tables below:
(7)⟶0abc1011111ab1111b0c1c1cbbb1110abc1⇝0abc1011111ac1111bcc1c1c0bb1110abc1F1={c,1} and F2={b,1} are deductive systems of P.Definition 14.
LetP be a pulex, and let F be a nonempty subset of P. We say that F is alattice filter of P if(1)
a∧b∈F for all a,b∈F, and(2)
ifa∈F, b∈P, and a≤b, then b∈F.Deductive systems of a pseudo-BCK lattice may not be a lattice filter. For example, consider deductive systemF={a,b,c,d,1} in Example 4. Since a, d∈F and a∧d=0∉F, then F is not a lattice filter. In the following, we study the relationship between deductive systems and lattice filters of a pulex.Theorem 15.
Every deductive system of a pulexP is a lattice filter of P.Proof.
LetF be a deductive system of a pulex P. Since 1∈F, then F≠∅.(i)
Leta∈F and b∈P such that a≤b. So we have a→b=1∈F. Since F is a deductive system, then we have b∈F.(ii)
Leta,b∈F. By part (9) of Proposition 9, a≤b→a and then b→a∈F by part (i). Since P is a pulex, then (b→a)→(b→(a∧b))=1∈F. F is a deductive system, so b→(a∧b)∈F and then a∧b∈F.Remark 16.
The converse of Theorem15 may not be true. Consider Example 13. F={a,b,1} is a lattice filter of P, but it is not a deductive system because a∈F and a→0=b∈F, but 0∉F. Hence the converse of the above theorem is not true in a pseudo-BCK lattice too.Theorem 17.
LetP be a pulex. Then F⊆P with 1∈F is a deductive system of P if and only if it satisfies the following condition:
(8)ifa,a⇝b∈F,thenb∈F∀a,b∈P.Proof.
See Lemma2.1.3 in [5].It is easy to verify that the intersection of deductive systems of a pulexP is a deductive system of P.Definition 18.
LetX be a subset of a pulex P. The smallest deductive system of P containing X (i.e., the intersection of all deductive systems of P containing X) is called thedeductive system generated byX and will be denoted by [X). If X={x}, then [{x}) is written as [x) and is called the principal deductive system generated by x.
For convenience, we will writex→0a=x⇝0a=a and
(9)x⟶na=x⟶(⋯⟶(x⟶a)⋯),x⇝na=x⇝(⋯⇝(x⇝a)⋯),
where n∈ℵ indicating the number of occurrence of x.Theorem 19 (see [5]).
LetP be a pulex, and let X be a nonempty subset of P and x,y∈P. Then(1)
[X)={a∈P:x1→(⋯→(xn→a)⋯)=1 for some x1⋯xn∈X,n∈ℵ};(2)
[x)={a∈P:x→na=1 for some n∈ℵ∪{0}};(3)
x≤y implies [y)⊆[x);(4)
[x)∩[y)=[x∨y).The set of all deductive systems of a pulexP is an algebraic lattice whose compact elements are precisely the finitely generated deductive systems P.Definition 20.
A subsetS of a pulex P is calledsubalgebra of P if the constant 1 is in S and S itself forms a pulex under operations of P.Proposition 21.
A nonempty subsetS of a pulex P is a subalgebra of P if and only if S is closed under operations ∧, →, ⇝ on P.Deductive system of a pseudo-BCK lattice may not be a subalgebra. Consider deductive systemF={a,b,c,d,1} of A in Example 4. We can show that it is not a subalgebra of A. In the following theorem, we prove that this is true in each pulexes.Proposition 22.
LetF be a deductive system of a pulex P. Then F is a subalgebra of P.Proof.
LetF be a deductive system of a pulex P. Then F is nonempty subset of P. By Theorem 15, F is closed under ∧. Suppose that x,y∈F. By Proposition 9 part (9), we have x≤y→x and y≤x→y. By Theorem 15, we get that y→x,x→y∈F; that is, F is closed under →. Similarly, we can show that F is closed under ⇝. Hence F is a subalgebra of P by Proposition 21.Remark 23.
Consider subalgebra{a,1} of P in Example 13. Then S is not a lattice filter of P. By Theorem 15, S is not a deductive system of P. Therefore the converse of the above proposition may not be true in general.


## 3. Compatible Deductive Systems

In this section, we introduce the notions of compatible deductive systems and congruence relations of a pulex and study relationship between them.Definition 24.
LetF be a deductive system of a pulex P such that
(10)x⟶y∈Fiffx⇝y∈F.
Then F is called a compatible deductive system of P.Example 25.
LetP be the pulex with the universe {0,a,b,c,1} such that 0<a<b<c<1. The operations → and ⇝ are given by the tables below:
(11)⟶0abc1011111ab1111b0a111c0ab1110abc1⇝0abc1011111aa1111baa111c0ab1110abc1F1={c,1} is a compatible deductive system of P, but the deductive system F2={b,c,1} of P is not compatible because a→0=b∈F2 and a⇝0=a∉F2.Definition 26.
LetF be a compatible deductive system of a pulex P. Define the relation θF by
(12)(a,b)∈θFiffa⟶b∈F,b⟶a∈F
for all a,b∈P.Theorem 27.
θ
F is an equivalence relation on P.Proof.
Clearly,θF is reflexive and symmetric. Let (a,b), (b,c)∈θF. Then a→b∈F, b→a∈F, c→b∈F, and b→c∈F. By Proposition 9 part (12),
(13)c⟶b≤(b⟶a)⇝(c⟶a),a⟶b≤(b⟶c)⇝(a⟶c).
By Theorem 15, we have (b→a)⇝(c→a)∈F and (b→c)⇝(a→c)∈F. Since F is a deductive system and b→a, b→c∈F, then a→c∈F and c→a∈F; that is, (a,c)∈θF. Hence θF is an equivalence relation on P.Definition 28.
An equivalence relationθ on a pulex P is called acongruence relation on P if (a,b),(c,d)∈θ, then
(14)(a⟶c,b⟶d),(a⇝c,b⇝d),(a∧c,b∧d),(a∨c,b∨d)∈θ.Theorem 29.
LetF be a compatible deductive system of a pulex P. Then θF is a congruence relation on P and is called the congruence relation induced by F.Proof.
Suppose that(a,b),(c,d)∈θF. By Proposition 9 part (11),
(15)c⟶d≤(b⟶c)⟶(b⟶d),d⟶c≤(b⟶d)⟶(b⟶c).
By Theorem 15, we have (b→c)→(b→d)∈F and (b→d)→(b→c)∈F and we have (b→c,b→d)∈θF. From
(16)a⟶b≤(b⟶c)⇝(a⟶c),b⟶a≤(a⟶c)⇝(b⟶c),
we obtain (a→c,b→c)∈θF. Since θF is a transitive relation, we have (a→c,b→d)∈θF. Similarly, we can show that (c→a,d→b)∈θF, (c⇝a,d⇝b)∈θF, and (a⇝c,b⇝d)∈θF.
By Proposition10,
(17)a⟶b≤(a∧c)⟶(b∧c),b⟶a≤(b∧c)⟶(a∧c).
Hence (a∧c)→(b∧c),(b∧c)→(a∧c)∈F by Theorem 15. Thus (a∧c,b∧c)∈θF. Similarly, we can show that (b∧c,b∧d)∈θF. Therefore (a∧c,b∧d)∈θF.
By Proposition11 part (2),
(18)a⟶b≤(a∨c)⟶(b∨c),b⟶a≤(b∨c)⟶(a∨c).
Hence (a∨c)→(b∨c), (b∨c)→(a∨c)∈F by Theorem 15. Thus (a∨c,b∨c)∈θF. Similarly, we can show that (b∨c,b∨d)∈θF. Therefore (a∨c,b∨d)∈θF.Theorem 30.
Letθ be a congruence relation on a pulex P. Then
(19)Fθ={x∈P:(x,1)∈θ}
is a compatible deductive system of P. Fθ is called the compatible deductive system induced by θ.Proof.
Sinceθ is reflexive, 1∈Fθ. Suppose that a, a→b∈Fθ. Then (a,1),(a→b,1)∈θ. Since θ is a congruence relation, then (a→b,b)=(a→b,1→b)∈θ. By transivity, (1,b)∈θ. Hence b∈Fθ and Fθ is a deductive system of P.
We will show thatθF is compatible. Suppose that a→b∈Fθ, then (a→b,1)∈θ. Since θ is a congruence relation, then (((a→b)⇝b)⇝b,1)=(((a→b)⇝b)⇝b,(1⇝b)⇝b)∈θ. Hence (a→b)⇝b)⇝b∈Fθ. By Proposition 9 part (12) ((a→b)⇝b)⇝b≤a⇝b. Since Fθ is a deductive system, a⇝b∈Fθ. Similarly, we can show that if a⇝b∈Fθ, then a→b∈Fθ.Theorem 31.
LetP be a pulex. There is a one to one correspondence between the set of all congruence relations on P and the set of all compatible deductive systems of P.Proof.
We will show thatθFθ=θ and FθF=F,
(20)FθF={x∈P:(x,1)∈θF}asd={x∈P:x⟶1∈F,1⟶x∈F}=F.
Suppose that (a,b)∈θFθ. Then (a→b,1),(b→a,1)∈θ. Since θ is a congruence relation,
(21)((a⟶b)⇝b,b)=((a⟶b)⇝b,1⇝b)∈θ,((b⟶a)⇝a,a)=((b⟶a)⇝a,1⇝a)∈θ.
Thus (a∨b,a∧b)=(((a→b)⇝b)∧((b→a)⇝a),a∧b)∈θ. We have (a,a∧b)=((a∨b)∧a,(a∧b)∧a)∈θ and (b,a∧b)=((a∨b)∧b,(a∧b)∧b)∈θ. Hence (a,b)∈θ.
Conversely, let(a,b)∈θ. Then
(22)(1,a⟶b)=(a⟶a,a⟶b)∈θ,(b⟶a,1)=(b⟶a,b⟶b)∈θ.
Thus a→b, b→a∈Fθ; that is, (a,b)∈θFθ.Remark 32.
In a pseudo-BCK lattice there is no one-to-one correspondence between congruence relations and compatible deductive systems. For example,F={d,c,1} is a compatible deductive system in Example 4, but θF is not a congruence relation on A. Suppose that θF is a congruence relation on A. Then (1,d)∈θF implies (b,0)=(b∧1,b∧d)∈θF. Thus (0,1)=(b→0,0→0)∈θF; that is, 0=1→0∈F which is a contradiction.Definition 33.
LetF be a compatible deductive system of a pulex P, and let θF be the equivalence relation induced by F. The set of all equivalence classes [a]={b∈P:(a,b)∈θF} is denoted by P/F. On this set define
(23)[a]∧[b]=[a∧b],[a]∨[b]=[a∨b],[a]⟶[b]=[a⟶b],[a]⇝[b]=[a⇝b],1=[1]P/F is called thequotient algebra of P with respect to the compatible deductive system F.Theorem 34.
LetF be a compatible deductive system of a pulex P. Then the quotient algebra P/F is a pulex and is called the quotient pulex.Proof.
SinceθF is a congruence relation, all the above relations are well defined. It is easy to show that (P/F,∧,∨,1) is a lattice with the greatest element 1. Hence we have a relation ≤ on P/F defined by
(24)[a]≤[b]iff[a]∨[b]=[b],
for all [a], [b]∈P/F. By Proposition 11 part (1), a→b=a∨b→b and a⇝b=(a∨b)⇝b. It follows that
(25)[a]≤[b]iffa⟶b∈Fiffa⇝b∈F.
From (24) and (25), we have
(26)[a]≤[b]iff[a]∨[b]=[a]iff[a]⟶[b]=1hhhhhhhhhhhhhhhhhhhhhhhiff[a]⇝[b]=1,
for all [a],[b]∈P/F. Now, it is easy to prove that (P/F,∧,∨,→,⇝,1) is a pulex.Theorem 35.
LetF be a compatible deductive system of pulex P, and let P/F be the corresponding quotient algebra. Then the map f:P→P/F defined by f(x)=[x] for all x∈P is a homomorphism and its Ker⁡(f)=F where Ker⁡(f)={x∈P:f(x)=1}.Proof.
The proof is straightforward.Theorem 36.
LetF be a compatible deductive system of a pulex P. There is a bijection from the set D(P,F) of all deductive systems of P containing F to the set of D(P/F) of all deductive systems of P/F.Proof.
It is easy to prove that(i)
ifJ is a deductive system of P such that F⊆J, then F is a compatible deductive of the subalgebra J of P and the quotient pulex J/F is a compatible deductive system of P/F;(ii)
ifK is a deductive system of P/F, then J={a:[a]∈K} is a deductive system of P and moreover F⊆J and K=J/F.Now, define f:D(P,F)→D(P/F) by f(J)=J/F. By (i) f is well define and by (ii) f is onto. We will show that f is one to one. Suppose that J1,J2∈D(P,F) such that J1≠J2. Without loss of generality, we assume that J1⊈J2. Then there exists x∈J1∖J2. If f(J1)=f(J2), then [x]∈f(J2). So there exists y∈J2 such that [x]=[y]; that is, x→y∈F and y→x∈F. Since F⊆J2, then y→x∈J2. Thus x∈J2 which is a contradiction. Hence f(J1)≠f(J2) and f is one to one.


## 4. Conclusion

We introduced the notions of compatible deductive systems and congruence relations on a pulex and obtained some related results. Then we studied the relation between them. We used the compatible deductive systems to define the quotient pulex.



---

*Source: 606890-2014-05-19.xml*