100% found this document useful (2 votes)
71 views1 page

MFCS Relations 1

PDF copy of implications and equivalence relations

Uploaded by

api-26548538
Copyright
© Attribution Non-Commercial (BY-NC)
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
100% found this document useful (2 votes)
71 views1 page

MFCS Relations 1

PDF copy of implications and equivalence relations

Uploaded by

api-26548538
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 1

Mathematical Foundation of Computer Science – Equivalence & Implication Relations

Implications

I1 P∧Q ⇒P Simplification
I2 P∨Q⇒Q ,,
I3 P ⇒P∨Q Addition
I4 Q⇒P∨Q ,,
I5 7P ⇒ P → Q
I6 Q⇒P →Q
I7 7(P → Q) ⇒ P
I8 7(P → Q) ⇒ 7Q
I9 P, Q ⇒ P ∧ Q
I10 7P, P ∨ Q ⇒ Q Disjunctive Syllogism
I11 P,P → Q ⇒ Q Modus Ponens
I12 7Q,P → Q ⇒ 7P Modus Tollens
I13 P → Q, Q → R ⇒ P → R Hypothetical Syllogism
I14 P ∨ Q ,P → R, Q → R ⇒ R Dilemma

Equivalences

E1 7(7P) ⇔ P Double Negation


E2 P ∧Q ⇔ Q ∧P Commutative law
E3 P∨Q ⇔ Q∨P ,,
E4 (P ∧ Q) ∧ R ⇔ P ∧ (Q ∧ R) Associative law
E5 (P ∨ Q) ∨ R ⇔ P ∨ (Q ∨ R) ,,
E6 P ∧ (Q ∨ R) ⇔ (P ∧ Q) ∨ (P ∧ R) Distributive law
E7 P ∨ (Q ∧ R) ⇔ (P ∨ Q) ∧ (P ∨ R) ,,
E8 7(P ∧ Q) ⇔ 7P ∨ 7Q De’ Morgon’s law
E9 7(P ∨ Q) ⇔ 7P ∧ 7Q ,,
E10 P ∧P ⇔ P
E11 P ∨P ⇔ P
E12 R ∨ (P ∧ 7P) ⇔ R
E13 R ∧ (P ∨ 7P) ⇔ R
E14 R ∨ (P ∨ 7P) ⇔ T
E15 R ∧ (P ∧ 7P) ⇔ F
E16 P → Q ⇔ 7P ∨ Q
E17 7(P → Q) ⇔ P ∧ 7Q
E18 P → Q ⇔ 7Q → 7P
E19 P → (Q → R) ⇔ (P ∧ Q) → R
E20 7(P ↔ Q) ⇔ P ↔ 7Q
E21 P ↔ Q ⇔ (P → Q) ∧ (Q → P)
E22 P ↔ Q ⇔ (P ∧ Q) ∨ (7P ∧ 7Q)
E23 P ∨ F ⇔ P, P ∧ T ⇔ P
E24 P ∨ T ⇔ T, P ∧ F ⇔ F
E25 P ∨ (P ∧ Q) ⇔ P Absorption law
E26 P ∧ (P ∨ Q) ⇔ P ,,

CVR College of Engineering Srikanth

You might also like