Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
From MaRDI portal
Publication:5483000
Recommendations
Cited In (9)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
- AN ALGEBRAIC APPROACH TO CANONICAL FORMULAS: INTUITIONISTIC CASE
- Algebraic modal correspondence: Sahlqvist and beyond
- Elementary canonical formulae: extending Sahlqvist's theorem
- Deterministic SQEMA and application for pre-contact logic
- Title not available (Why is no real title available?)
- Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
- The bounded proof property via step algebras and step frames
Uses Software
This page was built for publication: Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483000)