Logic

Submit Homework 1 | Gradescope 2/8/24, 6:04 PM
0/11 Questions Answered
https://www.gradescope.com/courses/708781/assignments/4012950/submissions/new Page 1 of 17
Homework 1
Q1 Instructions
1 Point
Grading: Homework assignments will be graded traditionally with

partial credits and you will be given individualized feedback. Excellent
solutions take many forms, but they all have the following
characteristics:
1. they use complete sentences, even when formulas or symbols are
involved;
2. they are written as explanations for other students in the course; in
particular, they fully explain all of their reasoning and do not assume
that the reader will fill in details;
3. when graphical reasoning is called for, they include large, carefully
drawn and labeled diagrams.
Academic Honesty: You may discuss the homework problems with your
classmates. Talking to others through your ideas, and suggesting
techniques or procedures for others to try is encouraged! However,
avoid showing other students your completed write-up or working on
the problem for them. Everyone must write their solutions
independently.
I know that finding solutions on the Internet is not hard. While these
might be useful tools for studying for exams, copying said solutions on a
homework assignment will result in a negative grade for that
assignment.
Save Answer
Q2 Translating English Sentence using connectives

1 Point
Let 𝑝 and 𝑞 be the propositions
𝑝: You drive over 65 miles per hour.
𝑞: You get a speeding ticket.
Write these propositions using 𝑝 and 𝑞 and logical connectives

(including negations).
a) You do not drive over 65 miles per hour.
b) You drive over 65 miles per hour, but you do not get a speeding
ticket.
c) You will get a speeding ticket if you drive over 65 miles per hour.
d) If you do not drive over 65 miles per hour, then you will not get a
speeding ticket.
e) Driving over 65 miles per hour is sufficient for getting a speeding

ticket.
f) You get a speeding ticket, but you do not drive over 65 miles per
hour.
g) Whenever you get a speeding ticket, you are driving over 65 miles
per hour.
Solution:
a) You do not drive over 65 miles per hour.
This statement is the negation of the proposition "You drive over 65

miles per hour." That is,
( ¬𝑝 )
b) You drive over 65 miles per hour, but you do not get a speeding
ticket.
¬𝑞: You do not get a speeding ticket.
Using connectives, we have
( 𝑝 ∧ ¬𝑞 )
c) You will get a speeding ticket if you drive over 65 miles per hour.
→: then
(𝑝 →𝑞)
d) If you do not drive over 65 miles per hour, then you will not get a
speeding ticket.
¬𝑝: You do not drive over 65 miles per hour.
¬𝑞: You do not get a speeding ticket.
→: then
( ¬𝑝 → ¬ 𝑞 )
e) Driving over 65 miles per hour is sufficient for getting a speeding
ticket.
→: is sufficient
(𝑝 →𝑞)
f) You get a speeding ticket, but you do not drive over 65 miles per
hour.
¬𝑝: You do not drive over 65 miles per hour.
∧: but
( 𝑞 ∧ ¬𝑝 )
g) Whenever you get a speeding ticket, you are driving over 65 miles
per hour.
→: Whenever
(𝑞 →𝑝)
Please select file(s) Select file(s)
Save Answer
Q3 Converse, Contrapositive, and Inverse

1 Point
State the converse, contrapositive, and inverse of each of these

conditional statements.
a) If it snows tonight, then I will stay at home.
b) I go to the beach whenever it is a sunny summer day.
c) When I stay up late, it is necessary that I sleep until noon.
Solution:
If we have the conditional statement: If P then Q.
Then,
The converse is: If Q then P.
The contrapositive is: If not Q then not P.
The inverse is: If not P then not Q.
a) If it snows tonight, then I will stay at home.

Here,
𝑝: It snows tonight.
𝑞: I stay at home.
Then,
Converse: If I stay at home, then it is snowing tonight.
Contrapositive: If I don't stay at home, then it is not snowing
tonight.
Inverse: If it does not snow tonight, then I will not stay at home.
b) I go to the beach whenever it is a sunny summer day.

“I go to the beach whenever it is a sunny summer day” is
equivalent to
“If it is a sunny summer day, then I go to the beach.”
Here,
𝑝: It is a sunny summer day.
𝑞: I go to the beach.
Then,
Converse: If I go to the beach, then it is a sunny summer day.
Contrapositive: If I don't go to the beach, then it is not a sunny
summer day.
Inverse: If it is not a sunny summer day, then I don't go to the
beach.
c) When I stay up late, it is necessary that I sleep until noon.
“When I stay up late, it is necessary that I sleep until noon”

