##
Course Outline |
||

A thorough introduction to mathematical logic, covering the following topics: propositional and first-order logic; soundness, completeness, and compactness of first-order logic; first-order theories; undecidability and Gödel's incompleteness theorem; and an introduction to other logics such as intuitionistic and modal logics. Furthermore, the course stresses the application of logic to various areas of computer science such as computability, programming languages, program specification and verification.

Week |
Date |
Topics |

1 | Sep 09/13 | Introduction, Propositional Logic |

2 | Sep 16/20 | Propositional Logic, Natural Deduction |

3 | Sep 23/27 | Natural Deduction, Normal forms |

4 | Sep 30/Oct 04 | First Order Logic, (Test 1) |

5 |
Oct 07/18 | First Order Logic, Natural Deduction |

6 | Oct 21/25 | Natural Deduction, Intuitionistic Logic |

7 | Oct 28/Nov 01 | Decidability, Gödel's
results, (Test 2) |

8 | Nov 04/08 | Modal Logic |

9 | Nov 11/15 | Modal Logic |

10 | Nov 18/22 | Modal Logic,
decidability, (Test 3) |

11 | Nov 25/29 | Dynamic Logic |

12 | Dec 02/06 | Program verification, review |

- Logic in Computer Science, 2nd edition, M. Huth & M. Ryan, Cambridge University Press (2004), ISBN 0-521-54310-X
- Mathematical Introduction to Logic, 2nd edition, H.B. Enderton, Academic Press (2001), ISBN 0-12-238452-0
- Logic for Mathematics and Computer Science, S.N. Burris, Pearson Education (1998), ISBN 0-13-285974-2

COSC 5P02 Home Page