| Course Purpose |
| The purpose of this course is to learn the logical fundamentals for lots of fields in computer science, such as logical circuits, programming theory, system verification, artificial intelligence, and so on, and get the ability to view the targets in an abstract/formal manner. |
| Learning Goals |
| Students will get the ability to obtain the basics of propositional logic and first-order logic. Specifically, they will understand the following elements: syntax, semantics and their relationship, proof methods of natural deduction and axiomatic systems, the resolution principle, and completeness and soundness. |
| Topic |
| Session 1 | Introduction, the set and the relationship |
| Session 2 | Propositional logic--language, syntax, semantics |
| Session 3 | Propositional theory - Derivation (fusion) principle |
| Session 4 | Propositional logic --Sequent calculation |
| Session 5 | Propositional logic -- Soundness and completeness |
| Session 6 | First-order predicate logic -- Language, syntax, semantics |
| Session 7 | First-order predicate logic -- Herbrand's theorem, unification |
| Session 8 | First-order predicate logic -- Derivation (fusion) principle |
| Session 9 | First-order predicate logic -- Sequence calculus, syntax |
| Session 10 | Midterm exam |
| Session 11 | Review |
| Session 12 | Propositional modal logic |
| Session 13 | Nonclassical logic, summary |
| Session 14 | Final exam |
＊＊This content is based on April 1, 2024. For the latest syllabus information and details, please check the