If you wish, you can download the syllabus as a PDF. Please note, however, that all dates are approximate *and the PDF version of the syllabus will not be kept up to date*. You should check this website for updates as we proceed.

It is a requirement of the class that all of the problem sets must be completed and submitted for marking. Failure to submit all of the problem sets will automatically lead to a grade of NC. Please note that the requirement is that the problem sets should be "completed", and by that I mean that one has given them a proper effort. Simply turning in a piece of paper with a few random jottings does not count as completing a problem set.

As with any mathematical subject-matter, it is impossible to learn this material without doing a lot of exercises. The book contains many more exercises than are assigned, and students are encouraged to do additional exercises to improve their understanding of the material. Students are also encouraged to work on the problems together—though, of course, submitted material should be a student's own work.

Problem sets will be due one week after we complete the relevant material. Dates below are thus estimates. But the problem sets will never be due *before* those. You are advised, however, not to wait until we finish the material to begin the problem set. You will be much happier if you start working on the problems as we cover the relevant material. Among other things, this will reveal to you, right away, if there is something you do not really understand.

Please note that the exercises for (6)-(7) below are still being revised.

- First set of exercises for "Formal Background", covering sections 1-5: 15.1(i,ii), 15.2, 15.3, 15.5–15.8, and 15.10. Exercises 15.4 and 15.9 are optional.

Due~~about 8~~10 February.

Please note that there was originally a typo in Exercise 15.5. It should ask you to show that the maximal consistent theories are exactly the complete*closed*theories. - Second set of exercises for "Formal Background", covering sections 6-13: 15.11–15.15, and 15.17–15.19. Exercise 15.16 is optional.

Due~~about 17~~22 February.

Please note that there was originally a minor omission in Proposition 6.7 (and therefore in Exercise 15.12). For part (2), we need to assume that Σ proves "0 ≠ 1". - First set of exercises for Gödel's "On Formally Undecidable Propositions": These are exercises 2.1-2.6.

Due 6 March. - Second set of exercises for Gödel's "On Formally Undecidable Propositions": These are exercises 2.7-2.12. Exercise 2.10(ii) is optional (and a bit challenging).

Due 15 March. - Exercises for Tarski, Mostowski, and Robinson,
*Undecidable Theories*: These are exercises 3.1-3.4, 3.6-3.7, and 3.9.

Due 5 April. - Exercises for Boolos,
*The Logic of Provability*, Ch. 2: These are exercises 4.1-4.8.

Due about 21 April - Exercises on Feferman's "Arithmetization of Metamathematics in a General Setting": You should do all of these.

Due 10 May

You are of course welcome to do your problem sets by hand or on a computer. But if you are going to do the latter, then I would strongly recommend that you not use a traditional "word processor" to do so. They are simply not optimized for mathematics, and their output is awful. A much better option is LaTeX, and if you want to use LaTeX in an environment that feels a lot like a word processor, then you can use LyX. Especially if you have any intention of ever doing serious technical writing, you should start using LaTeX sooner rather than later. In the sciences, especially, it is the standard tool. Many scientific journals do not accept submissions in any other form.