3. Introduction to Boolean Algebra
Developed by English Mathematician George Boole in between (1815 -
1864).
It is described as an algebra of logic or an algebra of two values i.e True
or False.
The term logic means a statement having binary decisions i.e True/Yes or
False/No.
A variable whose value can be either 1 or 0 is called a Boolean variable.
AND, OR, and NOT are the basic Boolean operations.
We can express Boolean functions with either an expression or a truth table.
4. Boolean Values
As we know that we use “1 and 0” to denote the two values. Let's again, recall
that the two binary values have different names:
– True/False
– On/Off
– Yes/No
– 1/0
• The three basic logical operations are:
– AND
– OR
– NOT
5. Logical operators
Logical operations are performed by logical operators. The fundamental logical
operators are:
1. AND (conjunction) denoted by a dot (·).
2. OR (disjunction)
3. NOT (negation/complement)
6. Turth Table
Truth table is a table that contains all possible values of logical
variables/statements in a Boolean expression.
where n=number of variables used in a Boolean expression.
Did You Know?
A Boolean expression is a combination of Boolean variables and Boolean
operators.
7. And Operator
It performs logical multiplication.
It's denoted by (.) dot.
For Exp: Z=X.Y
Here “.” is representing AND operation
between x and y
8. OR Operator
It performs logical addition
It's denoted by (+) plus.
For Exp: Z=X +Y
Here “+” is representing ORoperation
between x and y
9. NOT Operator
It performs logical negation.
Denoted by (-) bar. It operates on
single variable.
For Exp: ~X, ~A, etc
