System NEL is Undecidable

Abstract System NEL is a conservative extension of multiplicative exponential linear logic (extended by the rules mix and nullary mix) by a self-dual noncommutative connective called seq which has an intermediate position between the connectives par and times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is simple, the proof of the faithfulness is a little intricate because there is no sequent calculus and no phase semantics available for NEL.

[1]  Christian Retoré,et al.  Pomset Logic: A Non-commutative Extension of Classical Linear Logic , 1997, TLCA.

[2]  Max I. Kanovich.  Simulating Computations in Second Order Non-Commutative Linear Logic , 1996, Electron. Notes Theor. Comput. Sci..

[3]  J. Lambek.  How to Program an Infinite Abacus , 1961, Canadian Mathematical Bulletin.

[4]  Christian Retoré,et al.  The mix rule , 1994, Mathematical Structures in Computer Science.

[5]  Andre Scedrov,et al.  The Undecidability of Second Order Multiplicative Linear Logic , 1996, Inf. Comput..

[6]  Lutz Straßburger,et al.  Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.

[7]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[8]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[9]  Steffen Hölldobler,et al.  Properties of a Logical System in the Calculus of Structures , 2001 .

[10]  Max I. Kanovich,et al.  The Complexity of Horn Fragments of Linear Logic , 1994, Ann. Pure Appl. Log..

[11]  J. Girard,et al.  Advances in Linear Logic , 1995 .

[12]  Alwen Tiu,et al.  A Local System for Classical Logic , 2001, LPAR.

[13]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[14]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[15]  Paola Bruscoli.  A Purely Logical Account of Sequentiality in Proof Search , 2002, ICLP.

[16]  Lutz Straßburger,et al.  A Non-commutative Extension of MELL , 2002, LPAR.

[17]  Lutz Stra.  MELL in the Calculus of Structures , 2001 .

[18]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[19]  Yves Lafont.  The Undecidability of Second Order Linear Logic Without Exponentials , 1996, J. Symb. Log..

[20]  Max I. Kanovich.  The direct simulation of Minsky machines in linear logic , 1995 .