Course Meeting: 9:00 MWF 310 AH
Call Number: 29841
Instructor: David Marker
Office: 411 SEO/ 312 SEO
Office Hours: (in 312 SEO) M 2:30-4:00, W 2-3
phone: (312) 413-3044
A first graduate course in mathematical logic.
We will introduce the fundamental themes of mathematical logic
(truth, provability, and computability), discuss their
interconnections and examine the power and limits of formal methods.
- Mathematical structures
- Formal proofs
- Godel's Completeness Theorem
- The Compactness Theorem and elementary model theory
- Model theory of algebraically closed fields
- models of computation, Church's Thesis
- Universal machines and undecidability
- Recursively enumerable and arithmetic sets
- Godel's Incompleteness Theorem
For this course I will not be closely following any text.
- N. Cutland, Computability: An introduction to recursive function
theory, Cambridge University Press, 1986.
- H.-D. Ebbinghaus, J. Flum and W. Thomas, Mathematical Logic
Second Edition, Springer-Verlag, 1994
The treatment of material at the begining of the course on structures, truth
and formal proofs will be similar to the treatment in Ebbinghaus-Flum-Thomas.
The treatment of computability will closely follow Cutland.
I will circulate lecture notes.
Graduate standing. No previous background in logic is assumed. As many examples will come from Algebra, Math 516 is a useful corequisite.
I will give out about 8 problem sets. You may work together on homework problems (and I encourage you to do so), but when you turn in the problem you should acknowledge that you have worked together.
There will probably be a one hour final exam, possibly oral,
testing basic concepts,
definitions, and statements of theorems.