2000 character limit reached
The Sup Connective in IMALL: A Categorical Semantics (2205.02142v3)
Published 4 May 2022 in cs.LO, math.CT, and math.LO
Abstract: We explore a proof language for intuitionistic multiplicative additive linear logic, incorporating the sup connective that introduces additive pairs with a probabilistic elimination, and sum and scalar products within the proof-terms. We provide an abstract characterization of the language, revealing that any symmetric monoidal closed category with biproducts and a monomorphism from the semiring of scalars to the semiring Hom(I,I) is suitable for the job. Leveraging the binary biproducts, we define a weighted codiagonal map at the heart of the sup connective.