and HJ. Ohlbach RA. Schmidt 1 Imperial College of Science, Technology and Medicine, Department of Computing, 180 Queen's Gate,and LondonSW7 2AZ, UK. E-mail: email@example.com 1Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. E-mail: firstname.lastname@example.org
Normal modal logics can be defined axiomatically as Hilbert systems, or semantically in terms of Kripke's possible worlds and accessibility relations. Unfortunately there are Hilbert axioms which do not have corresponding first-order properties for the accessibility relation. For these logics the standard semantics-based theorem proving techniques, in particular, the relational translation into first-order predicate logic, do not work. There is an alternative translation, the so-called functional translation, in which the accessibility relations are replaced by certain terms which intuitively can be seen as functions mapping worlds to accessible worlds. In this paper we show that from a certain point of view this functional language is more expressive than the relational language, and that certain second order frame properties can be mapped to first-order formulae expressed in the functional language. Moreover, we show how these formulae can be computed automatically from the Hilbert axioms. This extends the applicability of the functional translation method.
Keywords: Modal logic, functional semantics, transformation to many-sorted logic, correspondence problem, quantifier elimination, theorem proving for non-classical logics.
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Part of the OUP Journals World Wide Web service.
Last modification: 24 Oct 1997
Copyright© Oxford University Press, 1997.