Scribd
Upload
2 views

Tutorial 1 Week 2

The document outlines a tutorial for Islington College's MA4001 module on Logic and Problem Solving, focusing on constructing truth tables and proving logical equivalences. It includes exercises on various propositions, demonstrating their relationships and equivalences using truth tables and propositional laws. The tutorial aims to help students understand fundamental concepts in logic through practical application.

Uploaded by

bobby mahat
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Tutorial 1 Week 2

The document outlines a tutorial for Islington College's MA4001 module on Logic and Problem Solving, focusing on constructing truth tables and proving logical equivalences. It includes exercises on various propositions, demonstrating their relationships and equivalences using truth tables and propositional laws. The tutorial aims to help students understand fundamental concepts in logic through practical application.

Uploaded by

bobby mahat
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Islington College, Kathmandu

Module Code MA4001: Logic and problem solving


Tutorial (1): Week 2
Time: 1 hour

1. Construct truth tables for the following propositions.


a. p → q
b. (p ↔ q) → r
c. [(p  q)  r] → [q  (q  r) ]
d. ¬ [ (p  q)  r ) ]  [ p  (q  r) ]
e. (p  q) ↔ (q  p)

2. Using truth table, prove that the following propositions are equivalent.
a. p  q ≡ q  p
b. p  (q  r) ≡ (p  q)  r
c. p  (q  r) ≡ (p  q)  (p  r)
d. p  FALSE ≡ p
e. p  ¬p ≡ FALSE
f. ¬ (p  (¬ p  q)) ≡ (¬ p  ¬ q)

3. Using the truth table, show that p → (q  r) ≡ (p → q)  (p → r).

4. Using the propositional laws, check whether the propositions ¬(p ∨ (¬p ∧ q)) and ¬p ∧ ¬q are
logically equivalent.

5. Using the Propositional laws, prove the following equivalences.


a. (p  q)  ¬ q ≡ (¬ q  p)
b. (p  q)  (¬ p  q) ≡ q
c. [(p  q)  ¬ q]  (p  q) ≡ p
d. (p  q)  (p   q) ≡ p
e. (p  q)  (p   q) ≡ p

6. Show that the statement (p  q)  [ p   q] is a contradiction using propositional laws.

7. Show that the statement [(p  ¬ q)  ¬ p]  q is a tautology using propositional laws.

8. Using the truth table, show that p → q ≡ ¬p ∨ q are logically equivalent.

9. Using the relation p → q ≡ ¬p ∨ q (see question 8), show that (p ∧ q) → (p ∨ q) is a tautology.

End of Tutorial

You might also like