Scribd
Upload
54 views

Introduction To Boolean Algebra: Salary Increase

Boolean algebra uses true/false values (1/0) to represent logical statements and their relationships. The document introduces Boolean operators like AND, OR, and NOT and defines their truth tables. It also describes properties of Boolean algebra like commutativity, associativity, distributivity, identities, and De Morgan's theorems which define relationships between summed and multiplied terms.

Uploaded by

abhishek_bajaj_13
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
54 views

Introduction To Boolean Algebra: Salary Increase

Boolean algebra uses true/false values (1/0) to represent logical statements and their relationships. The document introduces Boolean operators like AND, OR, and NOT and defines their truth tables. It also describes properties of Boolean algebra like commutativity, associativity, distributivity, identities, and De Morgan's theorems which define relationships between summed and multiplied terms.

Uploaded by

abhishek_bajaj_13
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Boolean Algebra

Introduction to Boolean Algebra


Boolean algebra which deals with two-valued (true / false or 1 and 0) variables and functions
find its use in modern digital computers since they too use two-level systems called binary
systems.

Let us examine the following statement:"I will buy a car If I get a salary increase or I win the
lottery." This statement explains the fact that the proposition "buy a car" depends on two other
propositions "get a salary increase" and "win the lottery". Any of these propositions can be
either true or false hence the table of all possible situations:

Salary Increase

Win Lottery

Buy a car = Salary Increase or Win Lottery

False

False

False

False

1 / 16

Boolean Algebra

True

True

True

False

True

True

True

True

The mathematician George Boole, hence the name Boolean algebra, used 1 for true, 0 for false
and + for the or connective to write simpler tables. Let X = "get a salary increase", Y = "win the
lottery" and F = "buy a car". The above table can be written in much simpler form as shown
below and it defines the OR function.

2 / 16

Boolean Algebra

F=X+Y

3 / 16

Boolean Algebra

Let us now examine the following statement:"I will be able to read e-books online if I buy a
computer and get an internet connection." The proposition "read e-books" depends on two
other propositions "buy a computer" and "get an internet connection". Again using 1 for True, 0
for False, F = "read e-books" , X = "buy a computer", Y = "get an internet connection" and use
.

for the connective


and
, we can write all possible situations using Boolean algebra as shown below. The above table
can be written in much simpler form as shown below and it defines the AND function.

F=X

4 / 16

Boolean Algebra

5 / 16

Boolean Algebra

We have so far defined two operators: OR written as + and AND written . . The third operator in
Boolean algebra is the NOT operator which inverts the input. Whose table is given below where
NOT X is written as X'.

NOT X = X'

The 3 operators are the basic operators used in Boolean algebra and from which more
complicated Boolean expressions may be written. Example: F = X . (Y + Z)

Truth Tables

Truth tables are a means of representing the results of a logic function using a table. They are
constructed by defining all possible combinations of the inputs to a function, and then
calculating the output for each combination in turn. For the three functions we have just defined,
the truth tables are as follows.

6 / 16

Boolean Algebra

AND

F(X,Y)

7 / 16

Boolean Algebra

OR

F(X,Y)

8 / 16

Boolean Algebra

9 / 16

Boolean Algebra

NOT

F(X)

Truth tables may contain as many input variables as desired

F(X,Y,Z) = X.Y + Z

10 / 16

Boolean Algebra

F(X,Y,Z)

11 / 16

Boolean Algebra

12 / 16

Boolean Algebra

13 / 16

Boolean Algebra

Different Properties or Laws of Boolean Algebra

A "property" or a "law," describes how differing variables relate to each other in a system of
numbers.

Commutative Property

It applies equally to addition and multiplication. In essence, the commutative property tells us
we can reverse the order of variables that are either added together or multiplied together
without changing the truth of the expression.

Associative Property

14 / 16

Boolean Algebra

This property tells us we can associate groups of added or multiplied variables together with
parentheses without altering the truth of the equations.

Distributive Property

Distributive Property, illustrating how to expand a Boolean expression formed by the product of
a sum, and in reverse shows us how terms may be factored out of Boolean sums-of-products.

15 / 16

Boolean Algebra

To summarize, here are the three basic properties: commutative, associative, and distributive.
Identities
In mathematics,
an identity
The
algebraic
is a statement
true
for
values
of its
variable
orBoolean
variables.
identity
algebra
zero
equals
has the
its own
original
unique
"anything,"
identities
nobased
matter
onwhat
theofall
bivalent
value
xpossible
+ 0 that
= states
x tells
"anything"
of
us Boolean
that
(x)
anything
may
variables.
be.(x)
added
to
Inverse
Another
identity
inverted
original
an
evenBoolean
twice.
number
Complementing
having
value.
of negations
This
to doiswith
cancel
analogous
a variable
complementation
to leave
to
twice
negating
the(ororiginal
any
is(multiplying
that
even
value.
of number
the double
by -1)
of times)
in
complement:
real-number
results in
aalgebra:
variable
the

Duality
identities
In
operators
on
and
algebras
the
replacing
right.
the
0's
duality
by
1's
Principle
and
1'scan
by
0's.
be
Compare
obtained
the
by to
identities
interchanging
on the
AND
left and
sideOR
with the
Example
X.Y+Z'
=Principle
Indempotent
Law
AnBoolean
ANDed
with
itself
or
ORed
with
itself
is
equal equal
to
that
input.
1.input
ALaw:
=Law:
A,A
variable
OR'ed
with
itself
isisis
always
the
variable.
2.
AA=1,
.+(X'+Y').Z
A
=A
A,A
variable
AND'ed
with
itself
always
equal
to
the
variable.
Involution
A
=A
A=0,
A=1,
A=1=0=A
When
=0,
A=0=1=A
Thus
A=A
Absorption
(i)
A+AB=A
LHS=A+AB=A.1+A.B=A(1+B)+A(B+1)=A.1=A=RHS
(ii)
A.(A+B)=A
LHS=A.)A+B)=A.A+A.B=A+A.B=A+A.B=A(1+B)=A.1=A=RHS
Complementary
A
term
ANDed
with
its
complement
equals
0,
and
ato
term
ORed
with
its complement
equalsThe
1
AA'
= Theorem:
0=A.B
A+A'
=
1 given
De
Morgans
Theorem
Morgan
was
aLaw
great
logician
and
as
as
a
friend
of
Charles Boole.
theorems
by
are
withequals
Boolean
First
The
complement
ofassociated
aMathematician,
equals
thewell
product
of
(A+B)
Proof:
LHS=
=Boolean
(0+0)
0=1
RHS=A.B=0.0=1.1=1
Second
The
complement
ofsum
a product
thealgebra.
sum
ofthe
thecomplements.
complements.
Proof:
LHS
==(A+B)
(A.B)
==Morgan
0
= +1
1 =1
RHS
ATheorem:
+ofB=
=(0.0)
0 +De
0
=1
Summary
indetities

16 / 16

You might also like