Labelled calculi for lattice-based modal logics

DOI10.1007/978-3-031-26689-8_3MaRDI QIDQ6132565FDOQ6132565

Andrea de Domenico, Alessandra Palmigiano, Ineke van der Berg, Author name not available (Why is that?), Giuseppe Greco, Krishna Manoorkar

Publication date: 17 August 2023

Published in: Logic and Its Applications (Search for Journal in Brave)

zbMATH Keywords

non-distributive modal logiclabelled calculialgorithmic correspondence theoryalgorithmic proof theory

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) General logic (03Bxx)

Cites Work

• Rough sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Canonical extensions and relational completeness of some substructural logics
• Bounded lattice expansions
• Proof analysis in modal logic
• Proof analysis in intermediate logics
• Displaying modal logic
• Handbook of philosophical logic. Vol. 6
• Algorithmic correspondence and canonicity for distributive modal logic
• Unified Correspondence
• Title not available (Why is that?)
• Unified correspondence as a proof-theoretic tool
• Syntactic Completeness of Proper Display Calculi
• Algorithmic correspondence and canonicity for non-distributive logics
• Non-distributive logics: from semantics to meaning
• Categories: How I Learned to Stop Worrying and Love Two Sorts
• Multi-type display calculus for dynamic epistemic logic
• Labelled calculi for the logics of rough concepts
• Rough concepts
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Lattice logic as a fragment of (2-sorted) residuated modal logic
• Modal reduction principles: a parametric shift to graphs

This page was built for publication: Labelled calculi for lattice-based modal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132565)