Scribd
Upload
5 views

F6 - Boolean Algebra

Uploaded by

Ed Feranil
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views

F6 - Boolean Algebra

Uploaded by

Ed Feranil
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 31

Boolean Algebra

Boolean Algebra
• Boolean algebra is the category of algebra in
which the variable’s values are the truth
values, true and false, ordinarily denoted 1 and
0 respectively.
Boolean Algebra
• The concept of Boolean algebra was first introduced
by George Boole in his book, The Mathematical
Analysis of Logic, and further expanded upon in his
book, An Investigation of the Laws of Thought.

• Since its concept has been detailed, Boolean algebra's


primary use has been in computer programming
languages.
Boolean Algebra
• It is used to analyze and simplify digital circuits or
digital gates. It is also called Binary Algebra or logical
Algebra.
• It has been fundamental in the development of digital
electronics and is provided for in all modern
programming languages.
• It is also used in set theory and statistics.
Boolean Algebra
• The important operations performed in Boolean
algebra are – conjunction (∧), disjunction (∨) and
negation (¬).

• Hence, this algebra is far way different from


elementary algebra where the values of variables are
numerical and arithmetic operations like addition,
subtraction is been performed on them.
Boolean Algebra Terminologies
• Boolean Algebra: Boolean algebra is the branch of
algebra that deals with logical operations and binary
variables.
• Boolean Variables: A Boolean variable is defined as a
variable or a symbol defined as a variable or a symbol,
generally an alphabet that represents the logical
quantities such as 0 or 1.
Boolean Algebra Terminologies
• Boolean Function: A Boolean function consists of binary
variables, logical operators, constants such as 0 and 1,
equal to the operator, and the parenthesis symbols.
• Literal: A literal may be a variable or a complement of a
variable.
• Complement: The complement is defined as the inverse
of a variable, which is represented by a bar over the
variable.
Boolean Algebra Terminologies
• Truth Table: The truth table is a table that gives all the
possible values of logical variables and the
combination of the variables.
• It is possible to convert the Boolean equation into a
truth table.
Boolean Algebra Operations
The basic operations of Boolean algebra are as follows:
• Conjunction or AND operation
• Disjunction or OR operation
• Negation or Not operation
Boolean Algebra Operations
Rule in Boolean Algebra
Boolean Expression
• A logical statement that results in a Boolean value, either be
True or False, is a Boolean expression.
• Sometimes, synonyms are used to express the statement
such as ‘Yes’ for ‘True’ and ‘No’ for ‘False’.
• Also, 1 and 0 are used for digital circuits for True and False,
respectively.
• Boolean expressions are the statements that use logical
operators, i.e., AND, OR, XOR and NOT. Thus, if we write X
AND Y = True, then it is a Boolean expression.
Boolean Algebra Truth Table
Boolean Algebra Truth Table
Laws of Boolean Algebra
• Commutative law
• Associative law
• Distributive law
• AND law
• OR law
• Inversion law
Laws of Boolean Algebra
• Commutative Law
• Any binary operation which satisfies the following expression
is referred to as a commutative operation.
• Commutative law states that changing the sequence of the
variables does not have any effect on the output of a logic
circuit.

A. B = B. A
A+B=B+A
Laws of Boolean Algebra
• Associative Law
• It states that the order in which the logic operations
are performed is irrelevant as their effect is the same.

( A. B ). C = A . ( B . C )
( A + B ) + C = A + ( B + C)
Laws of Boolean Algebra
• Distributive Law
• Distributive law states the following conditions:

A. ( B + C) = (A. B) + (A. C)
A + (B. C) = (A + B) . ( A + C)
Laws of Boolean Algebra
• AND Law
• These laws use the AND operation. Therefore they are
called AND laws.
A .0 = 0
A.1=A
A. A = A
Laws of Boolean Algebra
• OR Law
• These laws use the OR operation. Therefore they are
called OR laws.

A +0=A
A+1=1
A+A=A
Laws of Boolean Algebra
• Inversion Law
• In Boolean algebra, the inversion law states that
double inversion of variable results in the original
variable itself.
Boolean Algebra Theorems

• The two important theorems which are extremely used in


Boolean algebra are De Morgan’s First law and De Morgan’s
second law.
• These two theorems are used to change the Boolean
expression.
• This theorem basically helps to reduce the given Boolean
expression in the simplified form.
• These two De Morgan’s laws are used to change the
expression from one form to another form.
Boolean Algebra Theorems

• De Morgan’s First Law:

• De Morgan’s First Law states that (A.B)’ = A’+B’.


• The first law states that the complement of the product of
the variables is equal to the sum of their individual
complements of a variable.
Boolean Algebra Theorems

• De Morgan’s First Law: (A.B)’ = A’+B’.


Boolean Algebra Theorems

• De Morgan’s Second Law:

• De Morgan’s Second law states that (A+B)’ = A’. B’.


• The second law states that the complement of the sum of
variables is equal to the product of their individual
complements of a variable.
Boolean Algebra Theorems

• De Morgan’s Second Law: (A+B)’ = A’. B’.


Show the behavior of Boolean function using
TRUTH TABLE.
Identification: Determine what laws are applied to the following expression.
Simplify the following Boolean expression.
Show the proof of Laws applied.

You might also like