CS381 Review 3: Gongjun Yan

Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

CS381 Review 3

Gongjun Yan
Implication (Conditional Statement)
• ( P ->( Q ->R ) )  ( P^ Q ) ->R ) be proven by
using identities as follows:
( P ->( Q ->R ) )  ~P v ( Q-> R )
 ~Pv ( ~Qv R )  ( ~P v ~Q ) v R
 ~( P^ Q )v R  ( P^ Q )-> R
Contrapositive
• p  q  ~q  ~p
• Test
Converse
• p→q
– If Paula is here, then Quincy is here.
 Converse:
 q→p
 If Quincy is here, then Paula is here.
Inverse:
~p → ~q
If Paula is not here, then Quincy is not here.
Translation to if-then form (p → q)
• If p , then q.
• p implies q.
• If p, q.
• p only if q.
• p is sufficient for q.
• q if p.
• q whenever p.
• q is necessary for p.
• It is necessary for p that q.
Biconditional
• pq
• p  q  (p  q)  (q  p)
• p  q  (~p  q)  (~q  p)

p q pq
1 1 1
1 0 0
0 1 0
0 0 1
Rules of Inference
Modus Ponens Modus Tollens Disjunctive Syllogism
pq pq pq pq
p ~q ~q ~p
q  ~p p q
Disjunctive Addition Conjunctive Simplification Rule of Contradiction

p q p^q p^q ~p  c
pq pq p q p
Hypothetical Syllogism Conjunctive Addition Dilemma

pq
pq p
pr
qr q
qr
pr p^q
r
4 September 2008 Introduction & Propositional Logic 7
Concepts
• Contrapositive
• Converse
• Inverse
• Translation to p->q , p<->q
• Biconditional
• Rules of Inference
Notice
• Homework 2 and 3 have the same due date.

You might also like