Logic and computation I
This undergraduate course explores the foundational relationship between mathematical logic and the theory of computation. It covers computable functions and undecidability, propositional logic and NP-completeness, first-order logic and Gödel's completeness theorem, Ehrenfeucht--Fraïssé games, and Presburger arithmetic.
The course is intended for students in mathematics, computer science, and related areas. No previous background in mathematical logic is required.
The course is intended for students in mathematics, computer science, and related areas. No previous background in mathematical logic is required.
讲师
日期
2026年09月15日 至 11月17日
位置
| Weekday | Time | Venue | Online | ID | Password |
|---|---|---|---|---|---|
| 周二,周五 | 09:50 - 12:15 | A3-2a-302 | ZOOM 09 | 230 432 7880 | BIMSA |
参考资料
1. K. Tanaka, 計算理論と数理論理学 (Mathematics of Logic and Computation, in Japanese), Kyoritsu 2022.
2. Lecture series on logic and computation by Professor K. Tanaka at BIMSA.
2. Lecture series on logic and computation by Professor K. Tanaka at BIMSA.
听众
Undergraduate
, Advanced Undergraduate
视频公开
不公开
笔记公开
不公开
语言
中文