On Fragments without Implications of both the Full Lambek Logic and some of its Substructural Extensions
\`Angel Garc\'ia-Cerda\~na, Ventura Verd\'u

TL;DR
This paper investigates fragments of the full Lambek logic and its substructural extensions without implications, providing algebraic semantics and analyzing their properties and embeddings.
Contribution
It introduces algebraizable Gentzen systems for implication-less fragments of substructural logics and characterizes their algebraic semantics and structural properties.
Findings
Fragments are algebraizable with pointed semilatticed monoid varieties.
External systems without implications have algebraic semantics but are not algebraizable.
Fragments can be embedded in their ideal completions.
Abstract
In this paper we study some fragments without implications of the (Hilbert) full Lambek logic and also some fragments without implications of some of the substructural extensions of that logic. To do this, we perform an algebraic analysis of the Gentzen systems defined by the substructural calculi . Such systems are extensions of the full Lambek calculus with the rules codified by a subsequence, , of the sequence ; where stands for \emph{exchange}, for \emph{left weakening}, for \emph{right weakening}, and for \emph{contraction}. We prove that these Gentzen systems (in languages without implications) are algebraizable by obtaining their equivalent algebraic semantics. All these classes of algebras are varieties of pointed semilatticed monoids and they can be embedded in their ideal completions. As a consequence of…
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 · Rough Sets and Fuzzy Logic
