Polynomial-time checking of generalized Sahlqvist syntactic shape
From MaRDI portal
Publication:6639733
Cites work
- scientific article; zbMATH DE number 3499717 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- A Sahlqvist theorem for distributive modal logic
- A formalization of the propositional calculus of H-B logic
- Algebraic modal correspondence: Sahlqvist and beyond
- Algorithmic correspondence and canonicity for distributive modal logic
- Algorithmic correspondence and canonicity for non-distributive logics
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Computing circumscription revisited: A reduction algorithm
- Elementary canonical formulae: extending Sahlqvist's theorem
- On logics with coimplication
- On modal logic with an intuitionistic base
- On the strength and scope of DLS
- Positive modal logic
- Relational and Kleene-Algebraic Methods in Computer Science
- Residuated lattices. An algebraic glimpse at substructural logics
- Semantic analysis of orthologic
- Semi-de Morgan algebras
- Symmetric categorial grammar
- Unified correspondence
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
This page was built for publication: Polynomial-time checking of generalized Sahlqvist syntactic shape
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639733)