π€ AI Summary
This work addresses the absence of a purely proof-theoretic semantics for classical multiplicative-additive linear logic (MALL). We introduce a novel proof-theoretic semantic framework grounded in Basis Extension Semantics (BeS), diverging from conventional model-theoretic or context-set semantics by assigning semantic content directly to proofs via the notion of βbasis support.β This constitutes the first extension of BeS to classical linear logic, achieving a principled theoretical transition from intuitionistic to classical settings. The resulting semantics is entirely proof-structure-driven and establishes a strict correspondence between proof equivalence and semantic equivalence. It yields the first fully intrinsic, resource-sensitive proof-theoretic semantics for MALL, enabling precise semantic characterization of computational processes.
π Abstract
Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of all contexts that can be used to prove it (e.g. phase semantics) or by assigning meaning directly to proofs (e.g. coherence spaces). This work proposes a different perspective on assigning meaning to proofs by adopting a proof-theoretic perspective. More specifically, we employ base-extension semantics (BeS) to characterise proofs through the notion of base support. Recent developments have shown that BeS is powerful enough to capture proof-theoretic notions in structurally rich logics such as intuitionistic linear logic. In this paper, we extend this framework to the classical case, presenting a proof-theoretic approach to the semantics of the multiplicative-additive fragment of linear logic (MALL).