A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
By: Victor Barroso-Nascimento, Ekaterina Piotrovskaya, Elaine Pimentel
Potential Business Impact:
Makes computer logic more efficient and understandable.
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).
Similar Papers
On the Logical Content of Logic Programs
Logic in Computer Science
Shows what computer programs truly understand.
Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
Logic
Makes logic rules work like a mirror.
Proof-theoretic Semantics for Second-order Logic
Logic
Makes logic rules work without needing big math.