Proposition is a statement that is either true or false.

Original p→qp \to q
Contrapositive ¬q→¬p\neg q \to \neg p
Converse q→pq \to p
Inverse ¬p→¬q\neg p \to \neg q
pp qq p→qp \to q
T T T
T F F
F T T
F F T

Logical equivalences

De Morgan’s ¬(p∧q)≡¬p∨¬q\neg(p \land q) \equiv \neg p \lor \neg q ¬(p∨q)≡¬p∧¬q\neg(p \lor q) \equiv \neg p \land \neg q
Conversion Theorem p→q≡¬p∨qp \to q \equiv \neg p \lor q
Commutativity p∧q≡q∧pp \land q \equiv q \land p
Double negation ¬(¬p)≡p\neg(\neg p) \equiv p
Idempotent p∧p≡pp \land p \equiv p p∨p≡pp \lor p \equiv p
Absorption p∨(p∧q)≡pp \lor (p \land q) \equiv p p∧(p∨q)≡pp \land (p \lor q) \equiv p
Distributivity p∨(q∧r)≡(p∨q)∧(p∨r)p \lor (q \land r) \equiv (p \lor q) \land (p \lor r) p∧(q∨r)≡(p∧q)∨(p∧r)p \land (q \lor r) \equiv (p \land q) \lor (p \land r)

Inference rules

Modus Ponens p→qp \to q pp ∴q\therefore q
Modus Tollens p→qp \to q ¬q\neg q ∴¬p\therefore \neg p
Conjunctive simplification p∧qp \land q ∴p\therefore p
Conjunctive addition pp qq ∴p∧q\therefore p \land q
Disjunctive syllogism p∨qp \lor q ¬p\neg p ∴q\therefore q
Disjunctive addition pp ∴p∨q\therefore p \lor q
Hypothetical syllogism p→qp \to q q→rq \to r ∴p→r\therefore p \to r

To show some statement/argument is valid, either truth table or logical equivalences or counterexample.

Common questions

Logical inference

Determine if this argument is valid:

Truth table

Counter example for invalid argument

Determine if this argument is valid: