Difference between revisions of "Boolean logic"
Jump to navigation
Jump to search
HeartOfGold (talk | contribs) (Boolean logic new article) |
HeartOfGold (talk | contribs) (Adding venn diagrams) |
||
| Line 10: | Line 10: | ||
=== Truth Tables for AND and OR operators === | === Truth Tables for AND and OR operators === | ||
| + | [[Image:VennAnd1.gif|right|250px|thumb]] | ||
{| class="wikitable" | {| class="wikitable" | ||
|- | |- | ||
| Line 32: | Line 33: | ||
| 1 | | 1 | ||
|} | |} | ||
| − | + | [[Image:VennOr1.gif|right|250px|thumb]] | |
{| class="wikitable" | {| class="wikitable" | ||
|- | |- | ||
Revision as of 02:02, May 23, 2007
Boolean logic is an algebraic system with applications in philosophy, electronics, and software.
It is named after George Boole, who defined the system in the 1800s.
Operators
The two basic operators in boolean logic are the AND (, , *, intersection, or product) and OR (, , +, union, or sum) operator.
Every boolean equation can be reduced to a sum of products.
Truth Tables for AND and OR operators
| A | B | A B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
| A | B | A B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |