- Place brackets in expressions, given the priority of operations
- Simplify logical expressions
- Build a truth table for the formulas entered
- Find Normal Forms of Boolean Expression:
- Conjunctive normal form (CNF), including perfect
- Disjunctive normal form (DNF), including perfect

- Using negative
(A⇒B)⇒¬(B⇒A)

- Addition of logical expressions
(A⊕B)∨(A⊕C)

- With Equivalent Sign
(A⇒B)∨(B⇔C)

- With "Consequence" Sign
((A⇒B)⇒(A|C))⇒(¬B⇒¬C)

- Not-Or
(A⇒B)∧(A↓C)

- With the use of conjunction and disjunction
(A∨B)∨C ⇒ (A∨B)∧(A∨C)

- With the use of Not-And and Not-Or
0↓1|a|b|c|1↓0