Discrete Mathematics

Boolean Algebra
Member of group:
Luqyana Jasmine Lathifah
Puja Islami Putri
Racel Nur Aliyah
Ida Yulia Mariati Simatupang
 Table of contents
01 02 03
Definition of Function of Boolean Two valued Boolean
Boolean Algebra Algebra Algebra

04 05 06
Duality Principle in Laws of Boolean
Boolean Expression Boolean Algebra Algebra
 01
Definition of
Boolean Algebra
 Definiton of Boolean Algebra
Suppose there are: Things that must be
1. Two binary operators: + and ∙ considered to have a
2. A unary operator: '
Boolean algebra:
3. 𝐵 : set defined on operators +, ∙, and ’
4. 0 and 1 are two different elements of 𝐵.
1. The elements of set 𝐵
So the Tuple (𝐵, +,∙, ') is called a Boolean Algebra
if for each 𝑎, 𝑏, 𝑐 ∈ 𝐵 the Huntington's axioms or 2. Operational rules for
postulates apply. binary operators and
unary operators
 Huntington’s Axioms
Closure Identity Communicative
● 𝑎+𝑏∈𝐵 ● 𝑎+0=𝑎 ● 𝑎+𝑏=𝑏+𝑎
● 𝑎∙𝑏∈𝐵 ● 𝑎∙1=𝑎 ● 𝑎∙𝑏=𝑏.𝑎

Distributive Complement
● 𝑎 ∙ (𝑏 + 𝑐) = (𝑎 ∙ 𝑏) + (𝑎 ∙ 𝑐) ● 𝑎 + 𝑎’ = 1
● 𝑎 + (𝑏 ∙ 𝑐) = (𝑎 + 𝑏) ∙ (𝑎 + 𝑐) ● 𝑎 ∙ 𝑎’ = 0
 02
Function of
Boolean Algebra
 Boolean Function
● A Boolean function (also called a binary function) is a mapping from 𝐵^ 𝑛 to 𝐵 via a Boolean
expression, we write it as
𝑓∶𝐵
𝑛→𝐵
Which in this case 𝐵^𝑛 is a set consisting of n doubly ordered pairs (ordered n-tuple) in the
domain of origin 𝐵.

● Suppose a Boolean function is

𝑓(𝑥, 𝑦, 𝑧) = 𝑥𝑦 + 𝑥’𝑦𝑧 + 𝑦’𝑧
The function f maps the values of the double-3 ordered pair ( 𝑥, 𝑦, 𝑧) to the set {0,1}.
For example, (1, 1, 0) which means 𝑥 = 1, 𝑦 = 1, 𝑑𝑎𝑛 𝑧 = 0,
so that
𝑓(1, 1, 0) = 1 ∙ 1 + 1’ ∙ 1 ∙ 0 + 1’ ∙ 0 = 1 + 0 + 0 = 1 .
 Boolean Function
● Each variable in a Boolean function, including its complement form, is called 𝒍𝒊𝒕𝒆𝒓𝒂𝒍.

Example: Function ℎ(𝑥, 𝑦, 𝑧) = 𝑥’𝑦𝑧’

It consists of 3 literals, namely 𝑥', 𝑦, and 𝑧'.

● Every Boolean expression is nothing but a Boolean function.

● Another example of Boolean Function:

1. f(x) = x
2. f(x, y) = x’y + xy’+ y’
3. f(x, y) = x’ y’
4. f(x, y) = (x + y)’
5. f(x, y, z) = xyz’
 Example
Given the Boolean function f(x, y, z) = xy z', express h in the truth table.

Solution:
 03
Two Valued
Boolean Algebra
 Two Valued Boolean Algebra
● B = {0, 1}
● Binary operator: + and ∙
● Uner Operator: ’
● The rules for binary and uner operators are:
 Two Valued Boolean Algebra
Check if it fulfills Huntington's axioms: 3. Commutative:
1. Closure: (𝑖) 𝑎 + 𝑏 = 𝑏 + 𝑎
(𝑖) 𝑎 + 𝑏 ∈ 𝐵 1+0=0+1
(𝑖𝑖) 𝑎 ∙ 𝑏 ∈ 𝐵 (𝑖𝑖) 𝑎 ∙ 𝑏 = 𝑏 . 𝑎
2. Identity: 1∙ 0=0∙ 1
(𝑖) 𝑎 + 0 = 𝑎
1+0=1 4. Distributive
(𝑖𝑖) 𝑎 ∙ 1 = 𝑎 (𝑖) 𝑎 ∙ (𝑏 + 𝑐) = (𝑎 ∙ 𝑏) + (𝑎 ∙ 𝑐)
0∙1=0 (𝑖𝑖) 𝑎 + (𝑏 ∙ 𝑐) = (𝑎 + 𝑏) ∙ (𝑎 + 𝑐)
 Two Valued Boolean Algebra
(𝑖) 𝑎 ∙ (𝑏 + 𝑐) = (𝑎 ∙ 𝑏) + (𝑎 ∙ 𝑐)
 Two Valued Boolean Algebra
(𝑖𝑖) 𝑎 + (𝑏 ∙ 𝑐) = (𝑎 + 𝑏) ∙ (𝑎 + 𝑐)
 Two Valued Boolean Algebra
5. Complement

(i) a + a‘ = 1, because 0 + 0’= 0 + 1 = 1 and 1 + 1’= 1 + 0 = 1

(ii) a ∙ a = 0, because 0 ∙ 0’= 0 ∙ 1 = 0 and 1 ∙ 1’ = 1 ∙ 0 = 0

 04
Expressions and
Boolean Values
 Boolean expression
Suppose (𝐵, +,∙, ') is a Boolean algebra. A Boolean
expression in (𝐵, +,∙, ') is:
1. every element of B,
2. each variable,
3. if e1 and e2 are Boolean expressions,
then e1 + e2, e1 ∙e2, e1' are Boolean expressions
 Boolean expression
For example
0 a.b
1
a (a.b)+c’
b
c 𝑎’ + 𝑏 + 𝑎’ ∙ 𝑏 ∙ 𝑐’ ∙ 𝑏,
a+b dan sebagainya
 Quantity value Boolean
1. For example: (𝑎 ∙ 𝑏) + 𝑐’
if 𝑎 =1, 𝑏 =1 dan c=0
Then the result of the expression evaluation is:
(𝑎 ∙ 𝑏) + 𝑐’
= (1 ∙ 1) + 0
=(1 + 0)
=0
2. Two Boolean expressions are said to be equivalent (denoted by '=') if they
have the same value for any assignment of values to n variables.
For example: a + (b ∙ c) = (a + b) ∙ (a + c)
 Quantity value Boolean
For example: Show me that a + a’b = a + b
solution
Note: The dot (⋅) can be omitted
when writing Boolean expressions,
unless it is emphasized:
1. a(b + c) = ab + ac
2. a + bc = (a + b) (a + c)
3. a ⋅ 0 , not a0
 05
Duality Principle in
Boolean Algebra
 Duality Principle
Suppose S is an identity in boolean algebra involving AND, OR and COMPLEMENT
operators, then S* can be obtained from S by replacing
● OR (+) into AND (.)
● AND (.) into OR (+)
● 0 into 1
● 1 into 0
● Leaving the complement operator the same
 Duality Principle
Example :
1. S = a (b’c’ + bc)
S*= a + (b’+c’)(b+c)

2. S= (a . 1)(0 . a’) = 0
S* = (a + 0) + (1 + a’) = 1
 06
Laws of Boolean
Algebra
 Laws of Boolean Algebra
Identity Law Complement Law Idempotent Law
(i) a + 0 = a (i) a + a’ = 1 (i) a + a = a
(ii) a .1 = a (ii) a .a’ = 0 (ii) a .a = a

Dominant Law Involution Law Commutative Law

(i) a + 1 = 1 (i) (a’)’ = a (i) a + b = b + a
(ii) a .0 = 0 (ii) a .b = b . a
 Laws of Boolean Algebra
Associative Law Distributive Law Demorgan’s Law
(i) a + (b + c) = (a + b) + c (i) a . (b +c) = a . b + a . c (i) (a + b)’ = a’ b’
(ii) a . (b . c) = (a . b) . c (ii) a + b . c = (a + b).(a + (ii) (a . b)’ = a’ + b’
c)

Absorption Law 0/1 Law

(i) a + ab = a (i) 0’ = 1
(ii) a(a + b) = a (ii) 1’ = 0
 Laws of Boolean Algebra
Example :
Prove that for any elements a and b of Boolean algebra the following identity is true!
a + a’b = a + b and a(a’ + b) = ab
Solution :
(i) a + a’b = (a + ab) + a’b ( absorption law)
= a + (ab + a’b) ( associative law)
= a + (a + a’)b (distributive law)
= a+1.b (complement law)
=a+b (identity law)
 Laws of Boolean Algebra
(ii) adalah dual dari (i)
(ii) a(a’ + b) = aa’ + ab ( distributive law)
= 0 + ab (complement law)
= ab (identity law)
 Laws of Boolean Algebra
Dapat juga dibuktikan menggunakan tabel kebenaran.
Thankyou!
Any Question?