Mathematical Logic (Fall 2022)

• Instructor: Qiang Yin
• Time: 12:55 - 15:40, Thursday
• Location: 中院 312

• [15/09] Syntax of FO [PDF]
• [22/09] Semantics of FO (I) [PDF]
• [27/09] Semantics of FO (II) [PDF]
• [09/10] Semantics of FO (III) [PDF]
• [13/10] Sequent Calculus (I) [PDF]
• [20/10] Sequent Calculus (II) [PDF]
• [27/10] Completeness (I) [PDF]
• [03/11] Completeness (II) [PDF]
• [10/11] Completeness (III) [PDF]
• [24/11] The Lowenheim-Skolem Theorem and the Compactness Theorem [PDF]
• [01/12] Decidability and Enumerability [PDF]
• [08/12] The Undecidability of First-order Logic [PDF]
• [15/12] The Undecidability of Arithmetic [PDF]
• [22/12] 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: Dec 22, 2022