Scribd
Upload
29 views2 pages

Math015 Rules

This document outlines various rules of equivalence and inference for propositional logic. It defines six equivalence laws including identity, idempotent, complement, double negation, absorption, and De Morgan's laws. It also defines commutative, associative, and distributive laws. Rules of inference include modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, simplification, conjunction, and addition. Material implication, equivalence, and XOR are also defined.

Uploaded by

Arjie Dela Cruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

Math015 Rules

This document outlines various rules of equivalence and inference for propositional logic. It defines six equivalence laws including identity, idempotent, complement, double negation, absorption, and De Morgan's laws. It also defines commutative, associative, and distributive laws. Rules of inference include modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, simplification, conjunction, and addition. Material implication, equivalence, and XOR are also defined.

Uploaded by

Arjie Dela Cruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Rules of Equivalence

_____________________________________________________________________________
(A.1) Annulment Law (A.2) Identity Law (A.3) Idempotent Law
𝑃∨1≡ 1 𝑃∨0≡ 𝑃 𝑃∨𝑃 ≡𝑃
𝑃∧0≡ 0 𝑃∧1≡ 𝑃 𝑃∧𝑃 ≡𝑃

(A.4) Complement Law (A.5) Double Negation Law (A.6) Absorption Law
𝑃 ∨ ¬𝑃 ≡ 1 ¬(¬𝑃) ≡ 𝑃 𝑃 ∨ (𝑃 ∧ 𝑄) ≡ 𝑃
𝑃 ∧ ¬𝑃 ≡ 0 𝑃 ∧ (𝑃 ∨ 𝑄) ≡ 𝑃
_____________________________________________________________________________
(B.1) Associative Law (B.4) De Morgan’s Laws
𝑃 ∨ (𝑄 ∨ 𝑅) ≡ (𝑃 ∨ 𝑄) ∨ 𝑅 ¬(𝑃 ∨ 𝑄) ≡ ¬𝑃 ∧ ¬𝑄
𝑃 ∧ (𝑄 ∧ 𝑅) ≡ (𝑃 ∧ 𝑄) ∧ 𝑅 ¬(𝑃 ∧ 𝑄) ≡ ¬𝑃 ∨ ¬𝑄
(B.2) Commutative Law (B.5) Contrapositive Law
𝑃∨𝑄 ≡ 𝑄∨𝑃 𝑃 → 𝑄 ≡ ¬𝑄 → ¬𝑃
𝑃∧𝑄 ≡ 𝑄∧𝑃
(B.3) Distributive Law
𝑃 ∨ (𝑄 ∧ 𝑅) ≡ (𝑃 ∨ 𝑄) ∧ (𝑃 ∨ 𝑅)
𝑃 ∧ (𝑄 ∨ 𝑅) ≡ (𝑃 ∧ 𝑄) ∨ (𝑃 ∧ 𝑅)
_____________________________________________________________________________
(C.1) Material Implication (C.2) Material Equivalence
𝑃 → 𝑄 ≡ ¬𝑃 ∨ 𝑄 𝑃 ↔ 𝑄 ≡ (𝑃 → 𝑄) ∧ (𝑄 → 𝑃)

(C.3) Equivalent of XOR


𝑃 ⊕ 𝑄 ≡ (𝑃 ∧ ¬𝑄) ∨ (¬𝑃 ∧ 𝑄)
_____________________________________________________________________________
Rules of Inference
_____________________________________________________________________________
Standard Form if-then Form
_____________________________________________________________________________
(MP) Modus Ponens 𝑃→𝑄 [(𝑃 → 𝑄) ∧ 𝑃] ⇒ 𝑄
𝑃
̅̅̅̅̅̅̅̅̅
∴𝑄
_____________________________________________________________________________
(MT) Modus Tollens 𝑃→𝑄 [(𝑃 → 𝑄) ∧ ¬𝑄] ⇒ ¬𝑃
¬𝑄
̅̅̅̅̅̅̅̅̅
∴ ¬𝑃
_____________________________________________________________________________
(HS) Hypothetical Syllogism 𝑃→𝑄 [(𝑃 → 𝑄) ∧ (𝑄 → 𝑅)] ⇒ (𝑃 → 𝑅)
𝑄→𝑅
̅̅̅̅̅̅̅̅̅̅̅
∴𝑃→𝑅
_____________________________________________________________________________
(DS) Disjunctive Syllogism 𝑃∨𝑄 [(𝑃 ∨ 𝑄) ∧ ¬𝑄] ⇒ 𝑃
¬𝑄
̅̅̅̅̅̅̅̅
∴ 𝑃
𝑃∨𝑄 [(𝑃 ∨ 𝑄) ∧ ¬𝑃] ⇒ 𝑄
¬𝑃
̅̅̅̅̅̅̅̅
∴ 𝑄
_____________________________________________________________________________
(Simp.) Simplification 𝑃∧𝑄 (𝑃 ∧ 𝑄) ⇒ 𝑃
̅̅̅̅̅̅̅
∴𝑃
𝑃∧𝑄 (𝑃 ∧ 𝑄) ⇒ 𝑄
̅̅̅̅̅̅̅̅
∴ 𝑄
_____________________________________________________________________________
(Conj.) Conjunction 𝑃 (𝑃 ∧ 𝑄) ⇒ (𝑃 ∧ 𝑄)
𝑄
̅̅̅̅̅̅̅̅̅̅
∴𝑃∧𝑄
_____________________________________________________________________________
(Add.) Addition 𝑃 𝑃 ⇒ (𝑃 ∨ 𝑄)
̅̅̅̅̅̅̅̅̅̅
∴𝑃∨𝑄
_____________________________________________________________________________

You might also like