Polynomial-time checking of generalized Sahlqvist syntactic shape

DOI10.1016/J.TCS.2024.114875MaRDI QIDQ6639733FDOQ6639733

Authors: Krishna Manoorkar, Alessandra Palmigiano 

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

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

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)