Scribd
Upload
10 views11 pages

Boolean Algebra

Boolean Algebra, invented by George Boole in 1854, is used to analyze and simplify digital circuits using binary values (0 and 1). It differs from elementary algebra by focusing on logical operations such as conjunction, disjunction, and negation rather than numerical operations. The document outlines fundamental concepts, operator precedence, and various Boolean laws including commutative, associative, distributive, AND, OR, and inversion laws.

Uploaded by

fffahadahmed348
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
10 views11 pages

Boolean Algebra

Boolean Algebra, invented by George Boole in 1854, is used to analyze and simplify digital circuits using binary values (0 and 1). It differs from elementary algebra by focusing on logical operations such as conjunction, disjunction, and negation rather than numerical operations. The document outlines fundamental concepts, operator precedence, and various Boolean laws including commutative, associative, distributive, AND, OR, and inversion laws.

Uploaded by

fffahadahmed348
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

BOOLEAN ALGEBRA

BOOLEAN ALGEBRA

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

Boolean algebra is different from elementary algebra as the latter deals with numerical
operations and the former deals with logical operations. Elementary algebra is expressed
using basic mathematical functions, such as addition, subtraction, multiplication, and
division, whereas Boolean algebra deals with a conjunction, disjunction, and negation.
FUNDAMENTAL CONCEPTS
RULE 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 (-).
• ORing of the variables is represented by a plus (+) sign between them. For example,
ORing of A, B, and C is represented as A + B + C.
• Logical ANDing of the two or more variables is represented by writing a dot between
them such as A.B.C. Sometimes the dot may be omitted like ABC.
Operator Precedence
BOOLEAN LAWS

There are six types of Boolean Laws.

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

A.B=B.A
A+B=B+A

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

Associative law

This law states that the order in which the logic operations are performed is
irrelevant as their effect is the same.
i. (A.B).C=A.(B.C)
ii. (A+B)+C=A+(B+C)

Distributive law

Distributive law states the following condition.


i. A.(B+C)=A.B+A.C
BOOLEAN LAWS

AND law
These laws use the AND operation. Therefore, they are called AND laws.
A.0=0 A.1=A
A.A=A A.A= 0

OR law
These laws use the OR operation. Therefore, they are called OR laws.
A+0=A A+1=1
A+A=A A+A= 1
BOOLEAN LAWS

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

A=A

You might also like