Expressing Additives Using Multiplicatives and Subexponentials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2018

Expressing Additives Using Multiplicatives and Subexponentials

Abstract

Subexponential logic is a variant of linear logic with a family of exponential connectives—called subex-ponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that a classical propositional multiplicative subexponential logic (MSEL) with one unrestricted and two linear subexponentials can encode the halting problem for two register Minsky machines, and is hence undecidable. We then show how the additive con-nectives can be directly simulated by giving an encoding of propositional multiplicative additive linear logic (MALL) in an MSEL with one unrestricted and four linear subexponentials.
Fichier principal
Vignette du fichier
main.pdf (222.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01222767 , version 1 (30-10-2015)

Licence

Attribution - NoDerivatives

Identifiers

  • HAL Id : hal-01222767 , version 1

Cite

Kaustuv Chaudhuri. Expressing Additives Using Multiplicatives and Subexponentials. Mathematical Structures in Computer Science, 2018, 28 (5), pp.651-666. ⟨hal-01222767⟩
334 View
180 Download

Share

Gmail Facebook X LinkedIn More