##
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 | Jan 09/11 | Introduction,
Propositional Logic (no lab) |

2 | Jan 16/17/18 | Propositional Logic, Natural Deduction |

3 | Jan 23/24/25 | Natural Deduction, Normal forms |

4 | Jan 30/31, Feb 01 | First Order Logic, (Test 1) |

5 | Feb 06/07/08 | First Order Logic, Natural Deduction |

6 | Feb 13/14/15 | Natural Deduction, Intuitionistic Logic |

7 | Feb 27/28, Mar 01 | Decidability, Gödel's
results, (Test 2) |

8 | Mar 06/07/08 | Modal Logic |

9 | Mar 13/14/15 | Modal Logic |

10 | Mar 20/21/22 | Modal Logic,
decidability, (Test 3) |

11 | Mar 27/28/29 | Dynamic Logic |

12 | Apr 03/05 | Program verification,
review (no lab) |

- 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