Rinaldi Munir/IF2151 Mat. Diskrit1
Aljabar Boolean
Bahan KuliahIF2151 Matematika Diskrit
Rinaldi Munir/IF2151 Mat. Diskrit2
Definisi Aljabar Boolean
Misalkan terdapat- Dua operator biner: + dan
⋅
- Sebuah operator uner: ’.-
B
: himpunan yang didefinisikan pada operator +,
⋅
, dan ’- 0 dan 1 adalah dua elemen yang berbeda dari
B
.Tupel(
B
, +,
⋅
, ’)disebut
aljabar Boolean
jika untuk setiap
a
,
b
,
c
∈
B
berlakuaksioma-aksioma atau postulat Huntington berikut:
Rinaldi Munir/IF2151 Mat. Diskrit3
1.
Closure
: (i)
a
+
b
∈
B
(ii)
a
⋅
b
∈
B
2. Identitas: (i)
a
+ 0 =
a
(ii)
a
⋅
1 =
a
3. Komutatif: (i)
a
+
b
=
b
+
a
(ii)
a
⋅
b
=
b
.
a
4. Distributif:(i)
a
⋅
(
b
+
c
) = (
a
⋅
b
) + (
a
⋅
c
)(ii)
a
+ (
b
⋅
c
) = (
a
+
b
)
⋅
(
a
+
c
)5. Komplemen
1
: (i)
a
+
a
’ = 1(ii)
a
⋅
a
’ = 0
Search History:
Result 00 of 00
00 results for result for
p.
Aljabar-Boolean.pdf
Perkuliahan Teknik Informatika ( Semester III )
4.3K
Reads
52
Readcasts
2
Embed Views
Get Scribd Mobile
To get Scribd mobile enter your number and we'll send you a link to the Scribd app for iPhone & Android.We've sent a link to the Scribd app. If you didn't receive it, try again.
We'll never share your phone number.
Recommended
More From This User
Notes
Load more
