Algorithmic correspondence and canonicity for distributive modal logic

This publication has 15 references indexed in Scilit:

• Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
  Electronic Notes in Theoretical Computer Science, 2009
• Elementary canonical formulae: extending Sahlqvist’s theorem
  Annals of Pure and Applied Logic, 2006
• Canonical extensions and relational completeness of some substructural logics
  The Journal of Symbolic Logic, 2005
• A Sahlqvist theorem for distributive modal logic
  Annals of Pure and Applied Logic, 2005
• Sahlqvist Formulas in Hybrid Polyadic Modal Logics
  Journal of Logic and Computation, 2001
• Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
  Logic Journal of the IGPL, 1999
• Constructive canonicity in non-classical logics
  Annals of Pure and Applied Logic, 1997
• Positive modal logic
  Studia Logica, 1995
• On the canonicity of Sahlqvist identities
  Studia Logica, 1994
• Untersuchungen ber das Eliminationsproblem der mathematischen Logik
  Mathematische Annalen, 1935