Canonical formulas for k-potent commutative, integral, residuated lattices
Nick Bezhanishvili, Nick Galatos, Luca Spada

TL;DR
This paper extends the concept of canonical formulas to k-potent, commutative, integral, residuated lattices, providing a uniform algebraic method to axiomatize all subvarieties of these structures and applying it to substructural logics.
Contribution
It introduces canonical formulas for k-potent, commutative, integral, residuated lattices and demonstrates their effectiveness in axiomatizing all subvarieties of these lattices.
Findings
Any subvariety of k-CIRL is axiomatized by canonical formulas.
The paper provides applications and examples demonstrating the method.
Extends canonical formula techniques to substructural logics.
Abstract
Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method originally hinged on the relational semantics of those logics, recently it has been completely recast in algebraic terms. In this new perspective canonical formulas are built from a finite subdirectly irreducible algebra by describing completely the behaviour of some operations and only partially the behaviour of some others. In this paper we export the machinery of canonical formulas to substructural logics by introducing canonical formulas for -potent, commutative, integral, residuated lattices (-). We show that any subvariety of - is axiomatised by canonical formulas. The paper ends with some applications and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
