Pages that link to "Item:Q2498906"

The following pages link to Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906):

Displaying 30 items.

• Algorithmic correspondence and canonicity for distributive modal logic (Q409328) (← links)
• Sahlqvist theorem for modal fixed point logic (Q418010) (← links)
• The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837) (← links)
• Sahlqvist correspondence for modal mu-calculus (Q454371) (← links)
• A dichotomy for some elementarily generated modal logics (Q497429) (← links)
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
• On canonicity of poset expansions (Q651383) (← links)
• The bounded proof property via step algebras and step frames (Q741087) (← links)
• On the canonical element conjecture. II (Q1340932) (← links)
• Algorithmic correspondence and canonicity for non-distributive logics (Q2273010) (← links)
• Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations (Q2304538) (← links)
• Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) (← links)
• Modal frame correspondences and fixed-points (Q2433098) (← links)
• Modal definability of first-order formulas with free variables and query answering (Q2446543) (← links)
• Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
• Sahlqvist formulas in hybrid polyadic modal logics (Q2772884) (← links)
• CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS (Q3005995) (← links)
• Towards incorporating background theories into quantifier elimination (Q3643319) (← links)
• On the strength and scope of DLS (Q3647241) (← links)
• An extension of Kracht's theorem to generalized Sahlqvist formulas (Q3647298) (← links)
• (Q4625704) (← links)
• A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC (Q4928772) (← links)
• Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA (Q4982120) (← links)
• (Q4994195) (← links)
• Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233) (← links)
• (Q5119388) (← links)
• Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic (Q6067750) (← links)
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability (Q6487229) (← links)
• Modal syllogistic (Q6599618) (← links)
• Polynomial-time checking of generalized Sahlqvist syntactic shape (Q6639733) (← links)