Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

DOI10.2168/LMCS-2(1:5)2006zbMATH Open1126.03018OpenAlexW2950450725MaRDI QIDQ5310652FDOQ5310652

Authors: Willem Conradie, Valentin Goranko, Dimiter Vakarelov 

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-2(1:5)2006

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

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Cited In (36)

• Algorithmic correspondence and canonicity for distributive modal logic
• Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
• Intermediate logics admitting a structural hypersequent calculus
• Title not available (Why is that?)
• Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
• Title not available (Why is that?)
• Towards incorporating background theories into quantifier elimination
• Deontic epistemic stit logic distinguishing modes of mens rea
• DOING WITHOUT ACTION TYPES
• 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 canonicity for possibility semantics
• 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
• 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
• Title not available (Why is that?)
• Probabilistic Stit Logic
• A STIT logic for reasoning about social influence
• 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
• Polynomial-time checking of generalized Sahlqvist syntactic shape
• Algorithmic correspondence for intuitionistic modal mu-calculus
• On the strength and scope of DLS
• The bounded proof property via step algebras and step frames
• 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
• Algorithmic correspondence and canonicity for non-distributive logics
• Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

Uses Software

• SQEMA

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)