Is equivalent to
“If I stay up late, then it is necessary that I sleep until noon”.
Here,
𝑝: I stay up late.
𝑞: I go to the beach.
Then,
Converse: If I sleep until noon, then I stayed up late.
Contrapositive: If I don't sleep until noon, then I did not stay up
late.
Inverse: If I do not stay up late, then it is not necessary for me to
sleep until noon.
Save Answer
Q4 Construct a truth table

1 Point
Construct a truth table for each of these compound propositions.
(𝑝 → 𝑞) ∧ (¬𝑝 → 𝑟)
Solution:
𝒑 𝒒 𝒓 𝒑→𝒒 ¬𝒑 ¬𝒑 → 𝒓 (𝒑 → 𝒒) ∧ (¬𝒑 → 𝒓)
T T T T F T T
T T F T F T T
T F T F F T F
T F F F F T F
F T T T T T T
F T F T T F F
F F T T T T T
F F F T T F F
Save Answer
Q5 De Morgan’s laws to find the negation

1 Point
Use De Morgan’s laws to find the negation of each of the following

statements.
a) Kwame will take a job in industry or go to graduate school.
b) James is young and strong.
Solution:
Save Answer
De Morgan's laws are as follows:
1. Negation of a Conjunction (AND):

¬ (𝑝 ∧ 𝑞 ) ≡ (¬ 𝑝 ∨ ¬ 𝑞 )
2. Negation of a Disjunction (OR):

¬ (𝑝 ∨ 𝑞 ) ≡ (¬ 𝑝 ∧ ¬ 𝑞 )
Now let's apply these laws,
a) Kwame will take a job in industry or go to graduate school.

Let
𝑝: Kwame will take a job in industry.
𝑞: Kwame will go to graduate school.
The statement can be represented as
(𝑝 ∨ 𝑞)
The negation of (𝑝 ∨ 𝑞) using De Morgan's law for
disjunctions is:
¬ (𝑝 ∨ 𝑞 ) ≡ (¬ 𝑝 ∧ ¬ 𝑞 )
So, the negation is: “Kwame will not take a job in industry and
will not go to graduate school”.
b) James is young and strong.

Let
𝑝: James is young.
𝑞: James is strong.
The statement can be represented as (𝑝 ∧ 𝑞).
The negation of (𝑝 ∧ 𝑞) using De Morgan's law for
conjunctions is:
¬ (𝑝 ∧ 𝑞 ) ≡ (¬ 𝑝 ∨ ¬ 𝑞 )
So, the negation is: “James is not young or James is not
strong”.
Q6 Tautology
1 Point
Show that each of these conditional statements is a tautology by using

truth tables.
a) (𝑝 ∧ 𝑞) → 𝑝
b) 𝑝 → (𝑝 ∨ 𝑞)
Save Answer
Solution:
a)
𝒑 𝒒 𝒑∧𝒒 (𝒑 ∧ 𝒒) → 𝒑
T T T T
T F F T
F T F T
F F F T
Thus 𝒑 ∧ 𝒒) → 𝒑 is a tautology.
b)
𝒑 𝒒 𝒑∨𝒒 𝒑 → (𝒑 ∨ 𝒒)
T T T T
T F T T
F T T T
F F F T
Thus 𝒑 → (𝒑 ∨ 𝒒) is a tautology.
Q7 Logically equivalence
1 Point
By using Equivalence Laws (not the truth table), show that
(𝑝 → 𝑞 ) ∨ (𝑝 → 𝑟 ) ≡ 𝑝 → (𝑞 ∨ 𝑟 ).
Save Answer
Solution:
We start from (𝑝 → 𝑞) ∨ (𝑝 → 𝑟). Since
𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
and
𝑝 → 𝑟 ≡ ¬𝑝 ∨ 𝑟,
then
(𝑝 → 𝑞) ∨ (𝑝 → 𝑟) = (¬𝑝 ∨ 𝑞) ∨ (¬𝑝 ∨ 𝑟)
= (¬𝑝 ∨ ¬𝑝) ∨ (𝑞 ∨ 𝑟)
= ¬𝑝 ∨ (𝑞 ∨ 𝑟)
= 𝑝 → (𝑞 ∨ 𝑟 )
Therefore, (𝑝 → 𝑞) ∨ (𝑝 → 𝑟) ≡ 𝑝 → (𝑞 ∨ 𝑟).
Q8 Deduction Rule
1 Point
Determine if the following
(P∧Q) →R
¬P∨¬Q
∴ ¬R
is a valid deduction rule.
Save Answer
Solution:
We use a truth table

