Math Logic

Formulae

Year 2 · Semester ILast updated

Sentential Logic

Equivalences

Name Formula Notes
E1 R∨T  ⟺  TR \lor \Bbb T \iff \Bbb T
E2 R∨F  ⟺  RR \lor \Bbb F \iff R
E3 R∧F  ⟺  FR \land \Bbb F \iff \Bbb F
E4 R∧T  ⟺  RR \land \Bbb T \iff R
E5 R∨R  ⟺  RR \lor R \iff R Idempotent Law
E6 R∧R  ⟺  RR \land R \iff R Idempotent Law
E7 R∨(¬R)  ⟺  TR \lor (\neg R) \iff \Bbb T Tautology
E8 R∧(¬R)  ⟺  FR \land (\neg R) \iff \Bbb F Contradiction
E9 ¬(¬R)  ⟺  R\neg (\neg R) \iff R Double Negation Law
E10 R∨S  ⟺  S∨RR \lor S \iff S \lor R Commutative Law
E11 R∧S  ⟺  S∧RR \land S \iff S \land R Commutative Law
E12 R∨(S∨Q)  ⟺  (R∨S)∨QR \lor (S \lor Q) \iff (R \lor S) \lor Q Associative Law
E13 R∧(S∧Q)  ⟺  (R∧S)∧QR \land (S \land Q) \iff (R \land S) \land Q Associative Law
E14 R∨(S∧Q)  ⟺  (R∨S)∧(R∨Q)R \lor (S \land Q) \iff (R \lor S) \land (R \lor Q) Distributive Law
E15 R∧(S∨Q)  ⟺  (R∧S)∨(R∧Q)R \land (S \lor Q) \iff (R \land S) \lor (R \land Q) Distributive Law
E16 ¬(R∨S)  ⟺  (¬R)∧(¬S)\neg (R \lor S) \iff (\neg R) \land (\neg S) De Morgan’s Law
E17 ¬(R∧S)  ⟺  (¬R)∨(¬S)\neg (R \land S) \iff (\neg R) \lor (\neg S) De Morgan’s Law
E18 R∨(R∧S)  ⟺  RR \lor (R \land S) \iff R Absorption Law
E19 R∧(R∨S)  ⟺  RR \land (R \lor S) \iff R Absorption Law
E20 R→S  ⟺  (¬R)∨SR \rightarrow S \iff (\neg R) \lor S Implication Law
E21 R→S  ⟺  (¬S)→(¬R)R \rightarrow S \iff (\neg S) \rightarrow (\neg R) Contrapositive Law
E22 R↔S  ⟺  (R→S)∧(S→R)R \leftrightarrow S \iff (R \rightarrow S) \land (S \rightarrow R) Biconditional Law
E23 R→(S→Q)  ⟺  (R∧S)→QR \rightarrow (S \rightarrow Q) \iff (R \land S) \rightarrow Q Exportation Law