Difference between revisions of "Boolean Algebra"
(→Law 3:) |
(→Law 4:) |
||
Line 125: | Line 125: | ||
<math> A+(A . B) = A</math> | <math> A+(A . B) = A</math> | ||
− | Proof using distributive law | + | Proof using distributive law: |
<math> | <math> | ||
− | A+(A . B) = (1 . A) + (A . B) | + | A+(A . B) = (1 . A) + (A . B) |
</math> | </math> | ||
− | + | So: | |
− | |||
<math> | <math> | ||
A . (1 + B) | A . (1 + B) | ||
Line 138: | Line 137: | ||
So: | So: | ||
− | |||
− | |||
<math> | <math> | ||
A . 1 = A | A . 1 = A |
Revision as of 11:07, 11 February 2019
Contents
- 1 Boolean Algebra Precedence
- 2 Boolean Identities
- 3 Boolean Laws
- 4 Solving Boolean Equations
- 4.1 Example 1
- 4.2 Example 2
- 4.3 Example 3
- 4.4 Example 4
- 4.5 Example 5
- 4.6 Example 6
- 4.7 Example 7
- 4.8 Example 8
- 4.9 Example 9
- 4.10 Example 10
- 4.11 Example 11
- 4.12 Example 12
- 4.13 Example 13
- 4.14 Example 14
- 4.15 Example 15
- 4.16 Example 16
- 4.17 Example 17
- 4.18 Example 18
- 4.19 Example 19
- 4.20 Example 21
Boolean Algebra Precedence
the order of precedence for boolean algebra is:
- Brackets
- Not
- And
- Or
Boolean Identities
Using AND
This equation means that the output is determined by the value of A. So if A =0, The output is 0, and vice versa.
Because there is a 0 in this equation, the output of this will always be 0 regardless of the value of A.
The output is determined by A alone in this equation. This can be simplified to just "A".
Here the output will be 0, regardless of A's value. A would have to be 1 and 0 for the output to be 1. This means we can simplify this to just 0.
Using OR
0 or A can be simplified as just A.
1 or A can be simplified as just 1.
A or A can be simplified as just A.
NOT A or A can be simplified as just 1.
Boolean Laws
Commutative Law
The Commutative Law is where equations are the same no matter what way around the letters are written. For example
or
Associate Law
If all of the symbols are the same it doesn't matter which order the equation is evaluated.
So:
Distributive Law
The distributive law is these two equations.
This is essentially factorising or expanding the brackets, but you can also:
Redundancy Law
Law 1 :
Proof :
Law 2:
Proof :
Law 3:
Proof using distributive law:
So:
So:
Law 4:
Proof using distributive law:
So:
So:
Identity Law
This is also in the identities section:
Negation Law
Just like in any other logic negating a negative is a positive so:
Solving Boolean Equations
Solving equations is a matter of applying the laws of boolean algrebra, followed by any of the identities you can find:
Example 1
Example 2
Example 3
Example 4
Example 5
Example 6
Example 7
Example 8
Example 9
Example 10
Example 11
Example 12
Example 13
Example 14
Example 15
Example 16
Example 17
Example 18
Example 19
Distributive:
Identity laws:
Alternative
Expanding the brackets
Use of and
Taking X out of the brackets
Use of