Symbolic Hypotheses
- 1
p ∨ q - 2
p → r - 3
q → s - 4
¬t - 5
s → t
Discrete Mathematics Interactive Lab
Learn the eight core propositional-logic inference rules progressively, see how each rule transforms premises into conclusions, and practice arranging a complete proof.
Progressive Reveal
Each rule is a reusable proof move. A valid argument is one where the truth of all premises guarantees the truth of the conclusion.
Concrete Examples
The goal is not to memorize names alone. A student should learn to translate, spot the template, and cite the exact rule used.
Full Proof Walkthrough
The solution first removes the office possibility, then uses the remaining breakfast possibility to locate the checkbook.
Symbolic Hypotheses
p ∨ qp → rq → s¬ts → t