Discrete Math Tutor

Logic / Argument Forms

Least You Need to Know: Argument Forms

A valid argument form guarantees the conclusion whenever the premises are true. Learn the classic valid forms and the common traps.

The least you need to know

Key notation

p → q if p then q
¬q not q
therefore
p premise or conclusion statement

Tiny worked example

  • Premises: `p → q`, `q → r`, and `p`.
  • First use modus ponens to get `q`.
  • Then use modus ponens again to get `r`.
  • So the chained argument is valid.

Common mistakes

How to recognize this kind of problem

Start practice