Boo lean Algebra,
Def A boolean algebra (Bt = as) is a beH,
wt tue dinar: © fera-tors; ty 7) Oke UNAL,
opeceten ~) and tw elements o1 eS with The
(low 29 prepertes :
tee, exists at least to Clements abe f
2 VYajb 26, arb 28, a-b ef (Closure)
3. abeS, atbebra, @-b=b-a C Ommutative.)
4 aed ay024, ahs CDden tity)
s Yabce_B 4 be c)= aH VE .
Ya,bce 4 OS. Cant) (abe) COstibshe)
c. Yaef, daed wh ee (Complement)
% fa, be eB at Chr? = Cath} ¢ Associative)
Qe Core eo
(arbre
Boo lean algebras we have studied 2
6 iHP3 MX)
+ v U
. A an
= 7 a)
Fe
o
1 T a
Pines le of Dualit
Cuecy property 2. tteorem has a dual prperty
oe Clintérchange +.and +, interchange”
© and :theorems or all boolean algebras
“Thm Vaes Q4Q=a Dual (a.a=a@)
Q4a= fre 4 Dolentity
= @ra)-(at+a Conmplenerst
= atrag Dishdhe
= Qatro Complement
=. oo Tdeatty
Ahn ~ae8 Q+l2a bual (4:9 Dp)
“thy
Atl = Qe 4 Ldenhty
= (+t): a) Coaplement
2 a+ra Disk. bute
= Qra@ Telentiry
\ Complemen-}
- BArab Tdeat ty
arab =
c a-Citb) Dist bt ve
2a hm atl= 1
2 @ Ldentity
VabeB arab zarh Dia) a.(a+b)=4-b
a+ Hb2 Q+a): (ate) Dish brie
= J4- (a+b) Com-plenecl
= arth TolentitgBoo lean Functions
Cons idler the boo lean algebra
Cine Vv 7-7 F) but use te. nota tian
CLreh t,79 79 Lo (pe {,3)
Det A boolean fuaction of nN Variables
Puncton ft: B38 where >= £203 SQ
b* {O6t-¥0) | Keb, 1 22n 3
Pov ye)= BY+ =z
ars ae nt ae determine the.
Testa t)= Yi Chaska) WM 4 Th
Fhut)= Tes he
Standardired Farm for bea lean factions
“Def A literal is a beolean variable or its
Coaplement : ae oe yx
A niaterm ot the’ Variobks Kis%) 2%
is a boolean Product of literals. Ute “°S,EX Two variables 1%
aie Qi literal for %, Yy literal fy BQ
Xye¥e :
anes Y minteras $r 2 Variabhs
Yeh O miateras bor n Vary ables
YX, %
here is a bijection betugen 9 tples ancl.
miaterns of A Vali ables
CS p S29 «= 5 Sn Yr Yor =n
TH Spel then Yor%e
Jere Hen Qe %
EX 60,0, 1) > Xie Xo* Kat Xe
(0,0) o)—> X, Kha My Xe
Mote: Kyo XsXar ks = 1 iff X20 HO Wake! Xs=O
Det Standardized form fe boolean EnctrenS
is called Sum of Modvets Farm or Dis yuachve
Normal Form CONE) and is the eOresertation
tHe Paction asa Sum ot mintevms: )
(unique op fe the arclering of miaterms
a Find He Sum ot products bra boa—
FG 2)= ery 2@ Caleviate He nee tub le.
o
@ Ldentity ea a- typles at which the
Punchiean “Is A
@ Form Se. minter mS Corfe span ding to Hee
ne ples and Sum:
Lys pge+ XS
se pede Ee Cour)
C we alse proved thet ever boolean
hip can be i accomplished ving Aisynchan
Con ju ection and neganeCireuds- physical agp lice hon of boolean Pactions
Cireuts made p ot gates:
. —
ee 5p “ry gy ao)
Allow ia design i
Braman HEP xen
ae Xp tkr tA ¥e Xp Xe
x3 Xa pou 3
Re present a cireat with a beolean Ruction:
x
]
2 7
D7Ly_ peanonsreo9
a)
Miningatoen of Cireuts /
Represent a Cireut by a boolean faction:
f :
Get valent b fact rth
mini mal “oaber of eemehA ee wi product
Cypiession -
Ch. (Meebraic me thedt ) _ a
F(t HEMT HUEY MaKe XX RG KRENS
KEK) AGW + YROHD
= ¥%%Q + KRG) + XiX3Q
= XX Xie le XiX3Karaaugh maps — Visualaid +o Pine crrauts-
x Every cell represents 4 minter~
x Tt “the cabelas : im
a produels Bren, iT ie bax. as
Ady acent cells cepresen| min te (ns
whick differ in enly one Variable, So
adjacent Cells car be coll
Lombine Q adjacent cells - eliminate 4 variable
4 ad) went cells - eliminate Q variebks
g adyaces| cells - eliminate F Var abks
Examples CTalen _ regrexented then b
up in Sum gf products form, Phen
o
colean Rach
ied i he Veleaagh mep
pave Lo6p2I