| BRIEF DESCRIPTION |
Introduction to Symbolic Logic. Two logical systems
are examined:
(1) Sentential Logic
(2) Predicate Logic
Work is equally divided between:
(1) translating English sentences into symbolic notation, and
(2) constructing formal derivations.
|
| TECHNICAL REQUIREMENTS |
In
order to submit homework/exams in this course, you must:
1. have an email program with file-attachment capabilities
2.
have: Windows (98 or later)
or
MAC OSX
3.
have Microsoft Word (97 or later)
For
help on these matters, click here.
|
| TEXT |
Hardegree, Symbolic Logic: A First Course, Third
Edition.
A hard copy is available at the Amherst Books.
An on-line version of an earlier edition is available on this web
site. |
| TAKE-HOME EXAMS |
There are six take-home exams plus four "tiny" practice
exams (for extra-credit).
Exam #5 is very similar to Exam #3.
Exam #6 is very similar to Exam #4.
For dates, see Schedule. |
| DROPPING TWO LOWEST SCORES |
| In calculating your final numerical score, I drop the lowest score of the odd-numbered exams and the lowest score of the even-numbered exams. A missed exam counts as a zero. |
| USING THE OPTIONAL EXAMS TO IMPROVE YOUR GRADE |
Exams #5 and #6 can be used to improve your grade,
in case you are not satisfied with your grade after the first four exams. Exam #5 may replace the score for either Exam #1 or Exam #3. Exam #6 may replace the score for either Exam #2 or Exam #4.
Note that there is no risk in taking these optional exams. |
| FINAL LETTER GRADE |
| There are six total exams, each worth 100 points. Two
exam scores are dropped, so the maximum total score is 400. Your final letter
grade is computed on the basis of your total numerical score, according
to the following scale. |
| THE SCALE |
A |
A- |
B+ |
B |
B- |
C+ |
C |
C- |
D+ |
D |
F |
380
–
400 |
360
–
379 |
340
–
359 |
320
–
339 |
300
–
319 |
280
–
299 |
260
–
279 |
240
–
259 |
220
–
239 |
200
–
219 |
0
–
199 |
|