MATH 455 - Mathematical Logic


Latest version of the Syllabus

Assignments and announcements Handouts:

Online Resources:
HW 1: Do problems 1,3,5 from the first "review of sets" handout. Only write up #1, and turn that in Jan 23. (NOTE: There was a typo that said to write up #3. If you've already done that, go ahead and turn that one in, otherwise write up #1.) If you don't get this to me before Wednesday that's OK, but try to get it t me by Monday.

HW2 (due Friday, Feb 4):

  • Problems 1-2 from Page 6 of the Propositional Logic handout. Only turn in #2
  • Text page 27: 2, 3, 4a, 7, 10ab, 12, 13 (turn in the underlined problems)
  • The "nor" symbol ↓ is defined on Page 51 of the text. (a) Give the truth table for ↓. (b) Prove that it is complete all by itself by showing how to define ¬ and ∧in terms of Enderton ↓.

HW3 (due Monday, Feb 13)

HW4 (due Friday, Feb 24)


HW5: Text p99/1-4,6, 8 (turn in all, March 8)


Covers material through Feb 27 lecture and HW due March 8

HW6: Text p99/ 10, 11bc, 12b, 14, 15, 18, 19, 28a, look at rest (especially 24, 25) (Underlined due March 20)

HW7: Text p129-130/1, 4, 5, 6, 7, 9, 12, 14, 15 (Underlined due April 7)

HW8: Text p145-6/4, 7, 8
p162-3/1, 2, 3, 7, 8,

(Underlined due April 24)

We're leaving the text for a while;

See TM notes ----->

HW9; turn in problems 1,3, and 5 by last week of class

Some HW9 solutions (by request)

Notes: Review of sets

Notes: Ordinals, Cardinals, and Closures

Notes: Propositional Logic

Math 100 Video on Truth Tables. (There's a password, it is Math100)

(Cellphone-friendlier version.)

Turing Machine Notes Part I

Turing Machine Notes Part II

Some TM flow diagrams (from class)