Scribd
Upload
4 views

Boolean Functions 1

Uploaded by

mallahzaib80
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Boolean Functions 1

Uploaded by

mallahzaib80
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

12/08/2024 Discrete Mathematics -- Presentation 1

Boolean Functions

24AI51
24AI24
24AI64
24AI67

12/08/2024 Discrete Mathematics -- Presentation 2


Introduction
• Boolean algebra is algebra of logic.
• It deals with variables that can have two discrete values.
– 0 (False)
– 1 (True)

12/08/2024 Discrete Mathematics -- Presentation 3


Boolean Functions
Boolean function is a branch of mathematics that deals with operations on logical
Values with binary variables.
The Boolean function variables are represented as binary numbers to represent truth:
1= true and 0= false .Elementary algebra deals with numerical operations whereas
Boolean algebra deals with logical operations.

The Basic operations of Boolean algebra are conjunction, disjunctions, and negation.
These Boolean operations are expressed with the corresponding binary
Operators AND and OR and the unary operators NOT collectively referred to as
Boolean operators .

12/08/2024 Discrete Mathematics -- Presentation 4


Introductions to Boolean Algebra
• Boolean Algebra has rule for working with elements from he set {0,1} together with
the operator (Boolean Sum ) +, (Boolean product) . , and ͞͞ (Complement) .
• These operators are defined by:
• Boolean Sum: 1+1=1, 1+0=1 , 0+1=1, 0+0=0.
• Boolean product: 1.1=1, 1.0=0, 0.1=0, 0.0=0.
• Complement: =1, = 0.

Example:1 find the value od 1.0 +


Solution: 1.0 + = 0+
=0+0
=0
12/08/2024 Discrete Mathematics -- Presentation 5
The complement, Boolean sum, and Boolean product correspond to the logical
operators ¬, ˄ ,and ˅ respectively , where 0 correspond to
F (false) and 1 correspond to T (true) Equalities in Boolean algebra can be
directly translated into equivalence of compound propositions

Example 2 Translate 1.0 + =0 , the equality found in example 1, into a


logical equivalence .

Solution :
we obtain a logical equivalence when we translate each 1 into T, each 0 into F ,
Boolean sum into a disjunction, each Boolean product into a conjunction , and
each complementation into negation. We obtain

(T˄F)˅¬(T˅F)≡F

12/08/2024 DISCRETE MATHEMATICS -- PRESENTATION 6


Example 3
Translate the logical equivalence (T˄T)˅¬F≡T into an identity in
Boolean algebra.
Solution we obtain an identity in Boolean algebra when we translate
each T into a 1. each F into a 0.each disjunction into a Boolean
sum ,each conjunction into a Boolean product and each negation into
a complementation . We obtain
(1.1)+ =1
1+1=1
Example 4
The function F(x,y)= x. from the set of ordered pairs of Boolean
variable {0,1} a Boolean function degree 2 with F(1,1)=0,7 F(1,0)=1,
F(0,1)=0, and F(0,0)=0, x y F(x,y)
TABLE 1 1 1 0
1 0 1
0 1 0
12/08/2024 Discrete Mathematics -- Presentation0 0 0
m
Example 5
find the value of the Boolean function represented by

F(x,y,z)= xy+

Solution
The value y in table 2 z
x of this displayed xy F(x,y,z)=xy+͞z
1 1 1 1 0 1

1 1 0 1 1 1

1 0 1 0 0 0

1 0 0 0 1 1

0 1 1 0 0 0

0 1 0 0 1 1

0 0 1 0 0 0

0 0 0 0 1 1
12/08/2024 Discrete Mathematics -- Presentation 9
Boolean Identites
Law of the double complement =x
Idemplent laws x+x=x
x.x=x
Domination laws x+0=x
x.0=x
Commutative laws x+y=y+x
Xy=yx
Associative law x+(y+z)=(x+y)+z
D x(yz)=(xy)z
Distributive laws x(y+z)=xy+xz
De morgan’s laws =x+y
=xy
Absorptions law x+xy=x
x(x+y)=x
Unit property x+=1
Zero property x= 0

12/08/2024 Discrete Mathematics -- Presentation 10


The End

12/08/2024 Discrete Mathematics -- Presentation 11

You might also like