Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T11:53:29.107Z Has data issue: false hasContentIssue false

Decidable fragments of first-order modal logics

Published online by Cambridge University Press:  12 March 2014

Frank Wolter
Affiliation:
Institut für Informatik, Universität Leipzig, Augustus-Platz 10-11, 04109 Leipzig, Germany, E-mail: wolter@informatik.uni-leipzig.de
Michael Zakharyaschev
Affiliation:
Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK, E-mail: mz@dcs.kcl.ac.uk

Abstract

The paper considers the set of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in , which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable