Pages that link to "Item:Q5310652"

The following pages link to Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA (Q5310652):

Displaying 32 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)
• Probabilistic Stit Logic (Q3011971) (← links)
• Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
• A Complete STIT Logic for Knowledge and Action, and Some of Its Applications (Q3601785) (← links)
• IV. Semantic extensions of SQEMA (Q3643312) (← links)
• Towards incorporating background theories into quantifier elimination (Q3643319) (← links)
• On the strength and scope of DLS (Q3647241) (← links)
• (Q4625704) (← links)
• Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA (Q4982120) (← links)
• (Q4994195) (← links)
• Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233) (← links)
• (Q5119388) (← links)
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS (Q5241231) (← links)
• DOING WITHOUT ACTION TYPES (Q6153157) (← links)