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 |
- (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.
- (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 points each; total = 12 points)
p. 47: 10 a–d
- This problem asks you to translate from English into
the language of FOL.
- (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 must give your reasons for each answer!
You may find it helpful to translate the propositions
into "mathematical English".
- (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
Tentative grading scheme:
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 |
Text copyright © 2010 by William J. Rapaport
(rapaport@buffalo.edu)
Cartoon links and screen-captures appear here for your enjoyment.
They are not meant to infringe on any copyrights held by the creators.
For more information on any cartoon, click on it, or contact me.
http://www.cse.buffalo.edu/~rapaport/191/F10/hw03.html-20100913-2