SQEMA
From MaRDI portal
Software:15589
No author found.
Related Items (39)
Converse-PDL with regular inclusion axioms: a framework for MAS logics ⋮ A STIT logic for reasoning about social influence ⋮ Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications ⋮ Formalized soundness and completeness of epistemic logic ⋮ Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA ⋮ Unnamed Item ⋮ Algebraic modal correspondence: Sahlqvist and beyond ⋮ Unnamed Item ⋮ Intermediate logics admitting a structural hypersequent calculus ⋮ Algebraic proof theory for substructural logics: cut-elimination and completions ⋮ Algorithmic correspondence and canonicity for distributive modal logic ⋮ The Ackermann approach for modal logic, correspondence theory and second-order reduction ⋮ Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras ⋮ Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA ⋮ Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ Probabilistic stit logic and its decomposition ⋮ Improved Second-Order Quantifier Elimination in Modal Logic ⋮ Dual characterizations for finite lattices via correspondence theory for monotone modal logic ⋮ Sahlqvist theory for impossible worlds ⋮ Jónsson-style canonicity for ALBA-inequalities ⋮ On Sahlqvist theory for hybrid logics ⋮ Unified correspondence and proof theory for strict implication ⋮ Algorithmic correspondence for intuitionistic modal mu-calculus ⋮ Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals ⋮ Probabilistic Stit Logic ⋮ Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces ⋮ Grounding power on actions and mental attitudes ⋮ Deontic epistemic stit logic distinguishing modes of mens rea ⋮ Unnamed Item ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ Elementary canonical formulae: extending Sahlqvist's theorem ⋮ A Complete STIT Logic for Knowledge and Action, and Some of Its Applications ⋮ The bounded proof property via step algebras and step frames ⋮ Towards incorporating background theories into quantifier elimination ⋮ Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA ⋮ An extension of Kracht's theorem to generalized Sahlqvist formulas ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Unnamed Item ⋮ Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
This page was built for software: SQEMA
