This course will introduce the student to the basic notions of mathematical logic. Topics to be covered include the syntax and semantics of propositional and first-order logic, the completeness and compactness theorems, computability theory (including the unsolvability of the halting problem and the concept of recursive function), and the Gödel incompleteness theorems. Time permitting, some elementary set theory will also be discussed.
Apply to this course