Beruflich Dokumente
Kultur Dokumente
Propositional Functions
Propositional Equivalence
Logically Equivalent
• Two compound propositions p and q are logically equivalent if p↔q is a
tautology.
• We write this as p⇔q or as p≡q where p and q are compound propositions.
• Two compound propositions p and q are equivalent if and only if the columns
in a truth table giving their truth values agree.
• This truth table shows that ¬p ∨ q is equivalent to p → q.
p q ¬p ¬p ∨ q p→ q
T T F T T
T F F F F
F T T T T
F F T T T
2.2 Logical Equivalence: The Laws of Logic
( 5) p ( q r ) ( p q ) ( p r ) Distributive Law
p ( q r ) ( p q) ( p r )
( 6) p p p , p p p Idempotent Law
( 7 ) p F0 p , p T0 p Identity Law
( 8) p p T0 , p p F0 Inverse Law
( 9 ) p T0 T0 , P F0 F0 Domination Law
(10) p ( p q ) p , p ( p q ) p Absorption Law
Equivalence Proofs
Example: Show that
is logically equivalent to
Solution:
If Conditional statement is P →Q then
its Inverse or Opposite is ~P→~Q
its Converse is Q→P
its Contra positive is ~Q→~P