→ ¬ q¿ ∧ ¿ → ¬ r¿ ≡ ¬ ¿ ⋀ ¿ ∨ r ¿¿

T F F T F T F F T F T F T T T
T F F T F T T T F F T F T T F
T T T F F T F F T F T F F T T
T T T F T T T T F F T T F F F
F T F T T F T F T T F T T T T
F T F T T F T T F T F T T T F
F T T F T F T F T T F T F T T
F T T F T F T T F T F T F F F
GEC104: B6 – 6
Test I Item 3: ( p →¬ q ) ∧ ( p →¬ r ) ≡ ¬[ p ∧ ( q ∨ r ) ]

Therefore, they are logically equivalent.

GEC104: B6 – 6
Test II Item 3: [ p ∧¬ ( ¬ p ∨ q ) ] ∨ ( p∧ q ) ≡ p

Proof:

[ p ∧¬ ( p ∨q ) ] ∨ ( p ∧ q ) ≡ [ p ∧ ( p∧ ¬q ) ] ∨( p ∧q) - Double Negation

De Morgan’s Law
≡ [( p ∧ p ) ∧¬ q ] ∨( p ∧ q) - Associative Law’s

≡ ( p ∧¬ q ) ∨( p ∧ q) - Idempotent Law’s
≡ p ∧(¬q ∨ q) - Distributive Law’s
≡ p ∧T - Negative Law’s
≡p - Identity Law’s