**# Technical studies – study 15 **

**# Technical studies – study 15**

*Introduction*

*Introduction*

Boolean algebra is an algebraic system that expresses the digital circuits. It has two elements 0 and 1, two binary operators AND and OR and one unary operator NOT. We can express any complex logic statement by Boolean algebra. It has some rules and laws to write expressions.

Boolean algebra is different from both binary number system and ordinary algebra. In Boolean algebra A.A =A and A+A=A, while in ordinary algebra and A+A=2A. In Boolean algebra 1+1=1, while in binary number system 1+1=10 and in ordinary algebra 1+1=2. In Boolean algebra there is no negative and fractional numbers and no subtraction and division. It has only logical operators AND, OR, NOT, NAND, NOR, X-OR, X-NOR.

**Logic Operations**

**Logic Operations**

**AND Operation:**

**AND Operation:**

AND operation in Boolean algebra is the ordinary multiplication. It is the logical multiplication as performed by AND gate. The operator for AND operation is (.).

*OR Operation:*

*OR Operation:*

OR operation in Boolean algebra is the ordinary addition. It is the logical addition as performed by OR gate. The operator for OR operation is (+).

**NOT Operation:**

**NOT Operation:**

NOT operation in Boolean algebra is complement of the operand. It is same as the operation performed by NOT gate. The operator for NOT operation is bar (_).

**NAND Operation:**

**NAND Operation:**

NAND operation is the complement of AND operation and same as the operation of NAND gate.

*NOR Operation:*

*NOR Operation:*

NOR operation is the complement of OR gate and same as the operation of NOR gate.

**X-OR Operation:**

**X-OR Operation:**

X-OR operation using two variables A and B in Boolean algebra can be-

**X-NOR Operation:**

**X-NOR Operation:**

X-NOR operation using two variables A and B in Boolean algebra can be-

**Principles of Boolean algebra:**

**Principles of Boolean algebra:**

Principles of Boolean algebra are a set of logical expressions that we accept without any proof.

AND operation

Principle 1: 0.0=0

Principle 2: 0.1=0

Principle 3: 1.0=0

Principle 4: 1.1=1

OR operation

Principle 5: 0+0=0

Principle 6: 0+1=1

Principle 7: 1+0=1

Principle 8: 1+1=1

NOT Operation

Principle 9:** **

Principle 10:

**Laws of Boolean algebra:**

**Laws of Boolean algebra:**

**Complementation laws:**

**Complementation laws:**

Complementation means inversion, i.e. changing 0 to 1 and 1 to 0. Complementation laws are:

Law 1:

Law 2:

Law 3: if A=0 then

Law 4: if A= 1 then

Law 5:

**AND laws:**

**AND laws:**

The AND laws are as follows-

Law 1: A.0=0

Law 2: A.1=A

Law 3: A.A=A

Law 4:

**OR Laws:**

**OR Laws:**

THE OR laws are –

Law 1: A+0=A

Law 2: A+1=1

Law 3: A+A=A

Law 4:

**Commutative laws:**

**Commutative laws:**

Commutative laws allow to change the position of variables of AND and OR operations.

Law 1: A+B=B+A

LAW 2: A.B=B.A

**Associative laws:**

**Associative laws:**

The associative laws allow making a group of variables.

Law 1: (A+B) +C=A+ (B+C)

LAW 2: (A.B) .C=A. (B.C)

*Distributive laws:*

*Distributive laws:*

Law 1: A (B+C) =AB+AC

Law 2: A+BC= (A+B) (A+C)

**Redundant literal rule (RLR):**

**Redundant literal rule (RLR):**

Law 1:

Law 2:

*Idempotence laws:*

*Idempotence laws:*

Law 1: A.A=A

Law 2: A+A=A

*Absorption laws:*

*Absorption laws:*

Law 1: A+A.B=A

Law 2: A (A+B)=A

**Theorems of Boolean algebra:**

**Theorems of Boolean algebra:**

*Consensus theorem:*

*Consensus theorem:*

Theorem 1:

Theorem 2:

*Transposition theorem:*

*Transposition theorem:*

Theorem:

**De Morgan’s theorem:**

**De Morgan’s theorem:**

Law 1:

Law 2:

Please write in the comment box below if you have any questions.