Topics covered are sentential logic, first-order predicate logic, and the beginnings of model theory, including completeness and compactness theorems, and Godel's Incompleteness Theorem for formal arithmetic. Although there is little previous subject matter required for this course, students should have some familiarity with the process of proving theorems, and with the abstract notion of a mathematical structure. This background is provided by such courses as MATH 207, MATH 214, COMP 202, and PHIL 203. Students who have taken PHIL 203 only should have at least a B pass. Anyone who is uncertain of their suitability is encouraged to discuss it with the Coordinator before enrolment.
Standard disclaimer applies.