Discrete Structures

# HW #3 — §1.3: Predicates & Quantifiers

 Last Update: 17 September 2010 Note: or material is highlighted

Each HW problem's solution should consist of:

All solutions must be handwritten.

 PUT YOUR NAME, DATE, & RECITATION SECTION AT TOP RIGHT OF EACH PAGE; STAPLE MULTIPLE PAGES

1. (3 points each; total = 12 points)

p. 47: 6 b–c, e–f

• This problem asks you to translate from the language of fist-order logic into English.

2. (3 points each; total = 12 points)

p. 47: 8 a–d

• This problem also asks you to translate from the language of FOL into English.

3. (3 points each; total = 12 points)

p. 47: 10 a–d

• This problem asks you to translate from English into the language of FOL.

4. (3 points each for truth values; 3 points each for reason; total = 24 points)

p. 47: 12 d–g

• This problem asks you to determine the truth values of some FOL propositions about an integer inequality.
You may find it helpful to simplify the algebraic inequality.

You may find it helpful to translate the propositions into "mathematical English".

5. (3 points each; total = 6 points)

p. 47: 18 d–e

• This problem asks you to rewrite FOL propositions so that they have no quantifiers.

Total points = 66

```A       63-66
A-      60-62
B+      56-59
B       52-55
B-      49-51
C+      45-48
C       38-44
C-      30-37
D+      23-29
D       12-22
F        0-11
```

 DUE: AT THE BEGINNING OF LECTURE, FRI., SEP. 24