The following pages link to SQEMA (Q15589):
Displaying 39 items.
- A STIT logic for reasoning about social influence (Q310094) (← links)
- Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
- Algorithmic correspondence and canonicity for distributive modal logic (Q409328) (← links)
- The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837) (← links)
- Algorithmic correspondence for intuitionistic modal mu-calculus (Q483295) (← links)
- Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces (Q516317) (← links)
- Deontic epistemic stit logic distinguishing modes of mens rea (Q545173) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- The bounded proof property via step algebras and step frames (Q741087) (← links)
- Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras (Q1697346) (← links)
- Probabilistic stit logic and its decomposition (Q1951297) (← links)
- Formalized soundness and completeness of epistemic logic (Q2148773) (← links)
- Algorithmic correspondence and canonicity for non-distributive logics (Q2273010) (← links)
- Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) (← links)
- Intermediate logics admitting a structural hypersequent calculus (Q2422309) (← links)
- Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals (Q2462670) (← links)
- Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) (← links)
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
- Converse-PDL with regular inclusion axioms: a framework for MAS logics (Q2901207) (← links)
- Dual characterizations for finite lattices via correspondence theory for monotone modal logic (Q2983393) (← links)
- Sahlqvist theory for impossible worlds (Q2983397) (← links)
- Jónsson-style canonicity for ALBA-inequalities (Q2983398) (← links)
- On Sahlqvist theory for hybrid logics (Q2983399) (← links)
- Unified correspondence and proof theory for strict implication (Q2983401) (← links)
- Probabilistic Stit Logic (Q3011971) (← links)
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963) (← links)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
- Improved Second-Order Quantifier Elimination in Modal Logic (Q3532480) (← links)
- A Complete STIT Logic for Knowledge and Action, and Some of Its Applications (Q3601785) (← links)
- Towards incorporating background theories into quantifier elimination (Q3643319) (← links)
- An extension of Kracht's theorem to generalized Sahlqvist formulas (Q3647298) (← links)
- (Q4625704) (← links)
- Grounding power on actions and mental attitudes (Q4925175) (← links)
- Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA (Q4982120) (← links)
- (Q4994195) (← links)
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS (Q5241231) (← links)
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA (Q5310652) (← links)
- (Q5324584) (← links)
- (Q5483000) (← links)
