Boolean Algebra
Just like normal algebra, Boolean algebra uses letters to represent values and uses them as expressions. Boolean algebra uses the values TRUE and FALSE (i.e. 1 and 0).
Notation
A, B, C, etc.
Used to represent an unknown value, just like x or y in normal algebra.
NOT A. An overline represents the NOT operation being applied to what is below the line.
A AND B. The dot represents AND operation.
A OR B. The plus sign represents OR operation.
Order of Precedence
The following list shows the order of precedence (Highest to Lowest):
Brackets
NOT
AND
OR
Boolean Identities
There are numerous Boolean identities that can help simplify Boolean expressions:
De Morgan's Law
De Morgan's law can be very useful when simplifying logical expressions. It can be remembered by recalling the phrase:
Break the bar and change the sign
The "bar" refers to the overline representing the NOT sign and the sign refers to changing the dot or plus sign.
Example of using De Morgan's law on :
Step 1: Break the bar
Step 2: Change the sign:
De Morgan's law can also be used in reverse, by changing the sign and building the bar. Following is an example of changing :
Step 1: Change the sign
Step 2: Build the bar
Distributive Rules
Just like mathematics, you can expand and factorise Boolean expressions.
Example Questions
Last updated