## Proof Theory of Partially Normal Skew Monoidal Categories

 Tarmo Uustalu Niccolò Veltri Noam Zeilberger

 The skew monoidal categories of Szlachányi are a weakening of monoidal categories where the three structural laws of left and right unitality and associativity are not required to be isomorphisms but merely transformations in a particular direction. In previous work, we showed that the free skew monoidal category on a set of generating objects can be concretely presented as a sequent calculus. This calculus enjoys cut elimination and admits focusing, i.e. a subsystem of canonical derivations, which solves the coherence problem for skew monoidal categories. In this paper, we develop sequent calculi for partially normal skew monoidal categories, which are skew monoidal categories with one or more structural laws invertible. Each normality condition leads to additional inference rules and equations on them. We prove cut elimination and we show that the calculi admit focusing. The result is a family of sequent calculi between those of skew monoidal categories and (fully normal) monoidal categories. On the level of derivability, these define 8 weakenings of the (unit,tensor) fragment of intuitionistic non-commutative linear logic.

In David I. Spivak and Jamie Vicary: Proceedings of the 3rd Annual International Applied Category Theory Conference 2020 (ACT 2020), Cambridge, USA, 6-10th July 2020, Electronic Proceedings in Theoretical Computer Science 333, pp. 230–246.
Published: 8th February 2021.

 ArXived at: http://dx.doi.org/10.4204/EPTCS.333.16 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
 Comments and questions to: eptcs@eptcs.org For website issues: webmaster@eptcs.org