Scribd
Upload
209 views

Worksheet: Logical Statements

This document is a worksheet for a math class that provides practice problems involving logical statements and expressions. It contains 6 sections with multiple parts each that involve translating between logical notation and English phrases, negating logical statements, interpreting complex logical expressions, and working with epsilon-delta definitions of limits. Additional resources for further practice are provided.

Uploaded by

Shela Ramos
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
209 views

Worksheet: Logical Statements

This document is a worksheet for a math class that provides practice problems involving logical statements and expressions. It contains 6 sections with multiple parts each that involve translating between logical notation and English phrases, negating logical statements, interpreting complex logical expressions, and working with epsilon-delta definitions of limits. Additional resources for further practice are provided.

Uploaded by

Shela Ramos
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

Math 347 Worksheet: Logical statements A.J.

Hildebrand

Worksheet: Logical statements


About this worksheet
The problems in this set are intended to hone your skills in working with logical statements, translating
English phrases into logical notation and vice versa, negating logical statements using the rules of negation,
and interpreting complex logical statements.
Before you start: Be sure to study the Logic handout, and in particular familiarize yourself with the
various English phrases expressing logical statements. Also, read pp. 27–34 of the text, which has a number
of examples illustrating the use of logical statements, and also offers some excellent general advice.

1. Implications: Express each of the following statements as a logical implication (e.g., A ⇐ (¬B)) or
equivalence (e.g., A ⇔ B). Also state its negation in English (in a form like “A is true, but B is false”).

(a) If A holds, then B holds.


(b) A is true only if B is true.
(c) A is true whenever B is true.
(d) A is false only if B is false.
(e) A is a necessary condition for B.
(f) A is necessary and sufficient for B.
(g) A holds if and only if B holds.

2. Negations of English sentences. Negate the following statements. Express the negations in English,
avoiding the use of words of negation when possible.

(a) All classroom have at least one chair that is broken.


(b) No classroom has only chairs that are not broken.
(c) Every student in this class has taken Math 231 or Math 241.
(d) Every student in this class has taken Math 231 and Math 241.
(e) In every section of Math 347 there is a student who has taken neither Math 231 nor Math 241.

3. Negations of mathematical statements, I. Translate the following sentences into logical notation,
negate the statement using logical rules, then translate the negated statement back into English,
avoiding the use of words of negation when possible. (Below f is a function from R to R, and x0 a
given real number.)
A bit harder, but very instructive: Many of the statements define familiar properties of functions (e.g.,
boundedness, monotonicity, etc.), or negations of such properties. Try to uncover these definitions and
express in simple language the functions that are described by the statements.

(a) f (x, y) 6= 0 whenever x 6= 0 and y 6= 0.


(b) For all M ∈ R there exists x ∈ R such that |f (x)| ≥ M .
(c) For all M ∈ R there exists x ∈ R such that for all y > x we have f (y) > M .
(d) For all x ∈ R there exists y ∈ R such that f (y) > f (x).
(e) For every  > 0 there exists x0 ∈ R such that |f (x)| <  for all x > x0 .
(f) For every  > 0 there exists δ > 0 such that |f (x) − f (x0 )| <  whenever |x − x0 | < δ.

4. Negations of mathematical statements, II. This problem requires the formal definitions of a
bounded set or function, and increasing, decreasing, nonincreasing, nondecreasing functions. These
definitions can be found in Chapter 1 of the text and are collected below. (Here S is any set of real
numbers, and f denotes a function from R to R.)

1
Math 347 Worksheet: Logical statements A.J. Hildebrand

• S is bounded if there exists M such that |x| ≤ M for all x ∈ S.


• f is bounded if there exists M such that |f (x)| ≤ M for all x ∈ R.
• f is increasing (or strictly increasing) if f (x) < f (y) whenever x < y.
• f is nondecreasing (or weakly increasing) if f (x) ≤ f (y) whenever x < y.
• f is decreasing (or strictly decreasing) if f (x) > f (y) whenever x < y.
• f is nonincreasing (or weakly decreasing) if f (x) ≥ f (y) whenever x < y.

(a) Express the statement “f is not bounded ” without using words of negation.
(b) Express the statement “f is not increasing” (i.e., the negation of the “increasing” property)
without using words of negation.
(c) Compare the definitions of “nonincreasing” and “not increasing” (the latter being the negation of
“increasing”). Does one imply the other? Are there functions that satisfy one property, but not
the other?

5. Practice with epsilon-delta definitions. Here is the epsilon-delta definition of


“limx→0 f (x) = 0”:

(*) “For every  > 0 there exists δ > 0 such that |f (x)| <  whenever |x| < δ.”

The following statements are small perturbations of this definitions, some of which are equivalent to
the original definition, while others are “botched” versions of this definition that have a drastically
different meaning.
Which versions are equivalent to the above limit definition, and which are not?
Harder, but very instructive: For those definitions that are not equivalent to limx→0 f (x) = 0, try to
determine, in as simple a language as possible, what they really define. Find examples (if they exist)
of functions that satisfy the definition, and of functions that don’t satisfy it. (Cf. Exercises 2.25–2.27
in the text for similar problems. In some cases this can be quite some quite tricky!)

(a) For every  > 0 there exists δ > 0 such that for all x ∈ R, |x| < δ implies |f (x)| < .
(b) For every δ > 0 there exists  > 0 such that for all x ∈ R, |x| < δ implies |f (x)| < .
(c) There exists δ > 0 such that for every  > 0 and for all x ∈ R, |x| < δ implies |f (x)| < .
(d) For every  > 0 and for all x ∈ R there exists δ > 0 such that |x| < δ implies |f (x)| < .

6. Additional resources.
This material is covered at the beginning of Chapter 2, on pp. 27–34 of the text; be sure to read this
section, study the examples and the general remarks and comments given there. Additional practice
problems can be found in Homework 2; particularly instructive are Problems 2.10, 2.23, and 2.24 from
HW 2.

You might also like