作者: Masaru Shirahata
DOI:
关键词:
摘要: In this paper, we introduce the system CMLL of sequent calculus and establish its correspondence with compact closed categories. is equivalent in provability to MLL classical linear logic tensor par connectives identified. We show that allows a fairly simple cut-elimination, proofs have natural interpretation However, soundness cut-elimination procedure terms categorical by no means evident. answer question affirmatively using coherence result on categories Kelly Laplaza.