Scribd
Upload
42 views4 pages

Postulates of Boolean Algebra and Theorem Proof

Boolean Algebra Postulates

Uploaded by

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

Postulates of Boolean Algebra and Theorem Proof

Boolean Algebra Postulates

Uploaded by

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

Postulates of Boolean Algebra

1. Identity Elements

o x +0=x (0 is the identity for OR)

o x ⋅1=x (1 is the identity for AND)

2. Complementation

o x + x '=1 (A variable ORed with its complement yields 1)

o x ⋅ x '=0 (A variable ANDed with its complement yields 0)

Here, x ' denotes the complement of x , where x '=1−x.


3. Commutativity
o x + y= y + x

o x ⋅ y= y ⋅ x

Both OR and AND operations are commutative.

4. Distributivity
o x ⋅ ( y+ z ) =( x ⋅ y ) + ( x ⋅ z )

o x + ( y ⋅ z ) =( x+ y ) ⋅ ( x + z )

5. Complement Laws
Restating postulate 2 for emphasis:
o x + x '=1

o x ⋅ x '=0

6. Existence of Two Distinct Elements

o There exist at least two elements 0 and 1 in the Boolean system.

Theorems of Boolean Algebra


Theorem 1: Idempotent Law

(a) x + x=x

(b) x ⋅ x =x
Proof of Theorem 1(a):
To prove x + x=x :
1. Using the identity law (Postulate 1):

x + x=( x + x ) ⋅1

2. Using the complement law (Postulate 2):

1=x + x ' ⟹ ( x + x )=( x + x ) ⋅ ( x + x ' )

3. Using the distributivity law (Postulate 4):

x + x=x + ( x ⋅ x ' )

4. Using the complement law (b) x ⋅ x ' =0 :

x + x=x +0
Since x +0=x (using identity law)
Proof of Theorem 1(b):
To prove x ⋅ x =x:
1. Using the identity law (Postulate 1):

x ⋅ x =( x ⋅ x ) +0

2. Using the complement law (Postulate 2):

'
0=x ⋅ x ⟹ ( x ⋅ x ) =( x ⋅ x ) + ( x ⋅ x ' )

3. Using the distributivity law (Postulate 4):

x ⋅ x =x ⋅ ( x + x ' )

4. Using x + x ' =1 by complement law (a):

x ⋅ x =x ⋅1
Since x ⋅1=x (using identity law)

Theorem 2: Annihilation Law



(a) x +1=1

(b) x ⋅ 0=0
Proof of Theorem 2(a):
To prove x +1=1:
1. Using the identity law (Postulate 1):

x +1=( x +1 ) ⋅1
¿(x +1)⋅ ( x + x ' ) , (using complement law)

2. Using the distributivity law (Postulate 4):

x +1=x + ( 1 ⋅ x ' )
'
¿ x + x =1 (using complement law)
Proof of Theorem 2(b):
To prove x ⋅ 0=0 :
1. Using the identity law (Postulate 1):

x ⋅ 0=( x ⋅0 ) +0
¿ ( x ⋅ 0 ) + ( x ⋅ x ' ) , (using complement law)

2. Using the distributivity law (Postulate 4):

= x ⋅ 0=x ⋅ ( 0 ⋅ x ' )
'
¿ x ⋅ x =0 (using complement law)

Theorem 3: Involution Law


 ( x ' ) '=x
Proof of Theorem 3:
1. By complement law:

x + x '=1 and x ⋅ x '=0

2. Consider the complement of x ' :

x ' + ( x ' ) '=1 and x ' ⋅ ( x ' ) ' =0

3. Substituting ( x ' ) '=x :

x ' + x=1 and x ' ⋅ x=0

Thus, ( x ' ) '=x .

Theorem 4: Associative Law



(a) x + ( y + z )=( x + y ) + z

(b) x ⋅ ( y ⋅ z )= ( x ⋅ y ) ⋅ z

Proof of Theorem 4(a):


… soon
Theorem 5: DeMorgan’s Laws

(a) ( x + y ) '=x ' ⋅ y '

(b) ( x ⋅ y ) '=x ' + y '
…soon

Theorem 6: Absorption Law



(a) x + ( x ⋅ y ) =x

(b) x ⋅ ( x + y ) =x
…soon

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy