Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects

In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 17-51 (1998)
  Copy   BIBTEX

Abstract

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and results, and outline further research perspectives.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 17-51.
Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
On the strength and scope of DLS.Willem Conradie - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):279-296.
Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 221-240.
Quasi-Modal Equivalence of Canonical Structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
Quasi-modal equivalence of canonical structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.

Analytics

Added to PP
2018-02-17

Downloads
65 (#256,004)

6 months
224 (#12,203)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

An extension of Kracht's theorem to generalized Sahlqvist formulas.Stanislav Kikot - 2009 - Journal of Applied Non-Classical Logics 19 (2):227-251.
A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.
Towards incorporating background theories into quantifier elimination.Andrzej Szalas - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):325-340.

Add more citations

References found in this work

Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
Logics containing k4. part II.Kit Fine - 1985 - Journal of Symbolic Logic 50 (3):619-651.
Derivation rules as anti-axioms in modal logic.Yde Venema - 1993 - Journal of Symbolic Logic 58 (3):1003-1034.

View all 12 references / Add more references