CSE 1101- Discrete Mathematics for Computer Science Assignment 2

(Last Name, First Name): _____________________________________ USI: ______________________

Logic
1. The proposition p ⊕q is read as “p or q but not BOTH”
a) Write a proposition logically equivalent to p ⊕q using only the logical connectives →, ￢, and ∨.
b) Draw a truth table to show that the two propositions are indeed logically equivalent.

2. Find examples of formulae with the following characteristics. Explain why your formula is a correct example.
a) Find an example of a formula with at least one quantifier that is false when we quantify over the natural
numbers N, but true when we quantify over the rational numbers Q.
b) Find an example of a formula with one ∀ quantifier and one ∃ quantifier that is true. But also, your formula
should become false when we replace the ∀ quantifier with an ∃ quantifier and the ∃ quantifier with a ∀
quantifier.

3. Use rules of inference to show that if ∀ x ( P ( x ) → ( Q ( x ) ∧ S ( x ) ) ) and ∀ x ( P ( x ) ∧ R ( x ) ) are true, then

∀ x ( R ( x ) ∧ S ( x ) ) is true.

4.

Total: 20 marks (2%)

Submission:

- Due Date: On or before Wednesday, 9th October, 2019, 23:59 hrs

- Format: Soft copy, All screenshots must be inserted in this document. Rename this document to :
“Last Name, First Name, Course Code, Assignment 1”. Example: Baksh, Aarif, CSE 1101, Assignment 1.
- Medium: Email to aarif.baksh@yahoo.com with subject “CSE 1101”

1|Page
Course Instructor: A. Baksh