Pages that link to "Item:Q3431963"

The following pages link to Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963):

Displayed 10 items.

• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) ‎ (← links)
• Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) ‎ (← links)
• Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) ‎ (← links)
• Converse-PDL with regular inclusion axioms: a framework for MAS logics (Q2901207) ‎ (← links)
• IV. Semantic extensions of SQEMA (Q3643312) ‎ (← links)
• Towards incorporating background theories into quantifier elimination (Q3643319) ‎ (← 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)