Quasigroups and Related Systems 15 (2007), 219 232

Fuzzy (strong) congruence relations

on hypergroupoids and hyper BCK-algebras
Reza Ameri, Mahmoud Bakhshi, Seyyed A. Nematollah Zadeh
and Rajabali Borzooei
Abstract
We dene the concept of fuzzy (strong) congruence relations on hypergroupoids and hyper BCK -algebras and construct a quotient hyperstructure on a hypergroupoid. In particular, we prove that if H is a (semi)
hypergroup and R is a fuzzy (strong) congruence relation on H , then H/R
is a (semi) group. Finally, by considering the notion of a hyper BCK algebra, we construct a quotient hyper BCK -algebra.

1. Introduction
The notion of a hyperstructure was introduced by F. Marty [13] in 1934 at
the 8th congress of Scandinavian Mathematicians and the notion of a fuzzy
set was introduced by Zadeh [16] in 1965. The study of BCK -algebras
was initiated by Y. Imai and K. Iski [7] in 1966 as a generalization of
the concept of the set-theoretic dierence and propositional calculi. In this
paper, we use the notion of a fuzzy set and dene the concept of a fuzzy
(strong) congruence relation on hypergroupoids and hyper BCK -algebras
and we obtain some results as mentioned in the abstract.

2. Fuzzy (strong) congruence relations

Denition 1. By a hypergroupoid we mean a nonempty set H endowed

with a binary hyperoperation "" (i.e., a function : H H P (H),

2000 Mathematics Subject Classication: 06F35, 03G25.
Keywords: Fuzzy (strong) congruence, hypergroup, hyper BCK-algebra.
This research partially is supported by the "Fuzzy Systems and it's Applications"
Center of Excelence, Shahid Bahonar University of Kerman, Iran".

220

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

where P (H) is the set of all nonempty subsets of H .)

