3. Electronic Theses and Dissertations (ETDs) - All submissions

Browse

Now showing 1 - 1 of 1

Algebraic filtrations of the modal m-Calculus
(2016) Cromberge, Michael Benjamin
In this thesis we analyse the issue of decidability for two modal logics which contain least binders. Towards this goal, we begin the work with a brief survey of modal logic, PDL, the modal -calculus and algebraic filtrations as exposited by Conradie et al. The first such modal logic we analyse is the fragment of the modal -calculus corresponding to PDL; the second logic is the equational theory of the class of -algebras (motivated by the least root calculus of Pratt). We offer a new, algebraic, proof for the decidability of PDL by showing that PDL has the finite model property with respect to the class of dynamic algebras. We then show that the equational theory of the class of -algebras has the finite model property with respect to the class of -algebras; this is based on the proof of Pratt but differs in an important detail. The finite model property results for these two modal logics are achieved by an algebraic filtration method based on that of Conradie et al.