Sahlqvist Formulas Unleashed in Polyadic Modal Languages

In Frank Wolter, Heinrich Wansing, Maarten de Rijke & Michael Zakharyaschev (eds.), Advances in Modal Logic, Volume 3. World Scientific. pp. 221-240 (2002)
Download Edit this record How to cite View on PhilPapers
We propose a generalization of Sahlqvist formulae to polyadic modal languages by representing modal polyadic languages in a combinatorial style and thus, in particular, developing what we believe to be the right approach to Sahlqvist formulae at all. The class of polyadic Sahlqvist formulae PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.
PhilPapers/Archive ID
Revision history
Archival date: 2018-04-20
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Sahlqvist Theorems for Precontact Logics.Balbiani, Philippe & Kikot, Stanislav

Add more citations

Added to PP index

Total views
119 ( #29,683 of 48,923 )

Recent downloads (6 months)
29 ( #23,923 of 48,923 )

How can I increase my downloads?

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