Assignment 6

Abhinav Pradeep
Tutorial group 12
August 18, 2023

1 Question 1.
∼ ((p → q) ∧ (p → r)) ≡ p ∧ (∼ q∨ ∼ r)

∼ ((p → q) ∧ (p → r)) ≡ p ∧ (∼ q∨ ∼ r)
∼ ((∼ p ∨ q) ∧ (∼ p ∨ r)) ≡ p ∧ (∼ q∨ ∼ r) Representation of If-Then As Or
∼ (∼ p ∨ (q ∧ r)) ≡ p ∧ (∼ q∨ ∼ r) Distributive Law
∼∼ p ∧ ∼ (q ∧ r) ≡ p ∧ (∼ q∨ ∼ r) De Morgan’s Law
p ∧ ∼ (q ∧ r) ≡ p ∧ (∼ q∨ ∼ r) Double Negative
p ∧ (∼ q∨ ∼ r) ≡ p ∧ (∼ q∨ ∼ r) De Morgan’s Law

QED

2 Question 2.
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (r → q)∧ ∼ (s → p)

(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (r → q)∧ ∼ (s → p)
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (∼ r ∨ q)∧ ∼ (∼ s ∨ p) Representation of If-Then As Or
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (∼ r ∨ q) ∧ (∼∼ s∧ ∼ p) De Morgan’s Law
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (∼ r ∨ q) ∧ (s∧ ∼ p) Double Negative
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (∼ p ∧ (∼ r ∨ q)) ∧ s Associative and Commutative Law
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ ((∼ p ∧ ∼ r) ∨ (∼ p ∧ q)) ∧ s Distributive Law
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ ((∼ p ∧ ∼ r)∨ ∼ (p ∨ ∼ q)) ∧ s De Morgan’s Law
(∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s ≡ (∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s Commutative Law

QED

3 Question 3.
3.1 a
∀a ∈ {x ∈ Z | ∃y ∈ Z : x = 2y} ∃b ∈ Z : a = 20b

1
The statement is false. This can be proved by a simple counter example. Consider a = 4. a is a
member of {x ∈ Z | ∃y ∈ Z : x = 2y} as for x = 4, ∃y = 2 ∈ Z. However, 4 is not divisible by 20,
as there exists no element b in Z satisfying 4 = 20b. Hence the above statement does not hold for all
even a.

3.2 b
∀x ∈ R ∃ y ∈ Q : x > y
For some value of x ∈ R, randomly pick a rational number y ∈ Q. If y < x, the condition is
automatically met. If not, add −1 ∈ Q to y. By the closure of addition of the rationals, (y + (−1)) ∈ Q.
By the definition of addition of the rationals, (y + (−1)) < y. Set this to be the new y. Then check if
y < x. If not repeat the addition of −1 ∈ Q till the condition is met. By the closure of addition in Q
this process can be applied till the statement is true. Hence as the statement is existential it is true.

4 Question 4.
4.1 a
∃x ∈ R : ∀y ∈ R, x2 + y 2 ̸= 2023
The relation
√ x2 + y 2 = 2023 can be geometrically interpreted as a circle 2
√ in R centered at (0,
√ 0) with
radius 2023 units. The predicate is satisfied for x ∈ {{x ∈ R|x > 2023} ∪ {x ∈ R|x < − 2023}}.
Hence as the statement is existential it is true.

4.2 b
∃x, y ∈ R+ : ∀z ∈ Z+ , xy ≥ z
The above statement is false. This can be proved by proving that its negation is true. The negation
of the above reads that:

∀x, y ∈ R+ : ∃z ∈ Z+ , xy < z
In a manner identical to the proof of 3b. the above statement can be proved true. For some values
x ∈ R and y ∈ R, where xy ∈ R by the closure of multiplication in R, randomly pick a rational number
z ∈ Z. If xy < z, the condition is automatically met. If not, add 1 ∈ Z to z. By the closure of addition
of the integers, (z + 1) ∈ Z. By the definition of addition of the integers, (z + 1) > z. Set this to be
the new z. Then check if xy < z. If not repeat the addition of 1 ∈ Z till the condition is met. By the
closure of addition in Z this process can be applied till the statement is true. Hence as the statement
is existential it is true.

5 Question 5.
P (x) : x2 + 2x − 15 = 0
Q(x) : x is odd
R(x) : x > 0
S(x) : x2 − 2 = 0
5.1 a
Truth set of P (x): {−3, 5}

Truth set of Q(x): {x ∈ Z | ̸ ∃ y ∈ Z : x = 2y}

Truth set of R(x): {x ∈ Z | x > 0}

Truth set of S(x): ∅

5.2 b
5.2.1 i
∀x ∈ Z P (x) → Q(x)
The truth set of P (x) contains two odd numbers and Q(x) is only true when x is an odd number.
Therefore, as the truth set of P (x) is a subset of Q(x), P → Q is true.

5.2.2 ii
∀x ∈ Z (P (x) ∨ Q(x)) → R(x)
The truth set of P (x) is {−3, 5}. As -3 does not imply R(x), it would act as a counter example.
Moreover, truth set of Q(x) contains all odd negative integers, all of which would act as counter-
examples. Hence, the truth set of P (x) ∨ Q(x) would also contain all previously described counter-
examples. Therefore, the statement is false.

5.2.3 iii
∃x ∈ Z P (x) → (Q(x) ∧ R(x))
The above statement demands the existence of x such that if x ∈ {−3, 5}, then x is odd and positive.
Clearly x = 5 satisfies this condition. Hence as the statement is existential it is true.

5.2.4 iv
∃x ∈ Z ∼ R(x) → P (x)
The above statement demands the existence of x such that if x is less than 0, then x ∈ −3, 5. Clearly
x = −3 satisfies this condition. Hence as the statement is existential it is true.

5.2.5 v
∀x ∈ Z S(x) → (Q(x) ∧ S(x))
Truth set of S(x) is the ∅. Hence, the S(x) is a contradiction. By the universal bound law, (Q(x)∧S(x))
is also a contradiction. By definition, c → c is true. Hence above statement is true.
5.3 c
5.3.1 i
∃y ∈ Z | ∀x ∈ Z Q(x) → Q(x + y)
The above statement is true for y ∈ {a ∈ Z | ∃b ∈ Z : a = 2b}

5.3.2 ii
∃y ∈ Z | ∀x ∈ Z Q(x) → R(xy)
The truth set of Q(x) contains positive and negative integers. Negative integers require y = −1 to fulfil
R(xy). However, this would negate the positive integers and R(xy) would not hold. For y = 1, R(xy)
would hold ∀ positive x, but not for negative x. Hence, such y doesn’t exist, and above statement is
false