Polynomial-time checking of generalized Sahlqvist syntactic shape

DOI10.1016/J.TCS.2024.114875MaRDI QIDQ6639733

Krishna Manoorkar, Alessandra Palmigiano, Author name not available (Why is that?)

Publication date: 18 November 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

modal logicnonclassical logicsSahlqvist formulasalgorithmic correspondence theoryinductive formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic correspondence and canonicity for distributive modal logic
• A Sahlqvist theorem for distributive modal logic
• Symmetric categorial grammar
• Residuated lattices. An algebraic glimpse at substructural logics
• On modal logic with an intuitionistic base
• On logics with coimplication
• Computing circumscription revisited: A reduction algorithm
• Semantic analysis of orthologic
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• A formalization of the propositional calculus of H-B logic
• Positive modal logic
• Algorithmic correspondence and canonicity for non-distributive logics
• Algebraic modal correspondence: Sahlqvist and beyond
• Elementary canonical formulae: extending Sahlqvist's theorem
• On the strength and scope of DLS
• Semi-de Morgan algebras
• Unified Correspondence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Relational and Kleene-Algebraic Methods in Computer Science

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)