The following pages link to IV. Semantic extensions of SQEMA (Q3643312):
Displaying 10 items.
- SQEMA (Q15589) (← links)
- The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) (← links)
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963) (← 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)