𝑷 𝑸 𝑹 (𝑷 ∧ 𝑸) → 𝑹 (¬𝑷 ∨ ¬𝑸) ¬𝑹 (𝑷 ∧ 𝑸) → 𝑹 ∧ (¬𝑷 ∨ ¬𝑸)
F F F T T T T
F F T T T F T
F T F T T T T
F T T T T F T
T F F F T T F
T F T T T F T
T T F F T T F
T T T T F F F
We see that (𝑷 ∧ 𝑸) → 𝑹 ∧ (¬𝑷 ∨ ¬𝑸) is not equivalent to ¬𝑹.
Thus, the statement is a not valid deduction.
Q9 Quantifiers
1 Point
As mentioned in the text, the notation ∃! 𝑥𝑃(𝑥) denotes
"There exists a unique 𝑥 such that 𝑃(𝑥) is true."
If the domain consists of all integers, what are the truth values of
these statements?
a) ∃! 𝑥(𝑥 > 1)
b) ∃! 𝑥(𝑥 2 = 1)
c) ∃! 𝑥(𝑥 + 3 = 2𝑥)
d) ∃! 𝑥(𝑥 = 𝑥 + 1)
Save Answer
Solution:
a) ∃! 𝑥 (𝑥 > 1)
This statement is FALSE because 2, 3, 4 … are greater than 1
b) ∃! 𝑥(𝑥 2 = 1)
This statement is FALSE because 1 and -1 fulfills the statement.
c) ∃! 𝑥(𝑥 + 3 = 2𝑥)
The statement is TRUE because 𝑥 = 3 is the unique solution of

the equation.
d) ∃! 𝑥 (𝑥 = 𝑥 + 1)
This statement is FALSE because there is not exists a 𝑥 such

𝑥 = 𝑥 + 1
that is equivalent to
0=1
It is absurd.
Q10 Nested Quantifiers

1 Point
Determine the truth value of each of these statements if the domain

of each variable consists of all real numbers.
a) ∀𝑥∃𝑦(𝑥 2 = 𝑦)
b) ∀𝑥∃𝑦(𝑥 = 𝑦 2 )
c) ∃𝑥∀𝑦(𝑥𝑦 = 0)
d) ∃𝑥∃𝑦(𝑥 + 𝑦 = 𝑦 + 𝑥)
e) ∀𝑥(𝑥 = 0 → ∃𝑦(𝑥𝑦 = 1))

Save Answer
Solution:
a) ∀𝑥∃𝑦(𝑥 2 = 𝑦)
This statement is true. For every real number 𝑥 , you can find a real
number 𝑦 such that 𝑥 2 = 𝑦 .
For example, 𝑥 = 2 and 𝑦 = 4 .
b) ∀𝑥 ∃𝑦(𝑥 = 𝑦 2 )
This statement is false. For some real numbers, there is no real

number 𝑦 such that 𝑥 = 𝑦 2 holds true.
For example, when 𝑥 = −1 , there is no real number 𝑦 such that
−1 = 𝑦 2 .
c) ∃𝑥 ∀𝑦(𝑥𝑦 = 0)
This statement is true. There exists a real number 𝑥 = 0 such that

for all real numbers 𝑦, the product 𝑥𝑦 = 0.
d) ∃𝑥 ∃𝑦(𝑥 + 𝑦 ≠ 𝑦 + 𝑥)
This statement is false because 𝑥 + 𝑦 and 𝑦 + 𝑥 are the same real

number (commutative property).
e) ∀𝑥 (𝑥 ≠ 0 → ∃𝑦(𝑥𝑦 = 1))
1
This statement is true because for all 𝑥 ≠ 0, there exist 𝑦 = such
𝑥
that
1
𝑥⋅ 𝑦 = 𝑥⋅ =1
𝑥
Q11 Negation of Quantifiers

1 Point
Rewrite each of these statements so that negations appear only within

