Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
From MaRDI portal
(Redirected from Publication:5310652)
Recommendations
- IV. Semantic extensions of SQEMA
- Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- Completeness and correspondence in hybrid logic via an extension of SQEMA
Cited in
(45)- Algorithmic correspondence and canonicity for distributive modal logic
- Intermediate logics admitting a structural hypersequent calculus
- Probabilistic stit logic
- scientific article; zbMATH DE number 7243670 (Why is no real title available?)
- 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
- DOING WITHOUT ACTION TYPES
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- Algorithmic correspondence and canonicity for possibility semantics
- Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
- Converse-PDL with regular inclusion axioms: a framework for MAS logics
- IV. Semantic extensions of SQEMA
- SCAN -- elimination of predicate quantifiers
- A STIT logic for reasoning about social influence
- Completeness and correspondence in hybrid logic via an extension of SQEMA
- Algorithmic correspondence and analytic rules
- Sahlqvist via translation
- 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
- Unified inverse correspondence for LE-logics
- Computing witnesses using the SCAN algorithm
- Algorithmic correspondence for intuitionistic modal mu-calculus
- Polynomial-time checking of generalized Sahlqvist syntactic shape
- Inductive sequents for distributive modal logic
- On the strength and scope of DLS
- A calculus for modal compact Hausdorff spaces
- Deterministic SQEMA and application for pre-contact logic
- 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}
- Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
- Formalized soundness and completeness of epistemic and public announcement logic
- Algorithmic correspondence and canonicity for non-distributive logics
- Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces
- Modal reduction principles across relational semantics
- Algorithmic correspondence for relevance logics. II: Inductive formulae in flat languages for relevance logics
This page was built for publication: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310652)
