You are on page 1of 1

Cosme García C.

Bilingual School
Danli, El Paraíso

SYMBOLIC LOGIC – 11th Grade – Second Term


Instructor: Nelson Salgado, BSc.

ASSESSMENT PRACTICE #1: TRUTH TABLES, LOGICAL EQUIVALENCE,


TAUTOLOGIES AND CONTRADICTIONS (20%)
Due on Thursday, May 20

General Directions: Write and solve each exercise. Upload the assignment into Google Classroom.

1. Show that each of these conditional statements is a tautology by using truth tables.
a) [¬p ∧ (p ∨ q)] → q

b) [(p → q) ∧ (q → r)] → (p → r)

c) [p ∧ (p → q)] → q

d) [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r

2. Prove the equivalence of the compound propositions: p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)

3. Show that ¬p → (q → r) and q → (p ∨ r) are logically equivalent

4. Show that (p ∧ q) → r and (p → r) ∧ (q → r) are not logically equivalent

You might also like