Truth Table Calculator

Type a logic statement to see its full truth table.

Variables are single letters. Use and, or, not, xor, implies, iff, or the symbols ∧ ∨ ¬ ⊕ → ↔, and brackets.

Try

Result

You entered(A→B)↔(¬A∨B)(A \to B) \leftrightarrow (\lnot A \lor B)

Tautology: true in all 4 rows\displaystyle \text{Tautology: true in all 4 rows}

Truth table

ABA→B¬A¬A∨B(A→B)↔(¬A∨B)TTTFTTTFFFFTFTTTTTFFTTTT\displaystyle \begin{array}{cc|cccc} A & B & A \to B & \lnot A & \lnot A \lor B & (A \to B) \leftrightarrow (\lnot A \lor B) \\ \hline \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{F} & \mathrm{T} & \mathrm{T} \\ \mathrm{T} & \mathrm{F} & \mathrm{F} & \mathrm{F} & \mathrm{F} & \mathrm{T} \\ \mathrm{F} & \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{T} \\ \mathrm{F} & \mathrm{F} & \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{T} \end{array}

Minterms

(A∧B)∨(A∧¬B)∨(¬A∧B)∨(¬A∧¬B)\displaystyle (A \land B) \lor (A \land \lnot B) \lor (\lnot A \land B) \lor (\lnot A \land \lnot B)
Show the work
  1. Truth table

    The statement uses 2 variables, so there are 22=42^{2} = 4 rows, one for each way of making each variable true (T\mathrm{T}) or false (F\mathrm{F}). The rows run in the standard order: all true at the top, all false at the bottom.

    ABA→B¬A¬A∨B(A→B)↔(¬A∨B)TTTFTTTFFFFTFTTTTTFFTTTT\begin{array}{cc|cccc} A & B & A \to B & \lnot A & \lnot A \lor B & (A \to B) \leftrightarrow (\lnot A \lor B) \\ \hline \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{F} & \mathrm{T} & \mathrm{T} \\ \mathrm{T} & \mathrm{F} & \mathrm{F} & \mathrm{F} & \mathrm{F} & \mathrm{T} \\ \mathrm{F} & \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{T} \\ \mathrm{F} & \mathrm{F} & \mathrm{T} & \mathrm{T} & \mathrm{T} & \mathrm{T} \end{array}
  2. Implication (implies)

    A→BA \to B is false only when AA is true and BB is false.

    A→B: T, F, T, TA \to B:\ \mathrm{T},\ \mathrm{F},\ \mathrm{T},\ \mathrm{T}
  3. Negation (not)

    ¬A\lnot A is true exactly when AA is false, and false when it is true.

    ¬A: F, F, T, T\lnot A:\ \mathrm{F},\ \mathrm{F},\ \mathrm{T},\ \mathrm{T}
  4. Disjunction (or)

    ¬A∨B\lnot A \lor B is false only when both ¬A\lnot A and BB are false.

    ¬A∨B: T, F, T, T\lnot A \lor B:\ \mathrm{T},\ \mathrm{F},\ \mathrm{T},\ \mathrm{T}
  5. Biconditional (if and only if)

    (A→B)↔(¬A∨B)(A \to B) \leftrightarrow (\lnot A \lor B) is true when A→BA \to B and ¬A∨B\lnot A \lor B have the same truth value.

    (A→B)↔(¬A∨B): T, T, T, T(A \to B) \leftrightarrow (\lnot A \lor B):\ \mathrm{T},\ \mathrm{T},\ \mathrm{T},\ \mathrm{T}
  6. Result

    The last column is true in every row, so the statement is a tautology: it is always true.

Worked examples