Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-11T12:14:35.608Z Has data issue: false hasContentIssue false

An explicit formula for the free exponential modality of linear logic

Published online by Cambridge University Press:  21 April 2017

PAUL-ANDRÉ MELLIÈS
Affiliation:
Univ Paris Diderot, Sorbonne Paris Cité, IRIF, UMR 8243, CNRS, F-75205 Paris, France Email: mellies@irif.fr, nicolas.tabareau@inria.fr
NICOLAS TABAREAU
Affiliation:
Univ Paris Diderot, Sorbonne Paris Cité, IRIF, UMR 8243, CNRS, F-75205 Paris, France Email: mellies@irif.fr, nicolas.tabareau@inria.fr
CHRISTINE TASSON
Affiliation:
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes - Bretagne Atlantiquezd Email: christine.tasson@irif.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The exponential modality of linear logic associates to every formula A a commutative comonoid !A which can be duplicated in the course of reasoning. Here, we explain how to compute the free commutative comonoid !A as a sequential limit of equalizers in any symmetric monoidal category where this sequential limit exists and commutes with the tensor product. We apply this general recipe to a series of models of linear logic, typically based on coherence spaces, Conway games and finiteness spaces. This algebraic description unifies for the first time a number of apparently different constructions of the exponential modality in spaces and games. It also sheds light on the duplication policy of linear logic, and its interaction with classical duality and double negation completion.