Chapter 5: Problem 3
Which of the following sets are equal?
$$
\begin{aligned}
&A=\\{0,1,2\\} \\
&B=\\{x \in \mathbf{R} \mid-1 \leq x<3\\} \\
&C=\\{x \in \mathbf{R} \mid-1
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 5: Problem 3
Which of the following sets are equal?
$$
\begin{aligned}
&A=\\{0,1,2\\} \\
&B=\\{x \in \mathbf{R} \mid-1 \leq x<3\\} \\
&C=\\{x \in \mathbf{R} \mid-1
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A=\\{c, d, f, g\\}, B=\\{f, j\\}\), and \(C=\\{d, g\\}\). Answer each of the following questions. Give reasons for your answers. a. Is \(B \subseteq A\) ? b. Is \(C \subseteq A\) ? c. Is \(C \subseteq C ?\) d. Is \(C\) a proper subset of \(A\) ?
Prove each statement that is true and find a counterexample for each statement that is false. Assume all sets are subsets of a universal set \(U\). For all sets \(A\) and \(B, \mathscr{P}(A \cup B) \subseteq \mathscr{P}(A) \cup \mathscr{P}(B)\).
The following two sentences were devised by the logician Saul Kripke. While not intrinsically paradoxical, they could be paradoxical under certain circumstances. Describe such circumstances. (i) Most of Nixon's assertions about Watergate are false. (ii) Everything Jones says about Watergate is true. (Hint: Suppose Nixon says (ii) and the only utterance Jones makes about Watergate is (i).)
As strange as it may seem, it is possible to give a preciselooking verbal definition of an integer that, in fact, is not a definition at all. The following was devised by an English librarian, G. G. Berry, and reported by Bertrand Russell. Explain how it leads to a contradiction. Let \(n\) be "the smallest integer not describable in fewer than 12 English words." (Note that the total number of strings consisting of 11 or fewer English words is finite.)
For all sets \(A\) and \(B\), $$ (A-B) \cup(B-A)=(A \cup B)-(A \cap B) $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.