Contents

## What is the theory of Boolean logic?

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.

## Is Boolean algebra used in circuit theory?

**Boolean Algebra is used to analyze and simplify the digital (logic) circuits**. It uses only the binary numbers i.e. 0 and 1. It is also called as Binary Algebra or logical Algebra.

Important Boolean Theorems.

Boolean function/theorems | Description |
---|---|

De Morgan’s Theorems | De Morgan’s Theorem 1 and Theorem 2 |

## What is Boolean algebra known as?

Boolean algebra is **the category of algebra in which the variable’s values are the truth values, true and false**, ordinarily denoted 1 and 0 respectively. It is used to analyze and simplify digital circuits or digital gates. It is also called Binary Algebra or logical Algebra.

## Who gave the concept of Boolean algebra?

George Boole

**George Boole**, (born November 2, 1815, Lincoln, Lincolnshire, England—died December 8, 1864, Ballintemple, County Cork, Ireland), English mathematician who helped establish modern symbolic logic and whose algebra of logic, now called Boolean algebra, is basic to the design of digital computer circuits.

## What is Demorgan’s Theorem?

De Morgan’s Theorem, T12, is a particularly powerful tool in digital design. The theorem explains that **the complement of the product of all the terms is equal to the sum of the complement of each term**. Likewise, the complement of the sum of all the terms is equal to the product of the complement of each term.

## What is Boolean logic and who gave this concept?

(bool -&n loj ik) (n.) Named after the nineteenth-century mathematician **George Boole**, Boolean logic is a form of algebra in which all values are reduced to either TRUE or FALSE.

1 сент. 1996

## What are the theorems of Boolean algebra?

**There are boolean algebraic theorems in digital logic:**

- De Morgan’s Theorem : DE Morgan’s Theorem represents two of the most important rules of boolean algebra. …
- Transposition Theorem : It states that: …
- Redundancy Theorem : This theorem is used to eliminate the redundant terms. …
- Duality Theorem : …
- Complementary Theorem :

## Which boolean law theorem do you use to determine complement of a boolean expression?

**DeMorgan’s Theorem**

This theorem is useful in finding the complement of Boolean function. It states that the complement of logical OR of at least two Boolean variables is equal to the logical AND of each complemented variable.

## What is duality theorem in Boolean algebra?

Duality Theorem in Boolean Theorem – Duality theorem states that **the dual of the Boolean function can be easily obtained by interchanging the logical AND operator with the logical OR operator and the zeros with ones and vice versa**.

## What is duality theory?

Summary. In general, duality theory addresses itself to **the study of the connection between two related linear programming problems, where one of them, the primal, is a maximization problem and the other, the dual, is a minimization problem**.

## 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)