Schedule
Syllabus and Exercises
The course comprises the following content from the course text
(Moschovakis 2006, 2nd edition):
- Chapter 1 - 5: everything.
- Chapter 6: p 71-75.
- Chapter 7 - 8: everything.
- Chapter 9: p 121-126.
- Chapter 11: p 157 - 169 (up to the von Neumann class)
- Chapter 12: Cursory reading: definition of ordinals as transitive
sets, ordinal induction and recursion, the aleph numbers,
the cumulative hierarchy, the generalized continuum hypothesis.
- Syllabus of the course in
English and in
Swedish.
- The following exercises are for practice only
Outside this course is most Chapter 6 of the course text, which is
recommendable further reading for those interested in computer science, and Chapter 10, which is
recommendable for those with an interest in mathematical analysis.
Examination and Assignments
The examination of the course will consist of a written exam, and
possibly also an oral exam.
Assignments will be handed out during the
course. These are not mandatory, but it will be possible
to earn bonus points (10% of total score) for the written exam
by solving these successfully. You will have about two weeks to
work on each set of problems that will be handed out in due time
according to the following plan:
Unless otherwise indicated the score on each problem of the assignments
is 5 p. The highest total score is 75 p.
Bonus percentage is given by the following scale: 0-14p: 0% , 15-29p:
2.5%, 30-45p: 5%, 45-59p: 7.5%, 60-75p: 10%.
June 4, 2010,
Erik Palmgren.