Difference between revisions of "Boolean Algebra"
Ianjohnson (talk | contribs) (→Laws) |
Ianjohnson (talk | contribs) (→Laws) |
||
Line 66: | Line 66: | ||
"If NOT A or A goes in, the output is 1" | "If NOT A or A goes in, the output is 1" | ||
− | |||
=Laws= | =Laws= | ||
==Commutative Law== | ==Commutative Law== |
Revision as of 08:35, 8 May 2018
Any equation must be within the <math> </math> tags. For Boolean alegbra the main issue is how to negate a term like:
or
this can be done by adding the following around any term you wish to negate.:
<math> \overline{} </math>
is
<math> \overline{a} </math>
is
<math> \overline{\overline{a}+b} </math>.
Contents
Identities
AND Identities
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".
The output of this equation will always be 0 as A will need to be both 1 and 0 at the same time for this logic to return a 1.
This equation can be written like this as it does not matter which way around the values are entered. The output will be the same.
This equation can be written like this as all values must be equal to 1 for the output to be 1. Therefore the order in which it is written does not matter.
OR Identities
"If 0 or A goes in, A is the output"
"If 1 or A goes in, 1 is the output"
"If NOT A or 1 goes in, the output is 1"
"If NOT A or A goes in, the output is 1"
Laws
Commutative Law
The Commutative Law is where equations are the same no matter what way around the letters are written. For example
or
Laws
Associate Law
Distributive Law
The distributive law is these two equations.
Redundancy Law
or
Identity Law
Negation Law
Equations
Solving equations is a matter of applying the laws of boolean algrebra, followed by any of the identities you can find: