PMATH 432 First Order Logic and ComputabilityPure Mathematics (2009-2010)
The concepts of formal provability and logical consequence in first order logic are introduced, and their equivalence is proved in the soundness and completeness theorems. Goedel's incompleteness theorem is discussed, making use of the halting problem of computability theory. Relative computability and the Turing degrees are further studied.
Prerequisites: PMATH 345 or 346; Not open to General Mathematics students
Notes: Offered in the Fall of odd years.
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Csima, Barbara | 10:30-11:20 M T W Th F | 28/30 | 1 | 1 | MC 4063 | 7171 | ||
| Held With: PMATH 632 | ||||||||
Sections For Spring 2009
PMATH 432 is not held in Spring 2009