predicates (that is so that no negation is outside a quantifier or an
expression involving logical connectives).
a) ¬(∀𝑥∀𝑦𝑃(𝑥, 𝑦))
b) ¬(∀𝑦∃𝑥𝑃 (𝑥, 𝑦))
c) ¬(∀𝑦∀𝑥(𝑃(𝑥, 𝑦) ∨ 𝑄(𝑥, 𝑦)))
Solution:
We know that
¬(∀𝑥) = ∃𝑥
¬(∃𝑥) = ∀𝑥
Then,
a) ¬(∀𝑥 ∀𝑦 𝑃(𝑥, 𝑦))
Can be rewritten as ∃𝑥 ∃𝑦 ¬ 𝑃(𝑥, 𝑦)
b) ¬ (∀ 𝑦 ∃ 𝑥 𝑃(𝑥, 𝑦))
Can be rewritten as ∃𝑦 ∀𝑥 ¬ 𝑃(𝑥, 𝑦) \)
c) ¬ (∀ 𝑦 ∀ 𝑥 (𝑃(𝑥, 𝑦) ∨ 𝑄(𝑥, 𝑦)))
By Morgan law
¬(𝑃(𝑥, 𝑦) ∨ 𝑄 (𝑥, 𝑦)) ≡ ¬𝑃(𝑥, 𝑦) ∧ ¬𝑄 (𝑥, 𝑦)
Then,
The statement can be rewritten as

∃ 𝑦 ∃ 𝑥 ¬ (𝑃(𝑥, 𝑦) ∨ 𝑄 (𝑥, 𝑦))
or
∃ 𝑦 ∃ 𝑥 (¬𝑃(𝑥, 𝑦) ∧ ¬𝑄(𝑥, 𝑦)).

Logic

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Logic

Uploaded by

Copyright:

Available Formats

Submit Homework 1 | Gradescope 2/8/24, 6:04 PM

0/11 Questions Answered

Grading: Homework assignments will be graded traditionally with

Q2 Translating English Sentence using connectives

Let 𝑝 and 𝑞 be the propositions

𝑝: You drive over 65 miles per hour.

𝑞: You get a speeding ticket.

Write these propositions using 𝑝 and 𝑞 and logical connectives

a) You do not drive over 65 miles per hour.

e) Driving over 65 miles per hour is sufficient for getting a speeding

a) You do not drive over 65 miles per hour.

This statement is the negation of the proposition "You drive over 65

Please select file(s) Select file(s)

Q3 Converse, Contrapositive, and Inverse

State the converse, contrapositive, and inverse of each of these

a) If it snows tonight, then I will stay at home.

b) I go to the beach whenever it is a sunny summer day.

c) When I stay up late, it is necessary that I sleep until noon.

If we have the conditional statement: If P then Q.

The converse is: If Q then P.

The contrapositive is: If not Q then not P.

The inverse is: If not P then not Q.

a) If it snows tonight, then I will stay at home.

b) I go to the beach whenever it is a sunny summer day.

c) When I stay up late, it is necessary that I sleep until noon.

“When I stay up late, it is necessary that I sleep until noon”

Please select file(s) Select file(s)

Q4 Construct a truth table

Construct a truth table for each of these compound propositions.

Please select file(s) Select file(s)

Q5 De Morgan’s laws to find the negation

Use De Morgan’s laws to find the negation of each of the following

a) Kwame will take a job in industry or go to graduate school.

b) James is young and strong.

Please select file(s) Select file(s)

De Morgan's laws are as follows:

1. Negation of a Conjunction (AND):

2. Negation of a Disjunction (OR):

Now let's apply these laws,

a) Kwame will take a job in industry or go to graduate school.

b) James is young and strong.

Show that each of these conditional statements is a tautology by using

By using Equivalence Laws (not the truth table), show that

Please select file(s) Select file(s)

We start from (𝑝 → 𝑞) ∨ (𝑝 → 𝑟). Since

Determine if the following

is a valid deduction rule.

Please select file(s) Select file(s)

We use a truth table

As mentioned in the text, the notation ∃! 𝑥𝑃(𝑥) denotes

"There exists a unique 𝑥 such that 𝑃(𝑥) is true."

Please select file(s) Select file(s)

This statement is FALSE because 2, 3, 4 … are greater than 1

This statement is FALSE because 1 and -1 fulfills the statement.

The statement is TRUE because 𝑥 = 3 is the unique solution of

This statement is FALSE because there is not exists a 𝑥 such

Q10 Nested Quantifiers

Determine the truth value of each of these statements if the domain

e) ∀𝑥(𝑥 = 0 → ∃𝑦(𝑥𝑦 = 1))

This statement is false. For some real numbers, there is no real

This statement is true. There exists a real number 𝑥 = 0 such that

This statement is false because 𝑥 + 𝑦 and 𝑦 + 𝑥 are the same real