## What are the Boolean theorems?

Boolean algebraic theorems are the theorems that are used to change the form of a boolean expression. Sometimes these theorems are used to minimize the terms of the expression, and sometimes they are used just to transfer the expression from one form to another. There are boolean algebraic theorems in digital logic: 1.

**What are the conditions of the redundancy Theorem?**

Conditions for applying Redundancy theorem are: Three variables must present in the expression….Y = AB + A’C + BC.

Name | AND Form | OR Form |
---|---|---|

Commutative Law | AB=BA | A+B=B+A |

Associative Law | (AB)C | (A+B)+C = A+(B+C) |

Distributive Law | A+BC=(A+B)(A+C) | A(B+C)=AB+AC |

### What do you know about Boolean algebra?

Boolean algebra is a branch of mathematics that deals with operations on logical values with binary variables. The Boolean variables are represented as binary numbers to represent truths: 1 = true and 0 = false. Elementary algebra deals with numerical operations whereas Boolean algebra deals with logical operations.

**What is redundancy theorem in Boolean algebra?**

Redundancy theorem is used as a Boolean algebra trick in Digital Electronics. It is also known as Consensus Theorem: AB + A’C + BC = AB + A’C. The consensus or resolvent of the terms AB and A’C is BC.

#### What is distributive law in Boolean algebra?

Distributive Law – This law permits the multiplying or factoring out of an expression. A(B + C) = A.B + A.C (OR Distributive Law) A + (B.C) = (A + B).(A + C) (AND Distributive Law)

**What is the consensus theorem in Boolean algebra?**

In Boolean algebra, the consensus theorem or rule of consensus is the identity: . It is the conjunction of all the unique literals of the terms, excluding the literal that appears unnegated in one term and negated in the other. If

## How to use redundancy theorem in Boolean algebra?

The conjunctive dual of this equation is: (A+B). (A’+C). (B+C) = (A+B). (A’+C) In the second line, we omit the third product term BC.Here, the term BC is known as Redundant term. In this way we use this theorem to simply the Boolean Algebra. Conditions for applying Redundancy theorem are:

**What is the consensus of two terms?**

The consensus is the conjunction of the two terms, omitting both , and repeated literals. For example, the consensus of . The consensus is undefined if there is more than one opposition. through the resolution inference rule.

### How do you find the redundant consensus term after applying redundancy theorem?

After applying Redundancy theorem we can write only the terms containing complemented variables (i.e, A) and omit the Redundancy term i.e., (B + C). .’. F = (A + B). (A’ + C) The third product term BC is a redundant consensus term.