Mathematical Logic (Spring 2024)

• Instructor: Qiang Yin
• Time: 12:55 - 15:40, Friday
• Location: 东中院 4-201
• TAs: 耿雨桐、李兴阳
• Office hour: 18:00 – 20:00, every Friday, 东中院 4-201

• [23/02] Introduction & Syntax of FO [PDF]
• [01/03] Semantics of FO (I) [PDF]
• [08/03] Semantics of FO (II) [PDF]
• [15/03] Semantics of FO (III) [PDF]
• [22/03] Sequent Calculus (I) [PDF]
• [29/03] Sequent Calculus (II) [PDF]
• [07/04] Completeness (I) [PDF]
• [11/04] Completeness (II) [PDF]
• [19/04] Completeness (III) [PDF]
• [26/04] The LS Theorem and Compactness [PDF]
• [28/04] Decidability and Enumerability [PDF]
• [10/05] The Undecidability of First-order Logic [PDF]
• [17/05] The Undecidability of Arithmetic [PDF]
• [23/05] Gödel’s Incompleteness Theorems [PDF]

Mathematical Logic, H. -D. Ebbinghuas, J. Flum, and W. Thomas, Springer, Second Edition, 2008.

On the Unusual Effectiveness of Logic in Computer Science. Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion Kolaitis, Moshe Y. Vardi, and Victor Vianu. Bulletin of Symbolic Logic. 2001.

Zorn’s Lemma and Transfinite Induction

Last updated: May 13, 2024