⌨

- Use symbolic logic and logic algebra
- 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

Here are the symbols that should be specified when entering a logical formula into the calculator

- ¬a
- - negation
- a⇒b
- - material implication
- a∧b
- - logical conjunction
- a∨b
- - logical disjunction
- a⇔b
- - logical equality
- a⊕b
- - exclusive or ( Exclusive disjunction)
- a|b
- - Nand (not and) (Sheffer stroke)
- a↓b
- - Not-Or (logical NOR)
- a⊙b
- - XNOR gate ( Exclusive AND)

In the calculator, you can simplify expressions with the following operations: NOT, XOR, AND, OR, NAND, NOR, NOT, XNOR