BOOLEAN ALGEBRA

(LATTICES) AND THEIR

APPLICATIONS.
ABSTRACT, INTRODUCTION,HISTORY
ᣝ Boolean algebra is simpler than algebra with applications
in programming, circuit design, law, specifications,
mathematical proof and reasoning in any domain and the
importance of Boolean algebra in day to day real life.
ᣝ GEORGE BOOLE of Boolean algebra who invented this
theory.
ᣝ Boolean algebra was invented in the 1847.He was an
England mathematician and applied to set theory. His
basic goal was to find a set of mathematical axioms that
could reproduce the classical results of logic.
BASIC OPERATIONS
I. The basic operators of Boolean algebra conjunction,
disjunction, and negation.
II. AND, NOT or O R are known as Boolean operators.
III. The values are expressed by 0 and 1 in the truth table.
DEFINITIONS,LATTICE.
i. There are properties to
prove:
ii. The first four pairs of
axioms constitute the
definition of lattices.
iii. The ring which has the
property that a .a=a for all a › A V (b V c)=(a V b)V c, a ( b.
in A Is called Boolean rings.
iv. BAUDET and SCHMIDT-
SCHAUB gave an theory to
Boolean rings.
› Associativity,commutativity,
absorption,identity,distributi
vity,and complements.
› a V a=a, a .a=a
› a V b=b V a ,a .b= b. a
c)=(a .b )c
› a V(a. b)=a(a V b)
› a V(b .c)=(a V b).(a V c),a.(b V
c)=(a . b)V( a. c)
VENN DIAGRAMS:
› There are 3 Venn diagrams
in the book.
› One is for conjunction ,
disjunction and
complement.
› Venn diagram are helpful in
visualizing laws.
 DIGITAL LOGICAL
GATES:
• Digital logic gates is almost the
application of Boolean algebra of 0
and 1.
• It contains AND ,OR and NOT
gates.
• It basically works as truth values.
DE MORGAN’S THEORY:
DE MORGAN’S FIRST THEOREM
a. It proves that two or more
input variables are AND
negated they are equivalent
to the or of complements thus
the equivalent NAND function
will be negative OR function .
we can verify it with truth
table . A.B=A+B
DE MORGAN’S SECOND
THEOREM
› It proves that two or more input
variables OR negated they are
equivalent to the AND of the
complements thus the
equivalent NOR function is a
negative AND function.
› We can verify it with truth table.
APPLICATIONS:
There are many applications based upon Boolean algebra.
Few examples are below:
light switches
two-floor elevator
computers
digital switching circuitry
 Conclusion:
To reduce a particular expression to its
simplest form or change its form to a
more convenient one to implement the
expression most efficiently.
›Thank you
 Click icon to add picture
ADD A SLIDE TITLE
-5