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

In Renate Schmidt, Ian Pratt-Hartmann, Mark Reynolds & Heinrich Wansing (eds.), Advances in Modal Logic, Volume 5. Kings College London Publ.. pp. 17-51 (2005)
Download Edit this record How to cite View on PhilPapers
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.
ISBN(s)
PhilPapers/Archive ID
CONECF
Revision history
Archival date: 2018-04-20
View upload history
References found in this work BETA
Modal Logic with Names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.

View all 12 references / Add more references

Citations of this work BETA

Add more citations

Added to PP index
2018-02-17

Total views
36 ( #45,321 of 50,123 )

Recent downloads (6 months)
10 ( #41,049 of 50,123 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.