Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
From MaRDI portal
Publication:5483000
zbMATH Open1111.03017MaRDI QIDQ5483000FDOQ5483000
Willem Conradie, Valentin Goranko, Dimiter Vakarelov
Publication date: 15 August 2006
Recommendations
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Modal logic (including the logic of norms) (03B45)
Cited In (9)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
- 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
- Title not available (Why is that?)
- Algebraic modal correspondence: Sahlqvist and beyond
- Elementary canonical formulae: extending Sahlqvist's theorem
- Title not available (Why is that?)
- 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)