Linear logic is a substructural logic proposed by French logician Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the dualities of the former with many of the constructive properties of the latter. Although the logic has also been studied for its own sake, more broadly, ideas from linear logic have been influential in fields such as programming languages, game semantics, and quantum physics (because linear logic can be seen as the logic of quantum information theory), as well as linguistics, particularly because of its emphasis on resource-boundedness, duality, and interaction. Linear logic lends itself to many different presentations, explanations, and intuitions. Proof-theoretically, it derives from an analysis of classical sequent calculus in which uses of (the structural rules) contraction and weakening are carefully controlled. Operationally, this means that logical deduction is no longer merely about an ever-expanding collection of persistent "truths", but also a way of manipulating resources that cannot always be duplicated or thrown away at will. In terms of simple denotational models, linear logic may be seen as refining the interpretation of intuitionistic logic by replacing cartesian (closed) categories by symmetric monoidal (closed) categories, or the interpretation of classical logic by replacing Boolean algebras by C*-algebras.
Notation comparison This article follows Girard's notation. For readers who are familiar with different notations, the following table, compiled by Paoli 2002, compares the notations for linear-logic connectives and constants across several sources.
Connectives, duality, and polarity
Syntax
The language L {\displaystyle {\mathcal {L}}} of classical propositional linear logic can be defined recursively as follows.
If φ {\displaystyle \varphi } is an atomic formula, then φ {\displaystyle \varphi } is a formula of L {\displaystyle {\mathcal {L}}} . If φ {\displaystyle \varphi } is an atomic formula, then φ ⊥ {\displaystyle \varphi ^{\bot }} is a formula of L {\displaystyle {\mathcal {L}}} . If φ {\displaystyle \varphi } and ψ {\displaystyle \psi } are formulas of L {\displaystyle {\mathcal {L}}} , then φ ⊗ ψ {\displaystyle \varphi \otimes \psi } is too. If φ {\displaystyle \varphi } and ψ {\displaystyle \psi } are formulas of L {\displaystyle {\mathcal {L}}} , then φ {\displaystyle \varphi } ⅋ ψ {\displaystyle \psi } is too. If φ {\displaystyle \varphi } and ψ {\displaystyle \psi } are formulas of L {\displaystyle {\mathcal {L}}} , then φ & ψ {\displaystyle \varphi \ \&\ \psi } is too. If φ {\displaystyle \varphi } and ψ {\displaystyle \psi } are formulas of L {\displaystyle {\mathcal {L}}} , then φ ⊕ ψ {\displaystyle \varphi \oplus \psi } is too. If φ {\displaystyle \varphi } is a formula of L {\displaystyle {\mathcal {L}}} , then ! φ {\displaystyle !\varphi } is too. If φ {\displaystyle \varphi } is a formula of L {\displaystyle {\mathcal {L}}} , then ? φ {\displaystyle ?\varphi } is too.
1 {\displaystyle {\bf {1}}} is a formula of L {\displaystyle {\mathcal {L}}} .
⊥ {\displaystyle \bot } is a formula of L {\displaystyle {\mathcal {L}}} .
⊤ {\displaystyle \top } is a formula of L {\displaystyle {\mathcal {L}}} .
0 {\displaystyle {\bf {0}}} is a formula of L {\displaystyle {\mathcal {L}}} . Here p and p⊥ range over logical atoms. For reasons to be explained below, the connectives ⊗, ⅋, 1, and ⊥ are called multiplicatives, the connectives &, ⊕, ⊤, and 0 are called additives, and the connectives ! and ? are called exponentials. We can further employ the following terminology:
Binary connectives ⊗, ⊕, & and ⅋ are associative and commutative; 1 is the unit for ⊗, 0 is the unit for ⊕, ⊥ is the unit for ⅋ and ⊤ is the unit for &. Every proposition A in CLL has a dual A⊥, defined as follows:
… excerpt ends here. Continue reading the full article.
