DeMorgan Theorem

As we already know, there are two important concepts in boolean alms. These will be "1" and "0", respectively. Besides, when we were working on boolean alms, we learned that there are actually a lot of rules and theorems about the subject. This is where the DeMorgan Theorem appears. The De Morgan rule was developed in the past by the English mathematician Augustus De Morgan (1806-1871).

DeMorgan Theorem

Rule 1

Below the DeMorgan theorem are 2 main mathematical expressions. The formulas here have been developed for AND, OR, NOT operations. Then let's see our first equation: we can comfortably use the subjects we've learned so far to make this equation clearer, but there are a few things we need to do to make it clearer. The most important of these is to draw the truth table and see all the combinations.

DeMorgan's first Theorem accuracy table

In fact, when we look at the table, we see that when both of the inputs are only "1", our output is zero. Other situations are understood very easily through this table. It is also possible to infer this table by giving these input values sequencially. It is also possible to show this equation through logial doors.

DeMorgan's First Law Is Expressed Through Logidical Doors

In fact, we've seen the logistics doors in our series before and how they've been transformed into mathematical expressions. If we use this critical information that we learned there here, it will actually be just as easy to analyze this circuit. For example, if we know that a signal entering the NOT gate has been sniped, it is very likely to do the rest.

Rule 2

Now that we know the first law of the DeMorgan Theorem, we can move on to our second rule. Then let's see our formula: now that we know our mathematical formula, we can examine our accuracy table. Now that we've examined our accuracy table, we understand from here that when we actually have mathematical expression, it's very easy to create it. Then let's finally establish this rule through the logistics gates.