Problem Set 4 >> Introduction to Mathematical Thinking
*Please Wait 15 Seconds To Get The Pdf Loaded
*Please Copy The Password & Submit Here. After That You Can Get Access To Questions Answer
* Please Disable Internet Download Manager (IDM) To View This Pdf.
Z!GGOtProblem Set 4
Which of the following is equivalent to \neg \forall x[P(x) \Rightarrow (Q(x) \vee R(x))]? (Only one is.) [5 points]
\exists x[P(x) \vee \neg Q(x) \vee \neg R(x)]
\exists x[\neg P(x) \wedge Q(x) \wedge R(x)]
\exists x[P(x) \wedge \neg Q(x) \wedge \neg R(x)]
\exists x[P(x) \wedge (\neg Q(x) \vee \neg R(x))]
\exists x[P(x) \vee (\neg Q(x) \wedge \neg R(x))]
Let p,q be variables denoting tennis players, let t be a variable denoting games of tennis, and let W(p,q,t) mean that p plays against q in game t and wins. Which of the following claims about tennis players mean the same as the symbolic formula \forall p \exists q \exists t W(p,q,t)? Select all that have that meaning. [5 points]
Everyone wins a game.
Everyone loses a game.
For every player there is another player they beat all the time.
There is a player who loses every game.
There is a player who wins every game.
Let p,q be variables denoting the tennis players in a club, let t be a variable denoting the club’s games of tennis, and let W(p,q,t) mean that p plays against q in game t and wins. Assuming that there are at least two tennis players and games between them do take place, which (if any) of the following symbolic formula cannot possibly be true? Select all you think cannot possibly be true. [3 points]
\forall p \exists q \exists t W(p,q,t)
\forall p \forall q \exists t W(p,q,t)
\forall q \exists p \exists t W(p,q,t)
Which (one) of the following means “Everybody loves a lover”, where L(x,y) means (person) x loves (person) y and a lover is defined to be someone in a mutual loving relationship? [5 points] If English is not your native language, you might want to discuss this sentence with a native English speaker before you answer. It’s an idiomatic expression.]
\forall x \forall y [\exists z(L(x,z) \wedge L(z,x)) \Rightarrow L(y,x)]
\forall x \forall y [\forall z(L(x,z) \vee L(z,x)) \Rightarrow L(y,x)]
\forall x [\exists z(L(x,z) \wedge L(z,x)) \wedge \forall y L(y,x)]
Which of the following statements about the order relation on the real line is/are false? [4 points]
\forall x \forall y \forall z[(x \leq y) \wedge (y \leq z) \Rightarrow (x \leq z)]
\forall x \forall y [(x \leq y) \wedge (y \leq x) \Rightarrow (x = y)]
\forall x \exists y [(x \leq y) \wedge (y \leq x)]
\exists x \forall y [(y \lt x) \vee (x \lt y)]
A student produced this purported proof while trying to understand Euclid’s proof of the infinitude of the primes. Evaluate it according to the course rubric. Enter your grade (which should be a whole number between 0 and 24, inclusive) in the box. An answer within 4 points of the instructor’s grade counts as correct. [5 points]
You should read the website section “Using the rubric” and watch the associated short explanatory video before attempting this question.