One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity

DOI10.18778/0138-0680.2020.25OpenAlexW3101938764MaRDI QIDQ4999464

Paweł Płaczek

Publication date: 7 July 2021

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.18778/0138-0680.2020.25

zbMATH Keywords

Lambek calculussubstructural logicsequent systemnonassociative linear logicPTime complexity

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Cut elimination and strong separation for substructural logics: an algebraic approach
• Classical non-associative Lambek calculus
• Lambek calculus is NP-complete
• On Classical Nonassociative Lambek Calculus
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• Involutive Nonassociative Lambek Calculus: Sequent Systems and Complexity
• Residuated frames with applications to decidability

This page was built for publication: One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity