Scribd
Upload
35 views

HW2 Cse

This document contains the homework assignment for a discrete structures course. It includes 8 multiple choice questions about logic, predicates, quantifiers and rules of inference. Students are asked to determine the truth values of logical statements, translate English statements into logical notation, and identify the rules of inference used in arguments. The homework is due on May 7th and students must submit handwritten answers.

Uploaded by

Maram Abdullah
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

HW2 Cse

This document contains the homework assignment for a discrete structures course. It includes 8 multiple choice questions about logic, predicates, quantifiers and rules of inference. Students are asked to determine the truth values of logical statements, translate English statements into logical notation, and identify the rules of inference used in arguments. The homework is due on May 7th and students must submit handwritten answers.

Uploaded by

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

Discrete Structures (CSE 253)

Homework 2
Due Date: 7-May-2023

Note: Solve all the questions and submit hand-written answers.

1. Let P(x) be the statement “x + 1 > x”. What is the truth value of the quantification ∀xP(x) and
∃xP(x) where the domain consists of all integer numbers?

Because P (x) is true for all real numbers x, the quantification ∀xP (x)is true.

2. Let Q(x) be the statement “x < 2”. What is the truth value of the quantification ∀xQ(x) and ∃xP(x),
where the domain consists of all integer numbers?
Q(x) is not true for every real number x, because, for instance, Q(3) is false. That is, x = 3 is a
counterexample for the statement ∀xQ(x). Thus ∀xQ(x) is false.

3. Suppose that P(x) is “x2 > 0.” What is the truth value of the quantification ∀xQ(x), where the
universe of discourse consists of all integers, give a counter example if False.
Let x = 0, the statement becomes "02 > 0" which simplifies to "0 > 0". This is false, as 0 is not
greater than 0.
therefore, the truth value of ∀xP(x) is false, and the counterexample is x = 0.

4. Let Q(x) denote the statement “x = x + 1.” What is the truth value of the quantification ∃xQ(x),
where the domain consists of all real numbers?
“x = x + 1”, this statement is not true for any real number, as adding 1 to any real number will
always result in a larger number, making x and (x + 1) distinct. Therefore, the truth value of
∃xQ(x) is false, as there is no real number that can satisfy the given statement.

5. Express the statements (1) “Every student in this class has studied calculus” (2) “Some student in
this class has studied calculus” (3) “Every student in this class has studied either calculus or English
Language” using predicates quantifiers and logical connectives. Given that:
a) The domain for x consists of the students in the class
b) The domain to consist of all people
Let S(x) represent "x is a student in this class."
Let C(x) represent "x has studied calculus."
Let E(x) represent "x has studied English Language."
(1) “Every student in this class has studied calculus”
For the domain of x consisting of students in the class:
∀x(C(x))
For the domain of x consisting of all people:
∀x(S(x) → C(x))
(2) “Some student in this class has studied calculus”
For the domain of x consisting of students in the class:
∃x(C(x))
For the domain of x consisting of all people:
∃x(S(x) ∧ C(x))
(3) “Every student in this class has studied either calculus or English Language”
For the domain of x consisting of students in the class:
∀x(C(x) ∨ E(x))
For the domain of x consisting of all people:
∀x(S(x) → (C(x) ∨ E(x)))

6. Express the statement “If a person is female and is a parent, then this person is someone’s
mother” as a logical expression involving predicates, quantifiers and logical connectives with a
domain consisting of all people.
Let F(x): x is female
Let P(x): x is a parent
Let M(x, y): x is the mother of y
∀x((F (x) ∧ P (x)) → ∃yM(x, y))

7. What are the negations of the statements ∀x(x2 > x) and ∃x(x2 = 2)?
The negation of ∀x(x2 > x) is the statement ¬∀x(x2 > x), which is equivalent to ∃x¬(x2 > x).
This can be rewritten as ∃x(x2 ≤ x).

The negation of ∃x(x2 = 2)is the statement ¬∃x(x2 = 2), which is equivalent to ∀x¬(x2 = 2). This
can be rewritten as ∀x(x2 ≠2).

8. Choose the correct answers of the following statements.


What rules of inference are used in this famous argument? “All men are mortal. Socrates
is a man. Therefore, Socrates is mortal.”
A. Universal instantiation and modus ponens
B. Existential generalization
C. Universal instantiation and addition
D. Existential instantiation and modus ponens

Let P(x) be "x is perfect" and F(x) be "x is your friend"; Translate the following
statement into logical expressions using predicates, quantifiers, and logical connectives.
At least one of your friends is perfect.
A. ∀x(F(x) → P(x))
B. ∃x(F(x) → P(x))
C. ∃x(F(x) ∧ P(x))
D. ∀x(F(x) ∧ P(x)

What rule of inference is used in each of these arguments? If I go swimming, then I will
stay in the sun too long. If I stay in the sun too long, then I will sunburn. Therefore, if I
go swimming, then I will sunburn.
A. Resolution
B. Modus ponens
C. Hypothetical syllogism
D. Disjunctive syllogism

What rule of inference is used in each of these arguments? Linda is an excellent


swimmer. If Linda is an excellent swimmer, then she can work as a lifeguard. Therefore,
Linda can work as a lifeguard.
A. Modus tollens
B. Modus ponens
C. Conjunction
D. Addition

For the given arguments determine whether the argument is correct or incorrect and
explain why. Everyone who eats granola every day is healthy. Linda is not healthy.
Therefore, Linda does not eat granola every day.
A. This is not valid argument
B. This is valid by existential generalization and modus ponens
C. This is valid by universal generalization and modus ponens
D. This is valid by universal instantiation and modus tollens

Good Luck

You might also like