Decidable fragments of first-order modal logics

Wolter, F. and Zakharyaschev, Michael (2001) Decidable fragments of first-order modal logics. The journal of Symbolic Logic 66 (3), pp. 1415-1438. ISSN 0022-4812.

Full text not available from this repository.

Official URL: https://doi.org/10.2307/2695115

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.

Metadata

Item Type:	Article
School:	School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User:	Sarah Hall
Date Deposited:	08 Nov 2021 14:52
Last Modified:	08 Nov 2021 14:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46629

Statistics

Archive Staff Only (login required)

Edit/View Item