Elementary canonical formulae: extending Sahlqvist’s theorem

Annals of Pure and Applied Logic 141 (1):180-217 (2006)
  Copy   BIBTEX

Abstract

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames

Similar books and articles

On the strength and scope of DLS.Willem Conradie - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):279-296.
Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
A Sahlqvist theorem for substructural logic.Tomoyuki Suzuki - 2013 - Review of Symbolic Logic 6 (2):229-253.
An interpolation theorem.Martin Otto - 2000 - Bulletin of Symbolic Logic 6 (4):447-462.
Stable Definability and Generic Relations.Byunghan Kim & Rahim Moosa - 2007 - Journal of Symbolic Logic 72 (4):1163 - 1176.
On Non-Deterministic Quantification.Thomas Macaulay Ferguson - 2014 - Logica Universalis 8 (2):165-191.
Elementary realizability.Zlatan Damnjanovic - 1997 - Journal of Philosophical Logic 26 (3):311-339.
The Chang-Łoś-Suszko theorem in a topological setting.Paul Bankston - 2006 - Archive for Mathematical Logic 45 (1):97-112.
An empirical analysis of modal theorem provers.Ullrich Hustadt & Renate A. Schmidt - 1999 - Journal of Applied Non-Classical Logics 9 (4):479-522.

Analytics

Added to PP
2013-12-31

Downloads
249 (#64,919)

6 months
75 (#34,852)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

References found in this work

Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
Derivation rules as anti-axioms in modal logic.Yde Venema - 1993 - Journal of Symbolic Logic 58 (3):1003-1034.
A Sahlqvist theorem for distributive modal logic.Mai Gehrke, Hideo Nagahashi & Yde Venema - 2004 - Annals of Pure and Applied Logic 131 (1-3):65-102.
Topology and duality in modal logic.Giovanni Sambin & Virginia Vaccaro - 1988 - Annals of Pure and Applied Logic 37 (3):249-296.

View all 15 references / Add more references