Difference between revisions of "Boolean Algebra"
DannyDaEpic (talk | contribs) (→OR Identities) |
Ianjohnson (talk | contribs) (→Commutative Law) |
||
Line 40: | Line 40: | ||
=Laws= | =Laws= | ||
==Commutative Law== | ==Commutative Law== | ||
+ | The Commutative Law is where equations are the same no matter what way around the letters are written. For example | ||
+ | <nowiki><math> A + B = B + A </math></nowiki> | ||
==Associate Law== | ==Associate Law== |
Revision as of 08:20, 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
The logic gate AND is represented by the "." symbol. Some examples of an equation containing this operation is:
This expression means "A AND B = 1".
The line above the equation means "NOT", therefore this expression means " NOT A AND B = 1".
OR Identities
The logic gate 'OR' in Boolean algebra is represented by a '+' symbol. For example, if I was to represent "A or B" in Boolean algebra, it would look like this:
Laws
Commutative Law
The Commutative Law is where equations are the same no matter what way around the letters are written. For example
<math> A + B = B + A </math>
Associate Law
Distributive Law
Redundancy Law
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: