Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Elementary canonical formulae: extending Sahlqvist's theorem |
scientific article |
Statements
Elementary canonical formulae: extending Sahlqvist's theorem (English)
0 references
16 August 2006
0 references
The class of Sahlqvist formulae in arbitrary polyadic modal languages is generalized and extended to the class of so-called inductive formulae. A representation of modal polyadic languages in a combinatorial style is used to introduce them. By generalizing the method of minimal valuations à la Sahlqvist-van Benthem and the topological approach of Sambin and Vaccaro, it is proved that all inductive formulae are elementary canonical and thus extend Sahlqvist's theorem over them. The elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames, is studied and characterized.
0 references
modal logic
0 references
elementary canonical formulae
0 references
polyadic modal languages
0 references
Sahlqvist formulae
0 references
first-order definability
0 references
persistence
0 references
reversive languages
0 references
nominals
0 references
pure formulae
0 references
0 references
0 references
0 references
