Lab 03 Propositional Equivalences

Objective
Solving exercises from the textbook in chapter 1.3
Noora Amer
Current Lab Learning Outcomes (LLO)
By completion of the lab, the students should be able to: 2006056
1. Understand propositional equivalences and .
2. prove the propositional equivalences using rules

Lab Requirements
Students allowed using their lecture notes in the lab in order to solve the exercises.

Lab Assessment
1- Divide students to groups and let them to solve the given example.
2- Discuss the answers with the groups and write on board the optimal solution.
Lab Description

1. Show that ￢(p ∨ ￢(p ∧ q)) is contradiction using rules.

-
(P rn ( p ng ))
law
( ( p ng )) Demorgan
=
Tpr - n

=
np r ( Png ) double negation
=
( n pnp ) nq Associative
=
F n
q negative
F and commutative
=
Domination

2. show that [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r is a tautology using rules

=
( ( PV 9) ( Tp ) ) implication
n vr n
(nqvr ) → r

= ( ( pvq ) nccnprnq) distributive

✓ ry
) → r

dem organ
=
(( pvq ) n
( n ( pug ) ur
] → r

=
[ ccpvq ) n n ( pug ) v ( ( pug ) nr )) → r distributive

[F
=
x ( ( pug ) nr
)) → r
Negation
=[ cfpvq ) n r
] - r

Identity
=
7
( ( pug ) n r
)
) ur implication
=
[ ncpvq ) v tr
) ur
dem organ

= n ( pug ) v
[ - r v r ]
Associative
= n ( pvq ) v T
Negation
=
T
Domination
 3. Show that [p ^ (p → q)] → q is a tautology using rules
⇐
[ Pr [ -
pvq) ) →
q implication
=
( ( pnnp) v
[ pnq)) →
q distributive

⇐
( f v ( Png)) -
q Negation

=
( Png) →
q Identity
= 7 ( prey) Vg, um
plication
Tp
=
v
ng vq demorgan
=
Tpv ( qvnq ) Associative

= T
p v T Negation
= T Domination

4. Show that [¬p ∧ (p ∨ q)] → q is a tautology using rules.

5. Show that ¬ p→ (q → r) and q →( p v r) are logically equivalent using rules.

⑨
p v ( q → r ) implication
Tp
→ (g - r ) = -77

implication ) double negation

= >
( np ) ✓ ( q → r )
=
p ✓ (q → r

= pv (
-
q
v r ) implication
=
pv (q - r
) double negation
q)
=p v ( r v - commutative
= Pv -
q
ur implication
v v r commutative = (pur ) v n
q Associative
=
Tq p

= q →
Ep Vr ) Implication I
Tq
V ( pur ) commutative

= of → ( pvr ) Implication
6. Show that ¬p ↔ q and p ↔ ¬q are logically equivalent using rules















7. Determine whether¬(p∨(¬p∧q)) and (¬p ∧ ¬q) equivalent using rules?