🚧 Setup for 3.1
This commit is contained in:
parent
66cf533803
commit
c5d5be99bf
3 changed files with 434 additions and 0 deletions
|
|
@ -0,0 +1,27 @@
|
|||
**Test Yourself**
|
||||
|
||||
Page 141
|
||||
|
||||
1. If $P(x)$ is a predicate with domain $D$, the truth set of $P(x)$ is denoted
|
||||
_______. We read these symbols out loud as _______.
|
||||
|
||||
$\{x \in D | P(x)\}$; "the set of all $x$ in $D$ such that $P(x)$."
|
||||
|
||||
2. Some ways to express the symbol $\forall$ in words are _______.
|
||||
|
||||
for every for all, for any, for each, for arbitrary, given any
|
||||
|
||||
3. Some ways to express the symbol $\exists$ in words are _______.
|
||||
|
||||
there exists, there exist, there exists at least one, for some, for at least
|
||||
one, we can find a
|
||||
|
||||
4. A statement of the form $\forall x \in D$, $Q(x)$ is true if, and only if,
|
||||
$Q(x)$ is _______ for _______.
|
||||
|
||||
true; every $x$ in $D$.
|
||||
|
||||
5. A statement of the form $\exists x \in D$ such that $Q(x)$ is true if, and
|
||||
only if, $Q(x)$ is _______ for _______.
|
||||
|
||||
true; at least one $x$ in $D$.
|
||||
Loading…
Add table
Add a link
Reference in a new issue