Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Model-theoretic Aspects
Willem Conradie, Valentin Goranko, Dimiter Vakarelov · PhilPapers (PhilPapers Foundation) · 2005
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 \emph{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 \emph{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.