Scribd
Upload
79 views

Boolean Algebra

Boolean algebra provides operations and rules for working with the set {0,1}. It uses three main operations: complementation, the Boolean sum (denoted by + or OR), and the Boolean product (denoted by · or AND). Some key identities of Boolean algebra include the distributive law where x(y + z) = xy + xz, the absorption law where x(x + y) = x, and duality which obtains the dual of an expression by interchanging sums and products and 0s and 1s. Examples are provided to demonstrate working with Boolean expressions and translating between algebraic and logical representations.

Uploaded by

Ellen Mae Olaguer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
79 views

Boolean Algebra

Boolean algebra provides operations and rules for working with the set {0,1}. It uses three main operations: complementation, the Boolean sum (denoted by + or OR), and the Boolean product (denoted by · or AND). Some key identities of Boolean algebra include the distributive law where x(y + z) = xy + xz, the absorption law where x(x + y) = x, and duality which obtains the dual of an expression by interchanging sums and products and 0s and 1s. Examples are provided to demonstrate working with Boolean expressions and translating between algebraic and logical representations.

Uploaded by

Ellen Mae Olaguer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Boolean Algebra

Boolean algebra provides the operations and the rules for working with
the set {0,1}. Electronic and optical switches can be studied using this
set and the rules of Boolean algebra. The three operations in Boolean
algebra that we will use most are complementation, the Boolean sum,
and the Boolean product. The complement of an element, denoted with
a bar, is defined by 0 = 1 and 1 = 0. The Boolean sum, denoted by “ + ”
or by OR, has the following values:
1+1=1 1+0=1 0+1=1 0+0=0
The Boolean product, denoted by “ · ” or by AND, has the following
values:
1·1=1 1·0=0 0·1=0 0·0=0
EXAMPLE 1
Find the value of 1 · 0 + (0 + 1)

1 · 0 + (0 + 1) =0+1
=0+0
=0
EXAMPLE 2
Translate 1 · 0 + (0 + 1) = 0 into a logical equivalence.

(T ∧ F) ∨ (F ∨ T) = F
EXAMPLE 3
Translate the logical equivalence (T ∧ T) ∨ F = T into an identity in
Boolean algebra.

(1 · 1) + 0 = 1
EXAMPLE 4
The function F(x,y) = xy from the set of ordered pairs of Boolean
variables to the set {0,1} with F(1,1)=0, F(1,0)=1, F(0,1)=0, and
F(0,0)=0
EXAMPLE 5
Find the values of the Boolean function represented by F(x,y,z)=xy + z
Identities of Boolean Algebra
EXAMPLE 6
Show that the distributive law x(y + z) = xy + xz is valid.
EXAMPLE 7
Translate the distributive law x + yz = (x + y)(x + z) into a logical
equivalence.

p ∨ (q ∧ r) = (p ∨ q) ∧ (p ∨ r)
EXAMPLE 8
Prove the absorption law x(x + y) = x using the other identities of
Boolean algebra.

x(x + y) = (x + 0)(x + y) Identity law for the Boolean sum

=x+0·y Distributive law of the Boolean sum over the


Boolean product
=x+y·0 Commutative law for the Boolean product

=x+0 Domination law for the Boolean product

=x Identity law for the Boolean sum


Duality
The dual of a Boolean expression is obtained by interchanging Boolean
sums and Boolean products and interchanging 0s and 1s.

Ex. 9: Find the duals of x(y + 0) and x · 1 + (y + z)

Interchanging · signs and + signs and interchanging 0s and 1s in these


expressions produces their duals.
x(y + 0) = x + (y · 1)
x · 1 + (y + z) = (x + 0)(y z)

You might also like