Modal operators are expressions which modify the way in which declarative sentences are true – e.g. it is necessary/possible that, in the future/past, it is obligatory/permissible that, it is known/believed that, it is provable that, after performing a computational operation it is true that.
Modal logic – i.e. the study of formal systems for reasoning about such operators – finds far reaching applications in philosophy, mathematics, and computer science. In this module, we will study axiomatic and tableau proof systems for some common propositional and first-order modal logics as well as a semantic theory in the form of Kripke (or possible world) models relative to which we will prove soundness and completeness.
Dr Adam Epstein
Timing and CATS
This module runs in the Spring Term and is worth 15 CATS.