Scribd
Upload
2 views25 pages

Lesson 5.1 Boolean Algebra

Boolean algebra is a mathematical structure that operates on binary values (0 and 1) and is fundamental in computer circuits and electronic devices. It defines operations such as complementation, Boolean sum (OR), and Boolean product (AND), which correspond to logical operators. The document also provides examples of Boolean functions and exercises to illustrate their application.

Uploaded by

ediwow1eh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views25 pages

Lesson 5.1 Boolean Algebra

Boolean algebra is a mathematical structure that operates on binary values (0 and 1) and is fundamental in computer circuits and electronic devices. It defines operations such as complementation, Boolean sum (OR), and Boolean product (AND), which correspond to logical operators. The document also provides examples of Boolean functions and exercises to illustrate their application.

Uploaded by

ediwow1eh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

BOOLEAN ALGEBRA

IT3 – Discrete Structures


Boolean Algebra

• Circuits in computers and electronic devices use binary


inputs and outputs (0 or 1).

• They are built using basic elements with two distinct


states, such as switches (on /off ) or optical devices
(lit /unlit).
Boolean Algebra

Represented by 0 Represented by 1
Boolean Functions

• Boolean algebra defines operations and rules for the


binary set {0, 1}.

• It is used to study electronic and optical switches.

• The main operations are: complementation, Boolean


sum (OR), and Boolean product (AND)
Boolean Functions

The main operations are:

• Complementation: 0
ഥ = 1, ഥ1 = 0

• Boolean sum (OR): denoted by + or OR

• Boolean product (AND): denoted by “ ∙ ” or AND


Boolean Functions

The Boolean sum is denoted by + or OR.

• 1 + 1 =

• 1 + 0 =

• 0 + 1 =

• 0 + 0 =
Boolean Functions

The Boolean sum is denoted by + or OR.

• 1 + 1 = 1

• 1 + 0 = 1

• 0 + 1 = 1

• 0 + 0 = 0
Boolean Functions

The Boolean product is denoted by “ ∙ ” or AND.

• 1 ∙ 1 =

• 1 ∙ 0 =

• 0 ∙ 1 =

• 0 ∙ 0 =
Boolean Functions

The Boolean product is denoted by “ ∙ ” or AND.

• 1 ∙ 1 = 1

• 1 ∙ 0 = 0

• 0 ∙ 1 = 0

• 0 ∙ 0 = 0
Boolean Functions

• Please take note that the symbol “⋅” can be deleted,


just as writing algebraic products.

A ⋅ B = AB
Example 1

• Find the value of 1 ∙ 0 + (0 + 1)


Boolean Functions

• The complement, Boolean sum, and Boolean product


correspond to the logical operators, ¬ , ∨, and ∧,
respectively.

• Also, 0 corresponds to F (false) and 1 corresponds to T


(true).
Example 2

• Translate 1 ∙ 0 + (0 + 1) = 0, the equality founds


in example 1, into a logical equivalence.
Example 3

• Translate the logical equivalence:

(T ∧ T) v ¬F ≡ 𝑇
Boolean Expressions and Boolean Functions

• Let B = {0, 1}. Then B n = {(x 1 , x 2 ,..., x n )} | x i ∈ B


for 𝟏 ≤ 𝒊 ≤ 𝒏} is the set of all possible n-tuples of 0s
and 1s.

• The variable x is called a Boolean variable if it


assumes values from B, if its only possible values are 0
and 1.
Boolean Expressions and Boolean Functions

• A function from B n to B is called Boolean


function of degree n.
Example 4

• The function 𝑭 𝒙, 𝒚 = 𝒙 𝒚
ഥ
from the set of ordered pairs
of Boolean variables to the
set {0, 1} is a Boolean
function of degree 2.
Example 5

• Find the values of the Boolean function


represented by 𝑭 𝒙, 𝒚, 𝒛 = 𝒙𝒚 + ഥ
𝒛
Example 5
Find the values of the
Boolean function
represented by

ഥ
𝑭 𝒙, 𝒚, 𝒛 = 𝒙𝒚 + 𝒛
Example 5
Find the values of the
Boolean function
represented by

ഥ
𝑭 𝒙, 𝒚, 𝒛 = 𝒙𝒚 + 𝒛
Example 5
Find the values of the
Boolean function
represented by

ഥ
𝑭 𝒙, 𝒚, 𝒛 = 𝒙𝒚 + 𝒛
Example 5
Find the values of the
Boolean function
represented by

ഥ
𝑭 𝒙, 𝒚, 𝒛 = 𝒙𝒚 + 𝒛
Exercise 5.1

Use a table to express the values of each of these Boolean


functions.
• 𝐹 𝑥 , 𝑦 = 𝑥ത 𝑦
• 𝐹 𝑥 , 𝑦, 𝑧 = 𝑥 + 𝑦𝑧

• 𝐹 𝑥 , 𝑦, 𝑧 = 𝑥 𝑦
ഥ + (𝑥𝑦𝑧)
• 𝐹 𝑥 , 𝑦, 𝑧 = 𝑥 (𝑦𝑧 + 𝑦
ഥ𝑧)
ത
Exercise 5.1 (Answer)
Exercise 5.1 (Answer)

You might also like