THE education site for computer science and ICT

# 1. Introduction to simplifying Boolean logic

So far we have covered how to put together Boolean expressions, and how to represent these expressions using logic gates and truth tables. If you have not read those which have their own sections.

Boolean expressions can look rather complicated, especially when derived from a truth table. For example, this is a typical boolean expression derived from a truth table

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

We covered one method of simplifying such expressions using diagrams in our section on karnaugh maps.

In this section we will cover another method - De Morgan's Laws.

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