Abstract

. Recently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-additive fragment of second order classical linear logic is also undecidable, using an encoding of two-counter machines originally due to Kanovich. The faithfulness of this encoding is proved by means of the phase semantics. In this paper, we write LL for the full propositional fragment of linear logic, MLL for the multiplicative fragment, MALL for the multiplicative-additive fragment, and MELL for the multiplicative-exponential fragment. Similarly, we write ILL, IMLL, etc. for the fragments of intuitionistic linear logic, LL2, MLL2, etc. for the second order fragments of linear logic, and ILL2, IML...

Citations

79	Recursive unsolvability of Post’s problem of “Tag” and other topics in theory of Turing machines - Minsky - 1961
23	Some syntactical observations on linear logic - Schellinx - 1991
13	How to program an infinite abacus - Lambek - 1961
12	The undecidability of second order multiplicative linear logic - Lafont, Scedrov - 1996
8	Decision Problems for Second Order Linear Logic - Lincoln, Scedrov, et al. - 1995
6	The direct simulation of Minsky machines in linear logic - Kanovich - 1995
4	logic: Its syntax and semantics, Advances in Linear Logic - Linear - 1995
2	A brief guide to linear logic, Current trends in theoretical computer science - Scedrov - 1993