Let be a binary relation on a hypergroupoid H and A, B H . Then:
(a) AB means that there exist a A and b B such that ab,
(b) AB means that for a A there exists b B and for b B there
exists a A such that ab,
(c) AB means that ab for each a A and for b B ,
(d) is left (resp. right) compatible if xy implies a xa y (resp.
x ay a) for all x, y, a H ,
(e) is strong left (resp. right) compatible if xy implies a xa y
a),
(resp. x ay
(f) is (resp. strong) compatible if it is both (resp. strong) left and right
compatible,
(g) is a (resp. strong) congruence relation on H if it is a (resp. strong)
compatible equivalence relation on H .

Denition 2. Let H be a nonempty set and R be a fuzzy relation on H .

We say that R satises the sup property if for every subset T of H there
exists (u, v) T 2 such that sup R(x, y) = R(u, v). R is said to be a
(x,y)T 2

fuzzy equivalence relation if

R(x, x) =
R(y, z), (fuzzy reexive)
(y,z)H 2

R(y, x) = R(x, y), (fuzzy symmetric)

(R(x, z) R(z, y)), (fuzzy transitive).

R(x, y)
zH

Denition 3. Let H be a nonempty set and R be a fuzzy relation on H .

Then, for all [0, 1], the -level subset and strong -level subset of R
respectively, is dened as follows:
R = {(x, y) H 2 : R(x, y)
R

>

= {(x, y) H 2 : R(x, y) > }

Lemma 1. Let R be a fuzzy relation on a nonempty set H. Then:

R =

R
[0,)

for all [0, 1].

>

and

>

R =

R
(,1]

221

Fuzzy (strong) congruence relations on hypergroupoids

R .

Proof. Let [0, 1] and < . Then R R and so R

[0,)

Conversely, let > 0 be given and (x, y)

R . Then R(x, y)

[0,)

which implies that R(x, y)

part can be proved.

and hence (x, y) R . Similarly, the other

Theorem 1. (cf. [3]) Let R be a fuzzy relation on nonempty set H . Then

the following properties are equivalent:
(i) R is a fuzzy equivalence relation on H ,

(ii) R = is an equivalence relation on H for all [0, 1],

>

(iii) R = is an equivalence relation on H for all [0, 1].

Denition 4. Fuzzy relation R on hypergroupoid H is said to be

(i) fuzzy left compatible i
R(u, v)

R(u, v)

R(a, b) a, b, c H,

R(u, v)

R(a, b) a, b, c H,

vcb uca

uca vcb

and fuzzy right compatible i

R(u, v)
vbc uac

uac vbc

(ii) fuzzy strong left compatible i

R(u, v)

R(a, b) a, b, c H.

uca,vcb

and fuzzy strong right compatible i

R(u, v)

R(a, b), a, b, c H

uac,vbc

Clearly, every fuzzy strong left (resp. right) compatible relation is a

fuzzy left (resp. right) compatible relation, but the converse is not true.

Theorem 2. Let R be a fuzzy relation on a hypergroupoid H that satises

the sup property. Then the following statements are equivalent:
(i) R is fuzzy left (resp. right) compatible,

222

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

(ii) R = is left (resp. right) compatible, for all [0, 1],

>

(iii) R = is left (resp. right) compatible, for all [0, 1].

Proof. We prove only for "left" compatible, the other cases can be proved
in a similar way.
(i) = (ii) Let R = . For [0, 1] and x, y, a H let xR y and
u x a. Since by (i), R is fuzzy left compatible, then
R(u, v)
uax vay

R(u, v)

R(x, y)

vay uax

and so

R(u, v)

R(u, v)

and

vay uax

uax vay

Hence, for all u ax,

R(u, v)

and for all v ay ,

R(u, v)
uax

vay

. Since, R satises the sup property, then there exist v0 a y and

u0 a x such that R(u, v0 ) =
R(u, v)
for all u a x and
vay

R(u0 , v) =

R(u, v)

for all v a y . Hence, (u, v0 ) R and

uax

(u0 , v) R , for all u a x and v a y . This implies that R is left

compatible.
>
(ii) = (iii) Let R = , for [0, 1] and x, y, a H be such that
>
xR y and u a x. Thus by Lemma 1, there exists (, 1] such that
xR y . Since R is left compatible, then a xR a y , and so there exists
>
v a y such that uR v . Thus, R(u, v) > . This shows that uR v .
Similarly, if v a y , then there exists u a x such that R(u, v) > and
>
>
so uR v . Therefore, R is left compatible.
(iii) = (i) Suppose that x, y, a H are such that R(x, y) = . Then
>
by Lemma 1, for all [0, ) we have xR y . So, by (iii) we have
>
>
a xR a y , and so for all u a x there exists v a y such that uR v
i.e., R(u, v) > . This implies that
R(u, v) > , for all [0, ).
uax vay
>

Similarly, for all v a y there exists u a x such that uR v and so

R(u, v) > , for all [0, ). Hence,
R(u, v) =
vay uax

uax vay

Fuzzy (strong) congruence relations on hypergroupoids

R(x, y) and

223

= R(x, y), which implies

R(u, v)
vay uax

R(u, v)
uax vay

R(u, v)

R(x, y).

vay uax

Thus, R is fuzzy left compatible.

Theorem 3. For a fuzzy relation R on a hypergroupoid H satisfying the

sup property the following properties are equivalent:

(i) R is fuzzy strong left (resp. right) compatible,

(ii) R = is strong left (resp. right) compatible, for all [0, 1],
>

(iii) R = is strong left (resp. right) compatible, for all [0, 1].

Proof. (i) = (ii) Let R be a fuzzy strong left compatible relation on H ,

a H and x, y H be such that xR y , for some [0, 1]. Then for all
u a x and v a y ,
R(w, w )

R(u, v)

R(x, y)

wax, w ay

that is uR v . This shows that R is a strong left compatible relation on H .

(ii) = (iii) Let R = be a strong left compatible relation on H ,
>
for L, x, y H be such that xR y and a H . Then, there exists

(, 1] such that xR y and so by (ii), a xR a y . This implies that for

>
all u a x and for all v a y , R(u, v) > and so uR v . Hence,
>
>
a xR a y , which implies that R is a strong left compatible relation
on H .
(iii) = (i) Let a H and x, y H be such that R(x, y) = , for
>
[0, 1]. Then, by Lemma 1, for all [0, ) we have xR y and so by
>
>
(iii), a xR a y ; i.e., for all u a x and for all v a y , uR v i.e.,
R(u, v) > , for all [0, ). Thus R(u, v) , and hence

R(u, v)

= R(x, y).

uax,vay

Therefore, R is a fuzzy strong left compatible relation on H .

224

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

Denition 5. Let R be a fuzzy relation on a hypergroupoid H . Then, R

is said to be

(i) fuzzy compatible if

R(u, v)
uac vbd

R(u, v)

R(a, b)R(c, d), a, b, c, d H,

vbd uac

(ii) fuzzy strong compatible if

R(u, v)

R(a, b) R(c, d), a, b, c, d H.

uac,vbd

Denition 6. By a fuzzy (resp. strong) congruence relation we mean a

fuzzy (resp. strong) compatible equivalence relation.

Theorem 4. A fuzzy relation R is a (resp. strong) fuzzy congruence relation

if and only if it is both a (resp. strong) left and right fuzzy compatible
equivalence relation.
Proof. Let R be a fuzzy congruence relation on H and a, x, y H . Then
R(u, v)

R(u, v)

R(x, y) R(a, a) = R(x, y)

vay uax

uax vay

which shows that R is a fuzzy left compatible relation on H . Similarly, it

can be shown that R is a fuzzy right compatible relation on H .
Conversely, suppose that R is both a fuzzy left and right compatible
equivalence relation on H and a, b, c, d H . Now, for every u a c and
every v b d, by transitivity of R, we have

R(u, v)

(R(u, y) R(y, v))

R(u, w) R(w, v), w b c

yH

and so

R(u, v)

R(u, w)
wbc

R(w, v) .
wbc

Thus

R(u, v)
vbd

R(u, v)
vbd

R(u, w)
wbc

R(w, v)
vbd wbc

Fuzzy (strong) congruence relations on hypergroupoids

225

and hence

R(u, v)

R(u, w)

uac vbd

R(w, v)

uac wbc

vbd wbc

R(a, b) R(c, d).

Therefore, R is a fuzzy congruence relation on H .
Now, let R be a fuzzy strong congruence relation on H and x, y, a H .
Then,
R(u, v) R(a, a) R(x, y) = R(x, y).
uax, vay

Hence, R is fuzzy strong left compatible. The proof for "fuzzy strong right"
is similar.
Conversely, let R be a fuzzy strong left and right compatible, a, b, c, d
H . Then,

R(u, v)

R(u, v) and R(c, d)

R(a, b)

ubc, vbd

uac, vbc

and so

R(u, v) .

R(u, v)

R(a, b) R(c, d)

uac, vbc

ubc, vbd

For every u a c and v b d, by transitivity of R, we have

R(u, v)

(R(u, y) R(y, v))

R(u, w) R(w, v), w b c

yH

(
uac, vbc

R(u, v)) (

R(u, v))

R(a, b) R(c, d).

wbc, zbd

Thus R is a fuzzy strong congruence relation on H .

By Theorems 1, 2, 3 and 4 we have the following corollary.

Corollary 1. Let R be a fuzzy relation on a hypergroupoid H that satises

the sup property. Then,

(i) R is a fuzzy congruence relation on H if and only if every nonempty level set R of R is both left and right compatible equivalence relation,
(ii) R is a fuzzy strong congruence relation on H if and only if every
nonempty -level set R of R is both strong left and right compatible
equivalence relation on H .

226

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

Let R be a fuzzy relation on H . For all x H , dene a fuzzy subset

on H by x (y) = R(y, x), for all y H .

Lemma 2. Let R be a fuzzy equivalence relation on a hypergroupoid H .

Then, x = y if and only if R(x, y) =

R(u, v).

u,vH

Proof. (i) Let x = y , for x, y H . Since, R is fuzzy reexive, then

R(x, y) = y (x) = x (x) = R(x, x) =

R(u, v).
u,vH

Conversely, suppose that R(x, y) =

R(u, v), for x, y H and w H .

u,vH

Since R is fuzzy symmetric and fuzzy transitive, we obtain

x (w) = R(w, x) = R(x, w)

=

u,vH

R(x, y) R(y, w)

R(u, v) R(y, w) = R(y, w) = y (w).

Similarly, we can show that y (w)

x = y .

x (w). Thus, x (w) = y (w) and so

Theorem 5. Let R be a fuzzy congruence relation on H with the sup property and H/R = {x : x H}. Then (H/R, ) is a hypergroupoid, where
binary hyperoperation " " is dened by
x y = {z : z x y} = xy .

Proof. First, we show that " " is well-dened. Let x = x and y = y ,

for x , x , y , y H/R. Then, by Lemma 2, R(x, x ) =
R(u, v) =
u,vH

R(y, y ). Let =

R(u, v). Then

xR x

and

yR y

and by Corollary

u,vH

1, R is a congruence relation on H , then x y R x y . Now, let z

x y = xy . Then there exists z x y such that z = z . On the
other hand, since x y R x y , then there exists u x y such that z R u
and so R(z , u) =
R(u, v) R(z , u). Hence, R(z , u) = . Now,
for w H we have

u,vH

z (w) = z (w) = R(w, z ) = R(z , w)

= R(u, w) = R(w, u) = u (w)

R(z , u) R(u, w) = R(u, w)

Fuzzy (strong) congruence relations on hypergroupoids

227

and so z
u . Similarly u
z . Hence, z = u and so z = u
x y = x y , since u x y . Thus x y x y . Analogously,
x y x y . Thus x y = x y . This completes the proof.
In the following, we briey give some preliminaries about hypergroups.

Denition 7. (cf. [5]) Let (H, ) be a hypergroupoid. Then H is called a

semihypergroup if "" is associative i.e., (xy)z = x(yz), for all x, y, z

H . Moreover, if H is a semihypegroup that satises the reproduction axioms
that is, xH = H x = H , for all x H , then we say that H is a hypergroup.
Now, let H be a hypergroup. An, element e H is called an identity if
for all x H , x (x e) (e x), an element a H is said to be a scalar
identity if for all x H , |a x| = |x a| = 1. Let H has an identity e, an
element a H is said to be an inverse of a H if e (a a ) (a a). H
is called regular if it has at least one identity and each element has at least
one inverse. H is said to be reversible if for all x, y, z H , y a x implies
that there exists an inverse a of a such that x a y and y x a implies
that there exists an inverse a of a such that x y a, a hypergroup
(H, ) is called canonical if it is commutative, with a scalar identity, such
that every element has an unique inverse and it is reversible.

Theorem 6. If (H, ) is a semihypergroup and R is a fuzzy congruence

relation on H , then H/R is a semihypergroup. In particular, if (H, ) is a
hypergroup then H/R is a hypergroup.
Proof. Let x , y , z H/R and u (x y ) z . Then there exists w
x y such that u w z = wz and so there exists v w z such that
u = v . But, v w z (xy)z = x(y z) and so there exists u y z
such that v x u . Hence, u = v xu = x u x (y z ),
which shows that (x y ) z x (y z ). By a similar way, we can
show that x (y z ) (x y ) z . Hence, (x y ) z = x (y z ),
which shows that " " is associative. Therefore, H/R is a semihypergroup.
Now, suppose that (H, ) is a hypergroup and x H/R. Obviously
x H/R H/R. Now, let u H/R. Since, u H = x H , then there
exists y H such that u x y and so u xy = x y x H/R.
Hence, H/R x H/R and so x H/R = H/R. Similarly, H/R x =
H/R and hence H/R satises the reproduction axioms. Therefore, H/R is
a hypergroup.

Theorem 7. Let (H, ) be a semihypergroup and R be a fuzzy strong congruence relation on H . Then:

228

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

(i) H/R is a semigroup,

(ii) if H is a hypergroup, then H/R is a group.

Proof. (i) By Theorem 6, H/R is a semihypergroup. It is enough to show

that |x y | = 1, for all x , y H/R. Let x , y H/R. Since, R is a
fuzzy strong congruence relation, then
R(a, b)

R(x, x) R(y, y) =

R(u, v).
u,vH

axy, bxy

Thus for all a, b xy , R(a, b)

R(u, v) and so R(a, b) =

u,vH

R(u, v).
u,vH

Hence, by Lemma 1, a = b , for all a, b x y , which implies that

|x y | = 1.
(ii) Similar to the proof of (i), it is enough to show that for all x , y
H/R, |x y | = 1. But, this immediately follows from (i).

Theorem 8. If (H, ) is a canonical hypergroup, then H/R is a canonical

hypergroup.

Proof. Let H be a canonical hypergroup and x , y H/R. Then,

x y = {z : z x y} = {z : z y x} = y

which shows that H/R is commutative. Since, H has a scalar identity, then
there exists e H , such that e x = x e = {x}. Hence, for all x H/R,

x e = xe = x = ex = e x .
This shows that e is a scalar identity. Let x H/R and x be the unique
inverse of x. Since, e (xx )(x x), then e (x x )(x x ), which
shows that x is an inverse of x . Now, let y be another inverse of x .
Then e (x y )(y x ) and so there exists b yx such that e = b .
Hence, by Lemma 1, R(e, b) =
R(u, v). Let =
R(u, v). Then,
u,vH

u,vH

eR b i.e., {e}R y x. Since, R is compatible, then e x R (y x) x

and so x R y (x x ). Since, y y e y (x x ), then x R y and
so R(x , y) =
R(u, v). Hence, R(x , y) =
R(u, v) and so by
u,vH

u,vH

Lemma 1, y = x , says that the inverse of x is unique. Now, we show that

H/R is reversible. For this, let x , y , a H/R and y a x = ax .

Fuzzy (strong) congruence relations on hypergroupoids

229

Then, there exists u a x such that y = u . Since, u a x, then there

exists an inverse a of a such that x a y and so x a y , and a is
an inverse of a . Similarly, if y x a , then there exists an inverse a
of a such that x y a . Hence, H/R is reversible. Therefore, H/R is
a canonical hypergroup.

3. Fuzzy congruence relations on hyper BCK -algebras

Denition 8. (cf. [10, 11]) By a hyper BCK -algebra we mean a hyper-

groupoid (H, ) equipped a constant element "0" that satises the following
axioms:
(HK1) (x z) (y z)
x y,
(HK2) (x y) z = (x z) y ,
(HK3) x H
{x},
(HK4) x
y and y
x imply x = y ,
for all x, y, z H , where by x
y we mean 0 x y and for every
A, B H, A
B is dened by a A, b B such that a
b.

Denition 9. Let R be a fuzzy relation on a hyper BCK -algebra H . Then,

R is said to be fuzzy regular if

R(b, 0) .

R(a, 0)

R(x, y)
axy

byx

Lemma 3. Let R be a fuzzy relation on a hyper BCK -algebra H with the

sup property. Then, R is fuzzy regular if and only if for all [0, 1], each
nonempty -level subset R is regular.
Proof. Let R be a fuzzy regular relation on H . Then x yR {0} and
y xR {0}, for x, y H and [0, 1]. Then, there exist a x y and
b y x such that aR 0 and bR 0. This implies that R(a, 0), R(b, 0) >
R(a, 0) > and
R(b, 0) > . Thus,
and so
axy

byx

R(x, y)

R(a, 0)
axy

xR y ,

and so
which shows that
Conversely, suppose that

byx

is regular.

R(a, 0)
axy

R(b, 0) >

R(b, 0) =
byx

230

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

for x, y H . Then

R(a, 0)

and

axy

and since R

R(b, 0)
byx

has the sup property, then there exist a0 x y and b0 y x such that
R(a0 , 0) =
R(a, 0)
and similarly R(b0 , 0) =
R(b, 0)
.
axy

byx

Hence, a0 R 0 and b0 R 0 and so x yR {0} and y xR {0}. Since R is

regular, then xR y and so

R(x, y)

R(a, 0)
axy

R(b, 0)
byx

Therefore, R is a fuzzy regular relation.

Theorem 9. Let (H, ) be a hyper BCK -algebra and R be a fuzzy regular

congruence relation on H . Then, H/R is a hyper BCK -algeba.
Proof. It is enough to establish the axioms of a hyper BCK -algebra.
(HK1) Let x , y , z , v H/R be such that v (x z ) (y z ).
Then there exist u x z and w y z such that v u w
and so there exists a u w such that v = a . Since a u w
(x z) (y z)
x y , then there exists b x y such that a
b and so
0 a b. This implies that 0 a b = v b (u w ) (x y )
((x z ) (y z )) (x y ). Thus (x z ) (y z )
x y .
(HK2) Let u (x y ) z . Then there exists v (x y) z such that
u = v . Since by (HK2) of H , (x y) z = (x z) y , then v (x z) y
and so u = v (x z ) y . This implies that (x y ) z
(x z ) y . Similarly, we can show that (x z ) y (x y ) z .
Thus (x y ) z = (x z ) y .
(HK3) Let z x H/R, for x H/R. Then there exists y H/R
such that z x y and so there exists w x y such that z = w .
Since by (HK3) of H , x y
x, then w
x and so 0 w x. Thus
0 w x = z x . This implies that z
x and so x H/R
x .
(HK4) Let x
y and y
x , for x , y H/R. Then 0 x y
and x y . Hence there exist z x y and w y x such that
z = 0 = w . Since, z = , then by Lemma 1, R(z, w) =
R(u, v).
u,vH

Since z = (and also w = ), then R(z, 0) =

R(u, v) = R(w, 0).

u,vH

R(u, v). Then zR 0 and wR 0, means that x yR {0} and

Let =
u,vH

Fuzzy (strong) congruence relations on hypergroupoids

231

y xR {0} and since R is regular, then xR y . Hence, R(x, y)

=
R(u, v) and so R(x, y) =
R(u, v), which implies that x = y ,
u,vH

u,vH

by Lemma 1. Therefore, H/R is a hyper BCK -algebra.

References
[1] R. Ameri: Fuzzy binary relations on (semi)hypergroups, J. Basic Science 2
(2003), 11 16.
[2] R. Ameri and M. M. Zahedi: Hypergoup and join spaces induced by a
fuzzy subset, Pure Math. Appl. 8 (1997), 155 168.
[3] R. A. Borzooei, M. Bakhshi and Y. B. Jun: Fuzzy congruence relations
on hyper BCK-algebras, J. Fuzzy Math. 13 (2005), 627 636.
[4] R.A. Borzooei and H. Harizavi: Regular congruence relations on hyper
BCK-algebras, Sci. Math. Jpn. 61 (2005), 83 97.
[5] P. Corsini: Prolegomena of Hypergroup Theory, Aviani Editore, 1993.
[6] H. Hedayati and R. Ameri: Some equivalent conditions on fuzzy hypergroups, 32nd Iranian Math. Confer. 2002, Babolsar, Iran (to appear).
[7] Y. Imai and K. Iski: On axiom systems of propositional calculi XIV, Proc.
Japan Academy 42 (1966), 19 22.
[8] S. Ioudilis: Polygroups et certaines de leurs properetes, Bull. Greek Math.
Soc. 22 (1981), 95 104.
[9] J. Jantosciak: Transposition hypergroups: Noncommutative join spaces, J.
Algebra 187 (1997), 97 119.
[10] Y. B. Jun and X. L. Xin: Scalar elements and hyperatoms of hyper BCK algebras, Sci. Math. 2 (1999), 303 309.
[11] Y. B. Jun, M. M. Zahedi, X. L. Xin and R. A. Borzooei: On Hyper
BCK-algebras, Ital. J. Pure Appl. Math. 10 (2000), 127 136.
[12] J. P. Kim and D. R. Bae: Fuzzy congruences in groups, Fuzzy Sets and
Systems, 85 (1997), 115 120.
[13] F. Marty: Sur une generalization de la notion de groups, 8th congress Math.
Scandinaves, Stockholm (1934), 45 49.
[14] H. T. Nguyen and E. A. Walker: A First Course in Fuzzy Logic, 3rd
Edition, Chapman and Hall/ CRC, 2006.
[15] R. Rosenfeld: Fuzzy groups, J. Math. Anal. Appl. 35 (1971), 512 517.
[16] L. A. Zadeh: Fuzzy sets, Information and Control 8 (1965), 338 353.

232

R. Ameri, M. Bakhshi, S. A. Nematollah Zadeh and R. Borzooei

Received March 10, 2007

R. Ameri: Department of Mathematics, Mazandaran University, Babolsar, Iran
E-mail: rez ameri@yahoo.com
M. Bakhshi: Department of Mathematics, Bojnord University, Bojnord, Iran
E-mail:bakhshimahmood@yahoo.com
S. A. Nematollah Zadeh Department of Mathematics, Payam Nour University, Bam,
Iran
R. A. Borzooei: Department of Mathematics, Shahid Beheshti University, Tehran,
Iran
E-mail:borzooei@sbu.ac.ir