# Laws of Boolean Algebra

Boolean alms has a very important place today. At this point, there are 2 concepts that come up when we enter this topic. Bun terms "0", "1", respectively; otherwise, it will be "ON" and "OFF". The concept of Boolean Ceibri has emerged to help reduce the number of logic gates required to perform a particularly logical operation. With the emergence of this concept, the theorems and logical processes that we use today have appeared. Boolean algebra is the mathematics we use to analyze digital doors and circuits. We can use Boolean laws to reduce the number of logical gates required in digital circuits. Therefore, Boolean algebra is a logic-based mathematical system with its own rules or laws used to describe Boolean expressions. The variables used in Boolean Algebra have only one of two possible values, which, as we learned above, are the logial "0" and the logial "1". When we examine the boolean statements we mentioned above in detail, the whole issue actually sits in our heads in general.Each of the boolean laws above is issued with only one or two variables, but the number of variables defined by a single law is not limited to this. because the number of variables can be infinite. These Boolean laws described in detail above can be used to prove any Boolean expression and simplify complex digital circuits. At this point, we come across a lot of rules. To briefly mention their names;

**Table of contents**göster

### Ineffective Element Rule

- A.1=A
- A+0=A

### Swallow Rule

- A.(A+B)=A
- A + EU =A

### Dispersion Rule

- A(B+C)=AB+AC
- A+B.C=(A+B)(A+C)

### Change Rule

- A+B=B+A
- A.B=B.A

### De Morgan Rule

- (A.B)'=A'+B'
- (A+B)'=A'. B'