Difference between revisions of "Boolean Algebra"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
(Created page with "=AND Identities= =OR Identities= =Commutative Law= =Associate Law= =Distributive Law= =Redundancy Law= =Identity Law= =Negation Law=")
 
Line 1: Line 1:
 +
 +
Any equation must be within the <nowiki><math> </math></nowiki> tags. For Boolean alegbra the main issue is how to negate a term like:
 +
 +
<math> \overline{a}</math> or <math> \overline{\overline{a}+b}</math>
 +
 +
this can be done by adding the following around any term you wish to negate.:
 +
 +
<nowiki>\overline{}</nowiki> 
 +
 +
<math> \overline{a}</math>
 +
 +
is
 +
 +
<nowiki>\overline{a}</nowiki>
 +
 +
<math> \overline{\overline{a}+b}</math>
 +
 +
is
 +
 +
<nowiki>\overline{\overline{a}+b}</nowiki>.
 
=AND Identities=
 
=AND Identities=
  

Revision as of 08:45, 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:

[math] \overline{a}[/math] or [math] \overline{\overline{a}+b}[/math]

this can be done by adding the following around any term you wish to negate.:

\overline{}  

[math] \overline{a}[/math]

is

\overline{a}

[math] \overline{\overline{a}+b}[/math]

is

\overline{\overline{a}+b}.

AND Identities

OR Identities

Commutative Law

Associate Law

Distributive Law

Redundancy Law

Identity Law

Negation Law