Boolean

Boolean Logic, or Boolean Algebra was developed by George Boole (1815-1864). It is a two-valued logic: statements are either true or false. It has connectives, operators. Boolean algebra is decidable.


It uses the three operators: AND, OR and NOT. AND and OR are called binary operations because they have two inputs, or two arguments.

AND

A binary operation: a AND b. Also called conjunction, union, set union.
For example: The house is big AND the house is red. So the house is big and red.

OR

A binary operation: a OR b.
Also called disjunction, intersection, set intersection.
There are two types of OR. The normal is the inclusive OR. The house is big or the house is red. This means the house is at least either red or big, but could be both.
Exclusive OR: The house is big or the house is red, means the house is either red or it is big but not both.

NOT

A unary operation: NOT a.
Also called negation, complementation.
For example: The house is big. The house is not big.


"Propositional logic", which is a simple knowledge representation language is a modern variation of Boolean algebra