Teaching Assistant: Aaron Anderson
Lectures : Monday - Wednesday - Friday, 9:00 - 9:50, online
Discussion Section: Thursday, 9:00 - 9:50, online
Requisites: 110A or 131A or Philosophy 135 or consent of the instructor.
This course provides an introduction to mathematical logic aimed at relatively advanced mathematics majors and mathematically inclined computer science and philosophy majors.
Part 1, Propositional logic: Syntax and semantics, Functional Completeness, Axiomatization and Deductive Completeness. About two weeks.
Part 2, First order logic: Syntax and semantics, elementary definability, arithmetical relations on the natural numbers, structures which admit quantifier elimination; the Completeness, Compactness and Skolem-Löwenheim Theorems. About six weeks.
Part 3, Tarski's Theorem and the Gödel Incompleteness Theorem. About two weeks.
Text: The course will be taught from Lecture Notes posted on the class homepage.
Online teaching: Most times I use some prepared slides, which include some material not in the Lecture Notes and are afterwards posted on the class homepage, along with the recordings of the lectures.
It is highly recommended that students consult before each lecture the log file posted on the class homepage; this describes (roughly) which pages of the Notes will be covered---and then records, after the lecture, what actually happened.
Homework will be assigned on the class webpage and will be due before the next section meeting.
Grading. The grade will be based on two midterms (about 30% of
the grade), the final exam (about 40%) and the Homework, which
will count for 30%. The midterms and the final will be take-home,
following Departmental regulations and at least two weeks warning will be given for the
midterms.
Fair warning. Math 114L is more difficult, it is more abstract and it covers substantially more material than the typical upper division math course. It is especially fast-paced in the beginning, and if you stay behind in the first two weeks, you will never catch up.