Boolean Expressions Calculator

A Boolean expression (or Logical expression) is a mathematical expression using Boolean algebra and which uses Boolean values (0 or 1, true or false) as variables and which has Boolean values as result/simplification. The expression can contain operators such as conjunction (AND), disjunction (OR) and negation (NOT).

The simplification of Boolean Equations can use different methods: besides the classical development via associativity, commutativity, distributivity, etc., Truth tables or Venn diagrams provide a good overview of the expressions.

dCode allows several syntaxes:

Algebraic notation

Logic/Computer notation

Literal notation

Boolean algebra has many properties (boolean laws):

1 - Identity element: $0$ is neutral for logical OR while $1$ is neutral for logical AND

$$a + 0 = a \\ a.1 = a$$

2 - Absorption: $1$ is absorbing for logical OR while $0$ is absorbing for logical AND

$$a + 1 = 1 \\ a.0 = 0$$

3 - Idempotence: applying multiple times the same operation does not change the value

$$a + a = a + a + \cdots + a = a \\ a . a = a . a . \cdots . a = a$$

4 - Involution or double complement: the opposite of the opposite of $a$ est $a$

$$a = \overline{\overline{a}} = !(!a)$$

5 - Complementarity by Contradiction: $a$ AND $\text{not}(a)$ is impossible, so is false and is $0$

$$a . \overline{a} = 0$$

6 - Complementarity by excluded third: $a$ OR $\text{not}(a)$ is always true, so is $1$

$$a + \overline{a} = 1$$

7 - Associativity law: parenthesis are useless between same operators

$$a.(b.c) = (a.b).c = a.b.c \\ a+(b+c) = (a+b)+c = a+b+c$$

8 - Commutativity law: the order does not matter

$$a.b = b.a \\ a+b = b+a$$

9 - Distributivity law: AND is distributed over OR but also OR is distributed over AND

$$a.(b+c) = a.b + a.c \\ a+(b.c) = (a+b).(a+c)$$

10 - De Morgan laws (see below for more details)

$$\overline{a+b} = \overline{a}.\overline{b} \\ \overline{a.b} = \overline{a}+\overline{b}$$

11 - Other simplifications by combinations of the above ones

$$a.(a+b) = a \\ a+(a.b) = a \\ (a.b) + (a.!b) = a \\ (a+b).(a+!b) = a \\ a + (!a.b) = a + b \\ a.(!a + b) = a.b \\ a.b + \overline{a}.c = a.b + \overline{a}.c + b.c$$

Method 1: simplify them until you get the same writing in boolean algebra.

Method 2: by calculating their truth table which should be identical.

De Morgan's laws are often used to rewrite logical expressions. They are generally stated: not (a and b) = (not a) or (not b) and not (a or b) = (not a) and (not b). Here are the equivalent logical entries:

$$\overline{(a \land b)} \leftrightarrow (\overline{a}) \lor (\overline{b}) \iff \overline{AB} = \overline{a} + \overline{b}$$

$$\overline{(a \lor b)} \leftrightarrow (\overline{a}) \land (\overline{b}) \iff \overline{a+b} = \overline{a} . \overline{b}$$

In logic, it is possible to use different formats to ensure better readability or usability.

The normal disjunctive form (DNF) uses a sum of products (SOP):

The normal conjunctive form (CNF) or clausal form uses a product of sums (POS):

The calculation steps, such as a human can imagine them, do not exist for the solver.

The operations performed are binary bit-by-bit and do not correspond to those performed during a resolution with a pencil and paper.

Part of the results come from a database containing all 2^26 combinations of the 26 letters of the alphabet for each binary value 0 or 1.