|
|
| (2 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | '''Boolean logic''' is an algebraic system with applications in philosophy, electronics, and software.
| + | #REDIRECT [[boolean algebra]] |
| − | | |
| − | It is named after George Boole, who defined the system in the 1800s.
| |
| − | | |
| − | == Operators ==
| |
| − | | |
| − | The two basic operators in boolean logic are the AND (<math>\cap</math>, <math>\wedge</math>, *, intersection, or product) and OR (<math>\cup</math>, <math>\vee</math>, +, union, or sum) operator.
| |
| − | | |
| − | Every boolean equation can be reduced to a sum of products.
| |
| − | | |
| − | === Truth Tables for AND and OR operators ===
| |
| − | [[Image:VennAnd1.gif|right|250px|thumb]] | |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | ! A
| |
| − | ! B
| |
| − | ! A <math>\cap</math> B
| |
| − | |-
| |
| − | | 0
| |
| − | | 0
| |
| − | | 0
| |
| − | |-
| |
| − | | 0
| |
| − | | 1
| |
| − | | 0
| |
| − | |-
| |
| − | | 1
| |
| − | | 0
| |
| − | | 0
| |
| − | |-
| |
| − | | 1
| |
| − | | 1
| |
| − | | 1
| |
| − | |}
| |
| − | [[Image:VennOr1.gif|right|250px|thumb]]
| |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | ! A
| |
| − | ! B
| |
| − | ! A <math>\cup</math> B
| |
| − | |-
| |
| − | | 0
| |
| − | | 0
| |
| − | | 0
| |
| − | |-
| |
| − | | 0
| |
| − | | 1
| |
| − | | 1
| |
| − | |-
| |
| − | | 1
| |
| − | | 0
| |
| − | | 1
| |
| − | |-
| |
| − | | 1
| |
| − | | 1
| |
| − | | 1
| |
| − | |}
| |
| − | | |
| − | | |
| − | == See Also ==
| |
| − | *[http://www.learn-c.com/boolean.htm Boolean logic tutorial]
| |