Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Logic Methods: Truth Tables, Equivalences and Normal Forms

Every method for propositional logic on one page, from building truth tables to proving equivalences with the laws, simplifying, normal forms and conditionals. Each method links to the rules it uses and to the logic lesson where they are explained.

Level
I

Single-rule moves

Atomic · one rule, applied once
¬(∧)

How to push a negation into a bracket

De Morgan's laws
Atomic
Recognize
A negation stands in front of a bracket joined by ∧\land or ∨\lor: ¬(P∧Q)\neg(P \land Q), ¬(P∨¬Q)\neg(P \lor \neg Q), ¬(¬P∨Q)\neg(\neg P \lor Q).
steps
1. Put a ¬\neg on each part inside the bracket.
2. Flip the connective: ∧\land becomes ∨\lor, and ∨\lor becomes ∧\land.
3. Cancel any ¬¬\neg\neg that appears.
Statement
¬(P∧Q)≡¬P∨¬Q,¬(P∨Q)≡¬P∧¬Q\neg(P \land Q) \equiv \neg P \lor \neg Q, \qquad \neg(P \lor Q) \equiv \neg P \land \neg Q
worked example
¬(P∨¬Q)≡¬P∧¬¬Q≡¬P∧Q\neg(P \lor \neg Q) \equiv \neg P \land \neg\neg Q \equiv \neg P \land Q
∧ ∨

How to distribute and over or, or or over and

Distributive laws
Atomic
Recognize
A part is joined by ∧\land to a bracket with ∨\lor, or by ∨\lor to a bracket with ∧\land, or two terms share a part you want to factor out: P∧(Q∨R)P \land (Q \lor R), P∨(Q∧¬R)P \lor (Q \land \neg R), (P∧Q)∨(P∧¬Q)(P \land Q) \lor (P \land \neg Q).
steps
1. Copy the outside part onto each part of the bracket, with the outside connective.
2. Join the new pieces with the connective that was inside the bracket.
3. To factor out a shared part, read the law from right to left.
Statement
P∧(Q∨R)≡(P∧Q)∨(P∧R),P∨(Q∧R)≡(P∨Q)∧(P∨R)P \land (Q \lor R) \equiv (P \land Q) \lor (P \land R), \qquad P \lor (Q \land R) \equiv (P \lor Q) \land (P \lor R)
worked example
P∨(Q∧¬R)≡(P∨Q)∧(P∨¬R)P \lor (Q \land \neg R) \equiv (P \lor Q) \land (P \lor \neg R)
¬¬P

How to remove a double negation

Double negation law
Atomic
Recognize
Two negations act on the same formula, often after De Morgan's law or a contrapositive: ¬¬P\neg\neg P, ¬¬(P∧¬Q)\neg\neg(P \land \neg Q), ¬Q→¬¬P\neg Q \to \neg\neg P.
steps
1. Find two ¬\neg signs that act on the same formula with nothing in between.
2. Delete both; the formula keeps its value in every row.
Statement
¬(¬P)≡P\neg(\neg P) \equiv P
worked example
¬¬(P∧¬Q)≡P∧¬Q\neg\neg(P \land \neg Q) \equiv P \land \neg Q
P→Q

How to rewrite an implication without the arrow

Material implication
Atomic
Recognize
An arrow has to go before you can use De Morgan, distribute, or reach a normal form: P→QP \to Q, (P∧Q)→R(P \land Q) \to R, ¬P→Q\neg P \to Q.
steps
1. Negate the antecedent (the part before the arrow), with brackets if it is compound.
2. Join it to the consequent with ∨\lor.
Statement
P→Q≡¬P∨QP \to Q \equiv \neg P \lor Q
worked example
(P∧Q)→R≡¬(P∧Q)∨R≡¬P∨¬Q∨R(P \land Q) \to R \equiv \neg(P \land Q) \lor R \equiv \neg P \lor \neg Q \lor R
II

Truth tables, equivalences and normal forms

Composite · each opens its own page
How to build a truth tableList all 2n2^n rows, add one column per subformula from the inside out, and fill each column with the rule of its connective.uses: connective truth tables · subformulas · 2^n rowsComposite5 steps · 3 examplesHow to check whether a formula is a tautologyShow a formula is true in every row: build its truth table, or assume one row makes it false and reach a clash.uses: truth table · counterexample row · assume it is falseComposite4 steps · 3 examplesHow to check whether a formula is a contradictionShow a formula is false in every row with a truth table, or reduce it with the laws to a clash of the form A∧¬AA \land \neg A.uses: truth table · law of non-contradiction · De MorganComposite4 steps · 3 examplesHow to prove two formulas are equivalent with a truth tableTabulate both formulas over the same 2n2^n rows and compare the final columns; one mismatched row disproves the equivalence.uses: truth table · column comparison · counterexample rowComposite4 steps · 3 examplesHow to prove an equivalence with the laws of logicTransform one side into the other with named laws: remove arrows, push negations inward, then distribute and collapse.uses: material implication · De Morgan · distributive laws · complement and identity lawsComposite5 steps · 3 examplesHow to simplify a logical expressionRemove arrows, push negations onto letters, then factor and collapse with the complement, identity and absorption laws.uses: material implication · De Morgan · distributive laws · absorptionComposite6 steps · 3 examplesHow to convert a formula to conjunctive normal formRewrite as an and of or-clauses: remove arrows, push negations onto letters, then distribute or over and.uses: material implication · De Morgan · distributive law of or over andComposite5 steps · 3 examplesHow to convert a formula to disjunctive normal formRewrite as an or of and-terms: remove arrows, push negations onto letters, then distribute and over or.uses: material implication · De Morgan · distributive law of and over orComposite4 steps · 3 examplesHow to negate a conditional statementThe negation of P→QP \to Q is P∧¬QP \land \neg Q: keep the condition, deny the conclusion, and join them with and.uses: material implication · De Morgan · double negationComposite4 steps · 3 examplesHow to write the converse, inverse and contrapositiveSwap the parts for the converse, negate both for the inverse, do both for the contrapositive; only the contrapositive keeps the meaning.uses: contrapositive equivalence · double negation · truth tableComposite5 steps · 3 examplesHow to draw the parse tree of a formulaFind the main connective by precedence, make it the root, and split each part the same way until only letters remain.uses: operator precedence · main connective · subformulasComposite5 steps · 3 examples
III

Choosing a method

Strategy