SQEMA

swMATH3056MaRDI QIDQ15589FDOQ15589

Author name not available (Why is that?)

Described by source

• IV. Semantic extensions of SQEMA

Cited In (39)

• 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
• 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
• Algebraic proof theory for substructural logics: cut-elimination and completions
• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• Jónsson-style canonicity for ALBA-inequalities
• 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
• Converse-PDL with regular inclusion axioms: a framework for MAS logics
• Title not available (Why is that?)
• Probabilistic Stit Logic
• A STIT logic for reasoning about social influence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• An extension of Kracht's theorem to generalized Sahlqvist formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Sahlqvist theory for impossible worlds
• Algorithmic correspondence for intuitionistic modal mu-calculus
• Dual characterizations for finite lattices via correspondence theory for monotone modal logic
• On Sahlqvist theory for hybrid logics
• Unified correspondence and proof theory for strict implication
• 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}
• Improved Second-Order Quantifier Elimination in Modal Logic
• Grounding power on actions and mental attitudes
• Algorithmic correspondence and canonicity for non-distributive logics
• Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

This page was built for software: SQEMA