Scribd
Upload
61 views10 pages

Boolean Algebra (Lattices) and Their Applications...

Boolean algebra is a branch of mathematics that was invented by George Boole in 1847 to model logic. It uses the values 0 and 1 to represent True and False, and logical operators like AND, OR, and NOT. Boolean algebra finds applications in digital logic circuits, programming, and reasoning. It defines basic operations and properties like idempotence, commutativity, distributivity, and complements. Boolean algebra is visualized using Venn diagrams and is the foundation of digital logic gates in computers. De Morgan's theorems relate AND and OR operations when applied to negated variables. Applications of Boolean algebra include logic circuits for devices like light switches and elevators.

Uploaded by

abhilasha S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
61 views10 pages

Boolean Algebra (Lattices) and Their Applications...

Boolean algebra is a branch of mathematics that was invented by George Boole in 1847 to model logic. It uses the values 0 and 1 to represent True and False, and logical operators like AND, OR, and NOT. Boolean algebra finds applications in digital logic circuits, programming, and reasoning. It defines basic operations and properties like idempotence, commutativity, distributivity, and complements. Boolean algebra is visualized using Venn diagrams and is the foundation of digital logic gates in computers. De Morgan's theorems relate AND and OR operations when applied to negated variables. Applications of Boolean algebra include logic circuits for devices like light switches and elevators.

Uploaded by

abhilasha S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

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 › Associativity,commutativity,
prove: absorption,identity,distributi
ii. The first four pairs of vity,and complements.
axioms constitute the › a V a=a, a .a=a
definition of lattices.
› a V b=b V a ,a .b= b. a
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. c)=(a .b )c
iv. BAUDET and SCHMIDT- › a V(a. b)=a(a V b)
SCHAUB gave an theory to › a V(b .c)=(a V b).(a V c),a.(b V
Boolean rings. 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 DE MORGAN’S SECOND
THEOREM

a. It proves that two or more › It proves that two or more input


input variables are AND variables OR negated they are
negated they are equivalent equivalent to the AND of the
to the or of complements thus complements thus the
the equivalent NAND function equivalent NOR function is a
will be negative OR function . negative AND function.
we can verify it with truth
table . A.B=A+B › 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

You might also like