Scribd
Upload
25 views

Boolean Algebra - Show 2

1) Boolean algebra is a system with two operators (AND and OR) and two elements (0 and 1). 2) It has six postulates defining the basic operations and properties of Boolean algebra. 3) Theorems in Boolean algebra prove identities and properties like idempotency, absorption, involution, and De Morgan's theorem.

Uploaded by

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

Boolean Algebra - Show 2

1) Boolean algebra is a system with two operators (AND and OR) and two elements (0 and 1). 2) It has six postulates defining the basic operations and properties of Boolean algebra. 3) Theorems in Boolean algebra prove identities and properties like idempotency, absorption, involution, and De Morgan's theorem.

Uploaded by

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

Boolean Algebra

November 21, 2023 Digital Logic Design - Adnan Haj 1


Basic Definitions

November 21, 2023 Digital Logic Design - Adnan Haj 2


Postulate 1
Definition

A is a closed algebraic system


containing:

a set of two or more


elements

and the two operators


(and

November 21, 2023 Digital Logic Design - Adnan Haj 3


Postulate 1
Definition

For every and in set , and

( is called and is called ).

November 21, 2023 Digital Logic Design - Adnan Haj 4


Postulate 2
Existence of 1 and 0 elements

There exist unique elements (one) and (zero) in set


such that for every in :
(a)
(b)

 0 is the identity element for the “+” operation.


 1 is the identity element for the “*” operation.

November 21, 2023 Digital Logic Design - Adnan Haj 5


Postulate 3
Commutative Property

For every and in ,


(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 6


Postulate 4
Associative Property

For every , , and in ,


(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 7


Postulate 5
Distributive Property

For every , , and in ,


(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 8


Postulate 6
Existence of the complement

For every in there exists a unique element called


(complement of ) such that:
(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 9


November 21, 2023 Digital Logic Design - Adnan Haj 10
Remark

• To simplify notation, the (.) or (*) operator is


frequently omitted.
• When two elements are written next to each
other, the AND (.) operator is implied…

November 21, 2023 Digital Logic Design - Adnan Haj 11


Duality

If an expression is valid in
Boolean algebra,

the dual of that expression is also


valid.

November 21, 2023 Digital Logic Design - Adnan Haj 12


Duality

To form the dual of an expression

replace all “+” operators with “.” operators

all “.” operators with “+” operators

all ones with zeros

and all zeros with ones.

November 21, 2023 Digital Logic Design - Adnan Haj 13


Duality

• Form the dual of the expression

• Following the replacement rules…

• Take care not to alter the location of the


parentheses if they are present.
November 21, 2023 Digital Logic Design - Adnan Haj 14
Theorem 1
Idempotency

(a)
(b)

 To prove the first half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 15


Theorem 1
Idempotency

(a)
(b)

 To prove the second half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 16


Theorem 2
Null elements for + and . operators

(a)
(b)

 To prove the first half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 17


Theorem 2
Null elements for + and . operators

(a)
(b)

 To prove the second half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 18


Theorem 3
Involution

 This theorem states:

 Remember that and .


– Therefore, is the complement of and is also
the complement of .
– As the complement of is unique, it follows that .

 Taking the double inverse of a value will give the


initial value.

November 21, 2023 Digital Logic Design - Adnan Haj 19


Theorem 4
Absorption

(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 20


Theorem 4
Absorption

(a)
(b)

 To prove the second half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 21


Theorem 5
Similar to Absorption

(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 22


Theorem 5
Similar to Absorption

(a)
(b)

 To prove the second half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 23


Theorem 6
Similar to Absorption

(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 24


Theorem 6
Similar to Absorption

(a)
(b)

 To prove the second half of this theorem:

November 21, 2023 Digital Logic Design - Adnan Haj 25


Theorem 8
De Morgan’s Theorem

(a)
(b)

November 21, 2023 Digital Logic Design - Adnan Haj 26


November 21, 2023 Digital Logic Design - Adnan Haj 27
De Morgan’s Theorem

• Complement the expression


and simplify.

November 21, 2023 Digital Logic Design - Adnan Haj 28


November 21, 2023 Digital Logic Design - Adnan Haj 29
OR

November 21, 2023 Digital Logic Design - Adnan Haj 30

You might also like