Discrete Math Tutor

Logic / Truth Tables

Least You Need to Know: Truth Tables and Equivalence

Truth tables let you compare two statements **row by row**. Two statements are logically equivalent when they match on **every** row.

The least you need to know

Key notation

¬p not p
p ∧ q p and q
p ∨ q p or q
p → q if p then q
p ↔ q p if and only if q

Tiny worked example

  • Compare `p → q` with `¬p ∨ q`.
  • In every row of the truth table, these columns match.
  • So `p → q` and `¬p ∨ q` are logically equivalent.

Common mistakes

How to recognize this kind of problem

Start practice