Skip Navigation

Journal of Logic and Computation 1997 7(5):581-603; doi:10.1093/logcom/7.5.581
© 1997 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by OHLBACH, H. J.
Right arrow Articles by SCHMIDT, R. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Functional Translation and Second-Order Frame Properties of Modal Logics

HANS JÜRGEN OHLBACH1 and RENATE A. SCHMIDT2

1Imperial College of Science, Technology and Medicine, Department of Computing 180 Queen's Gate, London SW7 2AZ. E-mail: h.ohlbach{at}doc.ic.ac.uk
2Max-Planck-Institut für Informatik Im Stadtwald, 66123 Saarbrücken, Germany. E-mail: schmidt{at}mpi-sb.mpg.de

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


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.