Expressing additives using multiplicatives and subexponentials

2016 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
more » ... ow the additive connectives 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.
doi:10.1017/s0960129516000293 fatcat:lgl2vrbnczby7ez2w72slx3quq