Scribd
Upload
3 views1 page

Tutorial 1

This document outlines a tutorial for a Discrete Mathematics and Linear Algebra course, focusing on logical expressions and their properties. It includes exercises on negation, tautologies, symbolic translation, and logical equivalences. The tutorial aims to assess students' understanding of various logical statements and connectives.

Uploaded by

connect.adityasrivastava
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Tutorial 1

This document outlines a tutorial for a Discrete Mathematics and Linear Algebra course, focusing on logical expressions and their properties. It includes exercises on negation, tautologies, symbolic translation, and logical equivalences. The tutorial aims to assess students' understanding of various logical statements and connectives.

Uploaded by

connect.adityasrivastava
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1

WINTER 2025-2026

BAMAT205 - DISCRETE MATHEMATICS AND LINEAR ALGEBRA

Module-1 : Tutorial -1
(To access the students’ understanding on various statements and connectives)
20 December, 2025

1. Write the negation of the following sentences.

(i) Some pilots are pirates.


(ii) All of the businesses are closed.
(iii) I am careful or I make mistakes.
(iv) You study or you don’t get a good grade.
(v) If today is Thanksgiving, then tomorrow is Friday.

2. Prove that the following logical expressions is a tautology.

(i) [(P ∨ Q) ∧ ¬P ] → Q
(ii) (P → Q) ↔ (¬Q → ¬P )
(iii) (P → Q) ↔ (¬P ∨ Q)
(iv) [(P → Q) ∧ (Q → R)] → (P → R)
(v) (P ⊕ Q) ↔ [(P ∨ Q) ∧ ¬(P ∧ Q)]

3. Translate the following English statements into symbolic form (use propositional sentences).

(i) I will not pass this class unless I go to class every day and do all of the homework exercises.
(ii) I lock the doors and close the windows whenever I leave to go to work.
(iii) Getting up on time and getting ready quickly is sufficient for arriving at work on time.
(iv) Practicing an hour a day and getting private lessons twice a week is necessary for playing in the
wind ensemble.

4. Find the converse, inverse and contrapositive for the following statements.

(i) If two planes intersect, then their intersection is a line.


(ii) If a person has driving license, then that person’s age is at least 18.
(iii) If you brush your teeth, then you will not get cavities.
(iv) If a fruit is red, then it is an apple.
(v) If it snows, then school will be cancelled.
(vi) If you add two odd numbers, then their sum is even.

5. Show that ¬(P ⊕ Q) and P ↔ Q are logically equivalent.


6. Show that ¬P → (Q → R) and Q → (P ∨ R) are logically equivalent.
7. Show that (P ∨ Q) ∧ (¬P ∨ R) → (Q ∨ R) is a tautology.
8. Show that (P → Q) → R and P → (Q → R) are not logically equivalent.
9. Show that (P → Q) → (R → S) and (P → R) → (Q → S) are not logically equivalent.
10. Show that (P ∧ Q) → R and (P → R) ∧ (Q → R) are not logically equivalent.

Common questions

Powered by AI

Constructing truth tables for each expression shows that they do not have the same truth values under all conditions. Specifically, when P is true, Q is false, and R is true, the first expression is true while the second is false, proving non-equivalence.

The converse of the statement is 'If a person's age is at least 18, then that person has a driving license.' The inverse is 'If a person does not have a driving license, then that person's age is less than 18.' The contrapositive is 'If a person's age is less than 18, then that person does not have a driving license.'

Let P represent 'I go to class every day' and Q represent 'I do all of the homework exercises'. The statement can be translated to '¬(PassClass) → (P ∧ Q)' using propositional logic.

A truth table shows that for certain truth assignments of P, Q, R, and S, specifically when P is true, Q and R are false, and S is true, the first expression is false but the second is true, demonstrating non-equivalence.

(P ∧ Q) → R requires that R is true when both P and Q are true, whereas (P → R) ∧ (Q → R) allows for R to be false if one of P or Q is false. This difference in conditions for truth value accounts for their non-equivalence, as shown through truth tables.

The negation of the statement 'Some pilots are pirates' would be 'No pilots are pirates' or 'All pilots are not pirates.' This negation expresses that the possibility of any pilot being a pirate is eliminated.

The expression ¬P → (Q → R) can be rewritten as ¬P ∨ (¬Q ∨ R), which simplifies to (P ∨ Q) → R. Both expressions evaluate to true for the same truth assignments, establishing their logical equivalence.

Constructing a truth table reveals that for every possible combination of truth values for P, Q, and R, the statement (P ∨ Q) ∧ (¬P ∨ R) inevitably leads to (Q ∨ R) being true, confirming that it is a tautology.

To demonstrate that [(P ∨ Q) ∧¬P] → Q is a tautology, construct a truth table. The expression [(P ∨ Q) ∧¬P] can only be true if Q is true (since P is false and at least one of P or Q must be true). Therefore, the implication is always true, making it a tautology.

Using the definition of exclusive OR (⊕), P ⊕ Q is true if and only if P and Q have opposite truth values. Therefore, ¬(P ⊕ Q) is true when P and Q have the same truth values, which is the same definition as the biconditional P ↔ Q. Hence, ¬(P ⊕ Q) and P ↔ Q are logically equivalent.

You might also like