Scribd
Upload
101 views2 pages

Tutorial 04

This document contains a tutorial on quantifiers and predicate logic with 11 problems: 1) Express statements using quantifiers and negate them. 2) Find counterexamples to universally quantified statements. 3) Express statements using predicates and quantifiers. 4) Translate specifications using predicates into English. 5) Determine if two quantified statements are logically equivalent. 6) Show two existential statements are not equivalent. 7) Determine the truth values of statements with uniqueness quantifiers. 8) Identify rules of inference used in arguments. 9) Determine if an argument is valid and its conclusion is true. 10) Show an argument with inconsistent premises is valid but the conclusion is not necessarily true

Uploaded by

Jay Thakkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views2 pages

Tutorial 04

This document contains a tutorial on quantifiers and predicate logic with 11 problems: 1) Express statements using quantifiers and negate them. 2) Find counterexamples to universally quantified statements. 3) Express statements using predicates and quantifiers. 4) Translate specifications using predicates into English. 5) Determine if two quantified statements are logically equivalent. 6) Show two existential statements are not equivalent. 7) Determine the truth values of statements with uniqueness quantifiers. 8) Identify rules of inference used in arguments. 9) Determine if an argument is valid and its conclusion is true. 10) Show an argument with inconsistent premises is valid but the conclusion is not necessarily true

Uploaded by

Jay Thakkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial 4

1. Express each of these statements using quantifiers. Then form the negation of the state-
ment, so that no negation is to the left of a quantifier. Next, express the negation in
simple English. (Do not simply use the phrase “It is not the case that.”)

a) Some old dogs can learn new tricks.


b) No rabbit knows calculus.
c) Every bird can fly.
d) There is no dog that can talk.
e) There is no one in this class who knows French and Russian.

2. Find a counterexample, if possible, to these universally quantified statements, where the


domain for all variables consists of all integers.

a) ∀x(x2 ≥ x)
b) ∀x(x > 0 ∨ x < 0)
c) ∀x(x = 1)

3. Express each of these statements using predicates and quantifiers.

a) A passenger on an airline qualifies as an elite flyer if the passenger flies more than
25, 000 miles in a year or takes more than 25 flights during that year.
b) A man qualifies for the marathon if his best previous time is less than 3 hours and
a woman qualifies for the marathon if her best previous time is less than 3.5 hours.

4. Translate these specifications into English where F (p) is “Printer p is out of service,” B(p)
is “Printer p is busy,” L(j) is “Print job j is lost,” and Q(j) is “Print job j is queued.”

a) ∃p (F (p) ∧ B(p)) → ∃j L(j)


b) ∀p B(p) → ∃j Q(j)
c) ∃j (Q(j) ∧ L(j)) → ∃p F (p)
d) (∀p B(p) ∧ ∀j Q(j)) → ∃j L(j)

5. Determine whether ∀x (P (x) → Q(x)) and ∀x P (x) → ∀x Q(x) are logically equivalent.
Justify your answer.

6. Show that ∃x P (x) ∧ ∃x Q(x) and ∃x (P (x) ∧ Q(x)) are not logically equivalent.

1
7. What are the truth values of these statements?

a) ∃!x P (x) → ∃x P (x)


b) ∀x P (x) → ∃!x P (x)
c) ∃!x ¬P (x) → ¬∀x P (x)

8. What rule of inference is used in each of these arguments?

a) Alice is a mathematics major. Therefore, Alice is either a mathematics major or a


computer science major.
b) Jerry is a mathematics major and a computer science major. Therefore, Jerry is a
mathematics major.
c) If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool is closed.
d) If it snows today, the university will close. The university is not closed today.
Therefore, it did not snow today.
e) 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.

9. Determine whether the argument given here is valid and determine whether its conclusion
must be true because of the validity of the argument.

√ √ √
“If 2 > 23 then ( 2)2 > ( 32 )2 . We know that 2 > 32 . Consequently,
√
( 2)2 = 2 > ( 23 )2 = 94 .”

10. Show that the argument with premises “The tooth fairy is a real person” and “The tooth
fairy is not a real person” and conclusion “You can find gold at the end of the rainbow”
is a valid argument. Does this show that the conclusion is true?

11. Show that the hypotheses (p ∧ q) ∨ r and r → s imply the conclusion p ∨ s.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy