Difference between revisions of "Boolean logic"
HeartOfGold (talk | contribs) (Adding venn diagrams) |
|||
| Line 60: | Line 60: | ||
== See Also == | == See Also == | ||
*[http://www.learn-c.com/boolean.htm Boolean logic tutorial] | *[http://www.learn-c.com/boolean.htm Boolean logic tutorial] | ||
| + | [[category:logic]] | ||
Revision as of 04:05, 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 (Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \cap} , Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \wedge} , *, intersection, or product) and OR (Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \cup} , , +, 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 |
