A note on the substructural hierarchy

DOI10.1002/MALQ.201500066MaRDI QIDQ2793913zbMATH OpenOpenAlexFDO

Authors Emil Jeřábek

Publication date 17 March 2016

Published in Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.00700

zbMATH Keywords

full Lambek calculussubstructural hierarchy

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03)

Abstract: We prove that all axiomatic extensions of the full Lambek calculus with exchange can be axiomatized by formulas on the $mathcal{N}_3$ level of the substructural hierarchy.

Cites work

• Algebraic proof theory for substructural logics: cut-elimination and completions

Cited in

(7)

• Poset products as relational models
• Canonical formulas for \(k\)-potent commutative, integral, residuated lattices
• Some applications of Gabai's internal hierarchy
• A short visit to the STS hierarchy
• BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
• Power and limits of structural display rules
• Algebraic proof theory: hypersequents and hypercompletions

This page was built for publication: A note on the substructural hierarchy

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