Scribd
Upload
102 views

Boolean Algebra

Module -2 provides an overview of Boolean algebra, including: 1) Boolean algebra was defined by George Boole in 1854 as an algebraic structure with a set of elements, operators, and axioms. 2) Common postulates used to formulate algebraic structures include closure, associative laws, commutative laws, identity elements, and inverses. 3) Huntington formulated the postulates of Boolean algebra in 1904, which do not include associative laws and have different properties than ordinary algebra.

Uploaded by

Ashutosh Devkota
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
102 views

Boolean Algebra

Module -2 provides an overview of Boolean algebra, including: 1) Boolean algebra was defined by George Boole in 1854 as an algebraic structure with a set of elements, operators, and axioms. 2) Common postulates used to formulate algebraic structures include closure, associative laws, commutative laws, identity elements, and inverses. 3) Huntington formulated the postulates of Boolean algebra in 1904, which do not include associative laws and have different properties than ordinary algebra.

Uploaded by

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

Module -2: BOOLEAN ALGEBRA

Boolean Algebra

 Algebraic Structure:
Defined as set of elements, a set of operators and a number

of unproved axioms or postulates.
 Boolean Algebra-
 George Boole in 1854
 Switching Algebra-
 ( Two valued Boolean Algebra) – Shanon in 1938
 Postulates formulated –Huntington in 1904

An axiom or postulate is a premise or starting point of reasoning. As classically conceived, an


axiom is a premise so evident as to be accepted as true without controversy.
Postulates
• The postulates of a mathematical system form the basic
assumptions from which it is possible
– to deduce the rules,
– theorems, and
– properties of the system
• Most common postulates used to formulate various algebraic
structures are as follows
– Closure
– Associative law.
– Commutative law.
– Identity element
– Inverse.
Common postulates to formulate various algebraic
structures
 Closure
 A Set S is closed, if for every pair of elements of S, the binary
operator specified a rule for obtaining a unique element of S.
 Associative law
 (x*y)*z = x*(y*z) for all x, y, z in S
 Commutative law
 x * y = y * x for all x, y in S
 Identity element
 e * x = x * e = x for every x in S
 Inverse
 x * y = e => y is the inverse of x and vice versa
 Distributive law
 x * (y•z) = (x * y) • (x * z)
Huntington Postulates
 Boolean algebra is an algebraic structure defined on a set of
elements B together with two binary operators + and • provided
the following postulates are satisfied
1. Closure with respect to + and •
2. Identity element: x + 0 = 0 + x = x; x •1 = 1 •x = x
3. Commutative: x + y = y + x; x • y = y • x
4. Distributive: (• over +: x • (y + z) = (x • y) + (x • z)) (+ over •: x +
(y • z) = (x + y) • (x +z))
5. Complement: X + X = 1 and x • X = 0
6. There exists at least two elements x, y Є B such that x ≠ y
Comparison of Boolean algebra and
ordinary algebra
Huntington postulates Ordinary algebra

Do not include associative law Holds associative law


+ over • distributive law is valid + over • distributive law is
invalid
Does not have additive and Additive and multiplicative
multiplicative inverses (hence inverse exists
no subtraction & division)
Complement exists Complement is not available
Finite set of elements Real numbers
BASIC THEOREMS AND PROPERTIES
OF BOOLEAN ALGEBRA
Duality
 Duality
 To obtain the dual of an algebraic expression, interchange OR and AND
operators and replace 1’s by 0’s and 0’s by 1’s.
 the dual of an expression does not equal the expression itself.
 Example: F = (A + C) · B + 0
dual F = (A · C + B) · 1 = A · C + B
 Example: G = X · Y + (W + Z)
dual G = (X + Y) . (W . Z)
 Example: H = A · B + A · C + B · C
dual H = A + B . A + C . B + C
Proof of the theorem
Proof of the theorem
Proof of the theorem
DeMorgan’s Law

 De Morgan’s Laws provide an easy way to find the


inverse of a boolean expression:
 (X + Y)’ = X’ Y’
(X Y)’ = X’ + Y’
 An easy way to remember this is that each TERM is
complemented, and that OR’s become AND’s;
AND’s become OR’s.
Boolean Operator Precedence

 The order of evaluation in a Boolean


expression is:
 Parenthesis
 NOT
 AND
 OR
 Example: F = A(B + C)(C + D)
Example problems

1. x(x’+y)
2. x+x’y
3. (x+y) (x+y’)
4. xy+x’z+yz
5. (x+y)(x’+z)(y+z)
Solutions
Exercise Problems
References

• Digital Design by Morris Mano and Michael D Ciletti

You might also like