BOOLEAN ALGEBRA

DEFINITION: Boolean algebra is the algebra of two-valued logic with only sentential connectives, or equivalently of algebras of sets under union and complementation. Or in simple words, it is algebra of logic. It is one of the most basic tools to analyze and design logic circuits.

HISTORY:

Boolean algebra is a form of mathematics developed in 1854 by English mathematician George Boole (18151864). Boole created a system by which certain logical statements can be expressed in mathematical terms.

APPLICATIONS: The original purpose of the algebra was to simplify logic statements and solve logic problems. This concept has roots and applications in logic, set theory, topology, measure theory (measure algebras), functional analysis (algebras of projections), and ring theory (Boolean rings). It also has practical application in telephone switching circuits. Today it is the backbone of design and analysis of computer and other digital circuits.

PRINCIPLE OF BOOLEAN ALGEBRRA: The value of any Boolean variable depends upon so many Boolean variables. Eg: F = A.B.C. + D Here A, B, C and D are Boolean variables. In above equation the variable F is a function of A, B, C and D. This can be written as F = f (A,B,C,D) A variable in Boolean algebra can take only two values: 1 (true) 2 (false)

BOOLEAN OPERATIONS:
There are three basic operations in Boolean algebra 1. AND Operations is represented by X.Y 2. OR Operations is represented by X+Y 3. NOT Operations is represented by X In addition three more operators have been defined for Boolean algebra 1. XOR (Exclusive OR) 2. NOR (Not OR) 3. NAND (Not AND)

POSTULATES OF BOOLEAN ALGEBRA: The postulates define operation of the AND, OR and NOT P1: X = 0 or X = 1 P2: 0.0 = 0 P3: 1+1 = 1 P4: 0+0 = 0 P5: 1.1 = 1 P6: 1.0 = 0.1 = 0 P7: 1+0 = 0+1 = 1 P8: 0 = 1 P9: 1 = 0

LAWS OF BOOLEAN ALGEBRA: L1: Commutative Law

(a) A + B = B + A (b) A B = B A L2: Associative Law

(a) (A + B) + C = A + (B + C) (b) (A B) C = A (B C) L3: Distributive Law (a) A (B + C) = A B + A C (b) A + (B C) = (A + B) (A + C) L4: Identity Law (a) A + A = A (b) A A = A L5: Inverse Law (a) A + A' = 1 (b) A . A' = 0

BOOLEAN THEOREMS: T1: Idempotent Law (a) A + A = A (b) A . A = A T2: De Morgan's Theorem (a) (A + B)' = A' . B' (b) (A . B) = A' + B' T3: Boundedness Law (a) A + 1 = 1 (b) A . 0 = 0 (c) 1 . A = A (d) 0 + A = A T4: Absorption Law (a) A + A B = A (b) A (A + B) = A T5: Elimination Law (a) A + (A' . B) = A + B (b) A .(A' + B) = A . B T6: Unique Complement theorem

If A + B = 1 and A .B = 0 then A = B' T7: Involution theorem

(a) (A')' = A (b) 0' = 1

Examples Prove T9: (a) (1) Algebraically:

(2) Using the truth table:

Using the laws given above, complicated expressions can be simplified.

Shilpa Umdekar.