ROUGH SET THEORY APPLIED TO

HYPER BCI-ALGEBRA

RIZALYN S. BONGCAWEL
Researcher
GAUDENCIO C. PETALCORIN, JR., Ph.D.
Adviser

October 2, 2018

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 1 / 23

Fundamental Concepts

Definition 1
Let H be a nonempty set and P ∗ (H) be the set of all non-empty
subsets of H. A hyperoperation on H is a map from H × H into
P ∗ (H).

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 2 / 23

Fundamental Concepts

Definition 1
Let H be a nonempty set and P ∗ (H) be the set of all non-empty
subsets of H. A hyperoperation on H is a map from H × H into
P ∗ (H).

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 2 / 23

Fundamental Concepts

Definition 1
Let H be a nonempty set and P ∗ (H) be the set of all non-empty
subsets of H. A hyperoperation on H is a map from H × H into
P ∗ (H).

Definition 2
Let ~ be a hyperoperation on H and (x, y) ∈ H × H. Then its
image under ~, denoted by x ~ y, is called the hyperproduct of x
and y.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 2 / 23

Definition 3
If A and B are nonempty subsets of H, then A ~ B is given by
[
A~B = a ~ b.
a∈A,b∈B

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 3 / 23

Definition 3
If A and B are nonempty subsets of H, then A ~ B is given by
[
A~B = a ~ b.
a∈A,b∈B

Definition 4
Define P (H) to be the power set of H and P ∗ (H) = P (H) \ {∅}.
A hyperoperation on a nonempty set H is a function
~ : H × H → P ∗ (H). The value (x, y) ∈ H × H under ~ is
defined by x ~ y. If x ∈ H and ∅ 6= A, B ⊆ H, then

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 3 / 23

Definition 3
If A and B are nonempty subsets of H, then A ~ B is given by
[
A~B = a ~ b.
a∈A,b∈B

Definition 4
Define P (H) to be the power set of H and P ∗ (H) = P (H) \ {∅}.
A hyperoperation on a nonempty set H is a function
~ : H × H → P ∗ (H). The value (x, y) ∈ H × H under ~ is
defined by x ~ y. If x ∈ H and ∅ 6= A, B ⊆ H, then
[
(i.) A ~ B = a ~ b;
a∈A,b∈B

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 3 / 23

Definition 3
If A and B are nonempty subsets of H, then A ~ B is given by
[
A~B = a ~ b.
a∈A,b∈B

Definition 4
Define P (H) to be the power set of H and P ∗ (H) = P (H) \ {∅}.
A hyperoperation on a nonempty set H is a function
~ : H × H → P ∗ (H). The value (x, y) ∈ H × H under ~ is
defined by x ~ y. If x ∈ H and ∅ 6= A, B ⊆ H, then
[
(i.) A ~ B = a ~ b;
a∈A,b∈B
(ii.) A ~ x = A ~ {x} and x ~ B = {x} ~ B.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 3 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,
(HBC2 ) (x ~ y) ~ z = (x ~ z) ~ y,

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,
(HBC2 ) (x ~ y) ~ z = (x ~ z) ~ y,
(HBC3 ) x  x,

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,
(HBC2 ) (x ~ y) ~ z = (x ~ z) ~ y,
(HBC3 ) x  x,
(HBC4 ) x  y and y  x imply x = y,

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,
(HBC2 ) (x ~ y) ~ z = (x ~ z) ~ y,
(HBC3 ) x  x,
(HBC4 ) x  y and y  x imply x = y,
(HBC5 ) 0 ~ (0 ~ x)  x, x 6= 0,

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,
(HBC2 ) (x ~ y) ~ z = (x ~ z) ~ y,
(HBC3 ) x  x,
(HBC4 ) x  y and y  x imply x = y,
(HBC5 ) 0 ~ (0 ~ x)  x, x 6= 0,
where x  y if and only if 0 ∈ x ~ y and for any A, B ⊆ H,
A  B if and only if for any a ∈ A, there exists b ∈ B such that
a  b.  is called a hyper order on H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 5
Let H be a nonempty set and ~ be a hyperoperation on H. Then
(H, ~, 0) is called a hyper BCI-algebra, if 0 ∈ H and the following
conditions hold for all x, y, z ∈ H:
(HBC1 ) ((x ~ z) ~ (y ~ z))  x ~ y,
(HBC2 ) (x ~ y) ~ z = (x ~ z) ~ y,
(HBC3 ) x  x,
(HBC4 ) x  y and y  x imply x = y,
(HBC5 ) 0 ~ (0 ~ x)  x, x 6= 0,
where x  y if and only if 0 ∈ x ~ y and for any A, B ⊆ H,
A  B if and only if for any a ∈ A, there exists b ∈ B such that
a  b.  is called a hyper order on H. Let x ∈ H and A ⊆ H.
x  A implies {x}  A. Similarly, A  x implies A  {x}.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 4 / 23

Definition 6
Let (H, ~, 0) be a hyper BCI-algebra and let S be a subset of H
containing 0. If S is a hyper BCI-algebra with respect to the
hyperoperation ~ on H, we say that S is a hyper BCI-subalgebra
of H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 5 / 23

Definition 6
Let (H, ~, 0) be a hyper BCI-algebra and let S be a subset of H
containing 0. If S is a hyper BCI-algebra with respect to the
hyperoperation ~ on H, we say that S is a hyper BCI-subalgebra
of H.

Definition 7
Let I be a non-empty subset of a hyper BCI-algebra H. Then I is
said to be a hyper BCI-ideal of H if

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 5 / 23

Definition 6
Let (H, ~, 0) be a hyper BCI-algebra and let S be a subset of H
containing 0. If S is a hyper BCI-algebra with respect to the
hyperoperation ~ on H, we say that S is a hyper BCI-subalgebra
of H.

Definition 7
Let I be a non-empty subset of a hyper BCI-algebra H. Then I is
said to be a hyper BCI-ideal of H if
(1.) 0 ∈ S

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 5 / 23

Definition 6
Let (H, ~, 0) be a hyper BCI-algebra and let S be a subset of H
containing 0. If S is a hyper BCI-algebra with respect to the
hyperoperation ~ on H, we say that S is a hyper BCI-subalgebra
of H.

Definition 7
Let I be a non-empty subset of a hyper BCI-algebra H. Then I is
said to be a hyper BCI-ideal of H if
(1.) 0 ∈ S

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 5 / 23

Definition 6
Let (H, ~, 0) be a hyper BCI-algebra and let S be a subset of H
containing 0. If S is a hyper BCI-algebra with respect to the
hyperoperation ~ on H, we say that S is a hyper BCI-subalgebra
of H.

Definition 7
Let I be a non-empty subset of a hyper BCI-algebra H. Then I is
said to be a hyper BCI-ideal of H if
(1.) 0 ∈ S
(2.) (x ~ y)  I and y ∈ I imply x ∈ I , for all x, y ∈ X.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 5 / 23

Definition 8
Let θ be an equivalence relation on a hyper BCI-algebra H and
A, B ⊆ H. Then

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 6 / 23

Definition 8
Let θ be an equivalence relation on a hyper BCI-algebra H and
A, B ⊆ H. Then

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 6 / 23

Definition 8
Let θ be an equivalence relation on a hyper BCI-algebra H and
A, B ⊆ H. Then
(i.) AθB if there exist a ∈ A and b ∈ B such that aθb ;

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 6 / 23

Definition 8
Let θ be an equivalence relation on a hyper BCI-algebra H and
A, B ⊆ H. Then
(i.) AθB if there exist a ∈ A and b ∈ B such that aθb ;
(ii.) AθB if for all a ∈ A , there exists b ∈ B such that aθb and for
all b ∈ B there exist a ∈ A such that aθb;

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 6 / 23

Definition 8
Let θ be an equivalence relation on a hyper BCI-algebra H and
A, B ⊆ H. Then
(i.) AθB if there exist a ∈ A and b ∈ B such that aθb ;
(ii.) AθB if for all a ∈ A , there exists b ∈ B such that aθb and for
all b ∈ B there exist a ∈ A such that aθb;
(iii.) θ is called a congruence relation on H, if whenever xθy and
x0 θy 0 , then we have (x ~ x0 ) θ (y ~ y 0 ) , ∀x,y,x0 , y 0 ∈ H

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 6 / 23

Definition 8
Let θ be an equivalence relation on a hyper BCI-algebra H and
A, B ⊆ H. Then
(i.) AθB if there exist a ∈ A and b ∈ B such that aθb ;
(ii.) AθB if for all a ∈ A , there exists b ∈ B such that aθb and for
all b ∈ B there exist a ∈ A such that aθb;
(iii.) θ is called a congruence relation on H, if whenever xθy and
x0 θy 0 , then we have (x ~ x0 ) θ (y ~ y 0 ) , ∀x,y,x0 , y 0 ∈ H
(iv.) θ is called a regular congruence relation on H, if θ is a
congruence relation on H and whenever (x ~ y)θ{0} and
(y ~ x)θ{0} , then we have xθy , ∀x, y ∈ H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 6 / 23

Lemma

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 7 / 23

Lemma
(1.) Let θ be an equivalence relation on H and A, B ⊆ H. If AθB
and BθC, then AθC.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 7 / 23

Lemma
(1.) Let θ be an equivalence relation on H and A, B ⊆ H. If AθB
and BθC, then AθC.
(2.) Let θ be an equivalence relation on H. Then the ff. are
equivalent:

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 7 / 23

Lemma
(1.) Let θ be an equivalence relation on H and A, B ⊆ H. If AθB
and BθC, then AθC.
(2.) Let θ be an equivalence relation on H. Then the ff. are
equivalent:

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 7 / 23

Lemma
(1.) Let θ be an equivalence relation on H and A, B ⊆ H. If AθB
and BθC, then AθC.
(2.) Let θ be an equivalence relation on H. Then the ff. are
equivalent:

(i.) θ is a congruence relation on H

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 7 / 23

Lemma
(1.) Let θ be an equivalence relation on H and A, B ⊆ H. If AθB
and BθC, then AθC.
(2.) Let θ be an equivalence relation on H. Then the ff. are
equivalent:

(i.) θ is a congruence relation on H

(ii.) If xθy, then (x ~ a)θ(y ~ a) and (a ~ x)θ(a ~ y), ∀x, y ∈ H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 7 / 23

Theorem
Let θ be an equivalence relation on a hyper BCI-algebra H. Then
I = [0]θ is a hyper BCI-ideal of H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 8 / 23

Definition 9
For an approximation space (U, θ) , by a rough approximation in
(U, θ) we mean a mapping P (X) : P (U ) → P (U ) × P (U ) defined
for every X ∈ P (U ) by P (X) = (P (X), P (X)) , where

P (X) = {x [x]p ⊆ X}

P (X) = {x [x]p ∩X6= ∅}, called the lower rough approximation

and upper rough approximation of (U, θ), respectively.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 9 / 23

Definition 10
Given an approximation space (U, θ), a pair
(A, B) ∈ P (U ) × P (U ) is called a rough set in (U, θ) if and only if
(A, B) = P (X) for some X ∈ P (U ).

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 10 / 23

Definition 11
Let (U, θ) be an approximation space and X be a non-empty
subset of U .

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 11 / 23

Definition 11
Let (U, θ) be an approximation space and X be a non-empty
subset of U .
(i.) If P (X) = P (X)) , then X is definable.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 11 / 23

Definition 11
Let (U, θ) be an approximation space and X be a non-empty
subset of U .
(i.) If P (X) = P (X)) , then X is definable.
(ii.) If P (X) = φ , then X is called empty interior.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 11 / 23

Definition 11
Let (U, θ) be an approximation space and X be a non-empty
subset of U .
(i.) If P (X) = P (X)) , then X is definable.
(ii.) If P (X) = φ , then X is called empty interior.
(iii.) If P (X) = U , then X is called empty interior.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 11 / 23

Rough Hyper BCI-Algebra

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra
Let φ be an equivalence relation on a hyper BCI-Algebra H

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra
Let φ be an equivalence relation on a hyper BCI-Algebra H and
A be a non-empty subset of H with x ∈ A.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra
Let φ be an equivalence relation on a hyper BCI-Algebra H and
A be a non-empty subset of H with x ∈ A.We define [x]φ to be
the equivalence classes of x.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra
Let φ be an equivalence relation on a hyper BCI-Algebra H and
A be a non-empty subset of H with x ∈ A.We define [x]φ to be
the equivalence classes of x.The sets P (A) = {x [x]φ ⊆ A}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra
Let φ be an equivalence relation on a hyper BCI-Algebra H and
A be a non-empty subset of H with x ∈ A.We define [x]φ to be
the equivalence classes of x.The sets P (A) = {x [x]φ ⊆ A}and
P (A) = {x [x]φ ∩A6= ∅}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Rough Hyper BCI-Algebra
Let φ be an equivalence relation on a hyper BCI-Algebra H and
A be a non-empty subset of H with x ∈ A.We define [x]φ to be
the equivalence classes of x.The sets P (A) = {x [x]φ ⊆ A}and
P (A) = {x [x]φ ∩A6= ∅}are the lower and upper approximation of
a hyper BCI-algebra H respectively.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 12 / 23

Example
Let H = {0, 1, 2, 3}. Define the hyperoperation “~” by the Cayley
table shown below.
~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 13 / 23

Example
Let H = {0, 1, 2, 3}. Define the hyperoperation “~” by the Cayley
table shown below.
~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

Define a relation θ on H by

θ = {(0, 0), (0, 1), (1, 0), (1, 1), (2, 2), (3, 3)}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 13 / 23

Verify that θ is a regular congruence relation.We need to show
that

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 14 / 23

Verify that θ is a regular congruence relation.We need to show
that
(i.) (x ~ y)θ{0}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 14 / 23

Verify that θ is a regular congruence relation.We need to show
that
(i.) (x ~ y)θ{0}
(ii.) (y ~ x)θ{0}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 14 / 23

 Verify that θ is a regular congruence relation.We need to show
that
(i.) (x ~ y)θ{0}
(ii.) (y ~ x)θ{0}
(iii.) xθy

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 14 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

Choose x = 0 and y = 1.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 15 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 16 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

i. (x ~ y)θ{0}

(0 ~ 1) ~ {0} = {0, 1} ~ {0}

= (0, 0) ∪ (1, 0)
= {0} ∪ {1}
= {0, 1} ∈ θ

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 16 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 17 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

ii. (y ~ x)θ{0}

(1 ~ 0) ~ {0} = {1} ~ {0}

= {1} ∈ θ

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 17 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 18 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

iii. (x ~ y)
(0 ~ 1) = {0, 1} ∈ θ .

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 18 / 23

 ~ 0 1 2 3
0 {0, 1} {0, 1} {0, 1} {0, 1}
1 {1} {0, 1} {0, 1} {0, 1}
2 {2} {2} {0, 1, 2} {0, 1, 2}
3 {3} {3} {3} {0, 1, 3}

iii. (x ~ y)
(0 ~ 1) = {0, 1} ∈ θ .

Therefore, it is a regular congruence relation on H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 18 / 23

We have,

I = [0]θ = {0, 1}
I1 = [1]θ = {0, 1}
I2 = [2]θ = {2}
I3 = [3]θ = {3}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 19 / 23

We have,

I = [0]θ = {0, 1}
I1 = [1]θ = {0, 1}
I2 = [2]θ = {2}
I3 = [3]θ = {3}

So, I = I1 , I2 and I3 are equivalence classes on H.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 19 / 23

Now, we let A = {1, 2} and B = {0, 2}. Then,

P (A) = {x ∈ H [I]x ⊆ A} = {2}

P (A) = {x ∈ H [I]x ∩ A 6= ∅} = {0, 1, 2}
P (B) = {x ∈ H [I]x ⊆ B} = {2}
P (B) = {x ∈ H [I]x ∩ B 6= ∅} = {0, 1, 2}

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 20 / 23

Statement of the Problem

This paper seeks to apply the concept of Rough Set Theory to

Hyper BCI-algebra and introduce concepts of Rough Hyper
BCI-algebra , its properties and characterizations.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 21 / 23

Objectives of the Study

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 22 / 23

Objectives of the Study

(1.) to introduce the concept of rough hyper BCI-algebra and

other related concepts and investigate some of their
properties.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 22 / 23

Objectives of the Study

(1.) to introduce the concept of rough hyper BCI-algebra and

other related concepts and investigate some of their
properties.
(2.) to establish new properties of rough hyper BCI-ideal and
rough hyper sub-algebra.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 22 / 23

Objectives of the Study

(1.) to introduce the concept of rough hyper BCI-algebra and

other related concepts and investigate some of their
properties.
(2.) to establish new properties of rough hyper BCI-ideal and
rough hyper sub-algebra.
(3.) to introduce the notions of lower and upper approximation of
a subset of a hyper BCI-algebra with respect to a hyper
BCI-ideal.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 22 / 23

Significance of the Study

Complications in data interpretation arise with vague and

imprecise data. The rough set concept is a relatively new
mathematical approach to vagueness and uncertainty in data. It
is a well-understood formal framework for building data mining
models in the form of logic rules, on the basis of which it is
possible to issue predictions that allow classifying new cases.At
present, the study of rough set theory is rapidly progressing. As
such, the result of this paper may serve as a guide for further
investigations on rough set theory.

RIZALYN S. BONGCAWEL ROUGH HYPER BCI-ALGEBRA October 2, 2018 23 / 23