Expressing additives using multiplicatives and subexponentials

  title={Expressing additives using multiplicatives and subexponentials},
  author={Kaustuv Chaudhuri},
  journal={Mathematical Structures in Computer Science},
  pages={651 - 666}
  • Kaustuv Chaudhuri
  • Published 21 November 2016
  • Mathematics
  • Mathematical Structures in Computer Science
Subexponential logic is a variant of linear logic with a family of exponential connectives – called subexponentials – 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… 
2 Citations
Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq
This work presents an alternate undecidability proof for entailment in (intuitionistic) multiplicative subexponential linear logic (MSELL) and gives an alternate presentation of those two counters machines as sequent rules, where computation is performed by proof-search, and halting reduced to provability.
A Coq Library of Undecidable Problems
The library of mechanised reductions is a collaborative effort, growing constantly and it is seeking more outside contributors willing to work on undecidability results in Coq.


Undecidability of Multiplicative Subexponential Logic
It is shown that classical propositional multiplicative linear logic extended with one unrestricted and two incomparable linear subexponentials can encode the halting problem for two register Minsky machines, and is hence undecidable.
Algorithmic specifications in linear logic with subexponentials
This work shows that focused proof search can be precisely linked to a simple algorithmic specification language that contains while-loops, conditionals, and insertion into and deletion from multisets and proposes a new logical connective that allows for the creation of new subexponentials, thereby further augmenting the algorithmic expressiveness of logic.
Classical and Intuitionistic Subexponential Logics Are Equally Expressive
Subexponential logic, which is a family of substructural refinements of classical logic, each parametric over a preorder over the subexponential connectives, does not suffer from this asymmetry if the preorder is systematically modified as part of the encoding.
Specifying Proof Systems in Linear Logic with Subexponentials
Decision problems for propositional linear logic
It is shown that, unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable and, provided that without the model storage operator, the decision problem becomes PSPACE-complete.
Monadic concurrent linear logic programming
This paper extends Lolli with the remaining connectives of intuitionistic linear logic restricted to occur inside a monad, an idea taken from the concurrent logical framework (CLF) to create LolliMon, a language that has a natural forward chaining, committed choice operational semantics inside the monad.
Structural Focalization
A focused sequent calculus for propositional intuitionistic logic is presented and the proof of identity expansion, which establishes internal completeness, is a major contribution of this work.
Exploiting non-canonicity in the sequent calculus
This thesis provides a proof theoretic explanation for tabled deduction by exploiting the fact that in intuitionistic logic atoms can be assigned arbitrary polarity, and shows that linear logic can be used as a general framework for encoding proof systems for minimal, intuitionistic, and classical logics.
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
The main results of this paper show that the same notions of computability can be realized within the highly restricted monogenic formal systems called by Post the "Tag" systems, and within a peculiarly restricted variant of Turing machine which has two tapes, but can neither write on nor erase these tapes.
A General Proof System for Modalities in Concurrent Constraint Programming
It is shown how a proper structure of the subexponential signature in SELL$^\Cap$ allows for the specification of concurrent systems with timed, spatial, and epistemic modalities, thus providing a proof-theoretic foundations for those calculi.