Cited in
(41)- Algorithmic correspondence and canonicity for distributive modal logic
- Intermediate logics admitting a structural hypersequent calculus
- Probabilistic stit logic
- Towards incorporating background theories into quantifier elimination
- Deontic epistemic stit logic distinguishing modes of mens rea
- Algebraic proof theory for substructural logics: cut-elimination and completions
- The Ackermann approach for modal logic, correspondence theory and second-order reduction
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- Jónsson-style canonicity for ALBA-inequalities
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- Converse-PDL with regular inclusion axioms: a framework for MAS logics
- A STIT logic for reasoning about social influence
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Completeness and correspondence in hybrid logic via an extension of SQEMA
- An extension of Kracht's theorem to generalized Sahlqvist formulas
- Sahlqvist via translation
- FOL Fitting
- Formalized soundness and completeness of epistemic logic
- Algebraic modal correspondence: Sahlqvist and beyond
- Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
- Elementary canonical formulae: extending Sahlqvist's theorem
- Sahlqvist theory for impossible worlds
- Algorithmic correspondence for intuitionistic modal mu-calculus
- Deterministic SQEMA and application for pre-contact logic
- Dual characterizations for finite lattices via correspondence theory for monotone modal logic
- On Sahlqvist theory for hybrid logics
- Unified correspondence and proof theory for strict implication
- The bounded proof property via step algebras and step frames
- Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
- A Complete STIT Logic for Knowledge and Action, and Some of Its Applications
- Probabilistic stit logic and its decomposition
- Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}
- Improved Second-Order Quantifier Elimination in Modal Logic
- Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
- Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
- Grounding power on actions and mental attitudes
- Algorithmic correspondence and canonicity for non-distributive logics
- Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces
- Epistemic Logic
This page was built for software: SQEMA
