Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Sahlqvist formula
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
What can (and cannot) be expressed by structural display rules? Given a display calculus, we present a systematic procedure for… Expand
2012
2012
We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.
2012
2012
Precontact logics are propositional modal logics that have been recently considered in order to obtain decidable fragments of the… Expand
2010
2010
Onderzoek naar toekomstbeelden van ouders, kinderen, leerkrachten, pedagogisch medewerkers, sociaal-verpleegkundigen en… Expand
2009
2009
Sahlqvist formulas are a syntactically specified class of modal formulas proposed by Hendrik Sahlqvist in 1975. They are… Expand
Highly Cited
2006
Highly Cited
2006
Abstract We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so… Expand
2005
2005
We show that every extension of the basic hybrid logic with modal Sahlqvist axioms is complete. As a corollary of our approach… Expand
Highly Cited
1996
Highly Cited
1996
The fusion Ll Lr of two normal modal logics formulated in languages with disjoint sets of modal operators is the smallest normal… Expand
1975
1975
Abstract Trichopteran larvae ( Macronema transversum ) construct a feeding chamber and larval retreat of sand and silk on stones… Expand