Scribd
Upload
84 views2 pages

Rule in Boolean Algebra

Boolean Algebra

Uploaded by

Absar Baig
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
84 views2 pages

Rule in Boolean Algebra

Boolean Algebra

Uploaded by

Absar Baig
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/ 2

6/21/2019 Boolean Algebra

Boolean Algebra
Advertisements

 Previous Page Next Page  

Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called as
Binary Algebra or logical Algebra. Boolean algebra was invented by George Boole in 1854.

Rule in Boolean Algebra
Following are the important rules used in Boolean algebra.

Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW.

Complement of a variable is represented by an overbar (­). Thus, complement of variable B is represented as  . Thus if B = 0 then 
 = 1 and B = 1 then   = 0.

ORing of the variables is represented by a plus (+) sign between them. For example ORing of A, B, C is represented as A + B + C.

Logical ANDing of the two or more variable is represented by writing a dot between them such as A.B.C. Sometime the dot may be
omitted like ABC.

Boolean Laws
There are six types of Boolean Laws.

Commutative law
Any binary operation which satisfies the following expression is referred to as commutative operation. 

Commutative law states that changing the sequence of the variables does not have any effect on the output of a logic circuit.

Associative law
This law states that the order in which the logic operations are performed is irrelevant as their effect is the same.

Distributive law
Distributive law states the following condition.

AND law
These laws use the AND operation. Therefore they are called as AND laws.

OR law
These laws use the OR operation. Therefore they are called as OR laws.

INVERSION law
This law uses the NOT operation. The inversion law states that double inversion of a variable results in the original variable itself.

Important Boolean Theorems
Following are few important boolean Theorems.

Boolean function/theorems Description

https://www.tutorialspoint.com/computer_logical_organization/boolean_algebra.htm 1/2
6/21/2019 Boolean Algebra

Boolean Functions Boolean Functions and Expressions, K­Map and NAND Gates realization

De Morgan's Theorems De Morgan's Theorem 1 and Theorem 2

 Previous Page Next Page  

Advertisements

Privacy Policy Cookies Policy Contact


© Copyright 2019. All Rights Reserved.

Enter email for newsletter go

https://www.tutorialspoint.com/computer_logical_organization/boolean_algebra.htm 2/2

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