Boolean algebra
| Part of a convergent series on Mathematics |
|
| 1+1=11 |
| We are number one |
“”Alice was walking beside the White Knight in Looking Glass Land.
"You are sad." the Knight said in an anxious tone: "let me sing you a song to comfort you." "Is it very long?" Alice asked, for she had heard a good deal of poetry that day. "It's long." said the Knight, "but it's very, very beautiful. Everybody that hears me sing it - either it brings tears to their eyes, or else -" "Or else what?" said Alice, for the Knight had made a sudden pause. "Or else it doesn't, you know." |
| —Lewis Carroll, Through the Looking Glass |
Boolean algebra is the mathematics of boolean logic, where statements (usually mathematical but sometimes literative arguments) are evaluated to be either true or false.
Boolean algebra is important in both inductive reasoning and deductive reasoning, as well as science in general. It is extremely important in computer sciences, such as programming, database querying and computer engineering, as electrial signals at the most basic level are translated to and from binary (true/false, 1/0, on/off, closed/open, etc). When, however, one tries to apply boolean algebra to various natural sciences such as biology, or to social sciences such as psychology, politics, or sociology, problems can arise, such as the false dilemma.