THE education site for computer science and ICT

1. Introduction to simplifying boolean logic

This section covers the topic of simplifying boolean expressions.

In order to gain the maximum benefits from this section, you must be familiar with boolean expressions, logic gates and truth tables and the alternative method of simplifying expressions with karnaugh maps which have their own sections.

This is a typical boolean expression derived from a truth table

$$Q = A.B + \overline{(C+A+F)} + \overline B + C$$

Boolean algebra has a few rules to help simplify this expression. These include

• De Morgan's Theorem
• Association
• Distribution
• Commutation
• Double Negation
• Absorption

We shall explain each one and then apply them to simplifying a boolean expression.

Challenge see if you can find out one extra fact on this topic that we haven't already told you

Click on this link: Simplifying boolean logic statements