Full Lambek Calculus with Contraction is Undecidable

We prove that the set of formulae provable in the full Lambek calculus with the structural rule of contraction is undecidable. In fact, we show that the positive fragment of this logic is undecidable.

[1]  C. Tsinakis,et al.  A Survey of Residuated Lattices , 2002 .

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

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

[4]  Friedrich Otto,et al.  String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[5]  Karel Chvalovský,et al.  UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS , 2015, The Journal of Symbolic Logic.

[6]  Yuichi Komori.  Predicate logics without the structure rules , 1986, Stud Logica.

[7]  C. Tsinakis,et al.  Ordered algebraic structures , 1985 .

[8]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[9]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[10]  G. Gentzen.  Untersuchungen über das logische Schließen. II , 1935 .

[11]  Saul Kripke,et al.  A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[12]  Mark V. Sapir,et al.  Algorithmic Problems in Varieties , 1995, Int. J. Algebra Comput..

[13]  Bayu Surarso,et al.  Cut Elimination in Noncommutative Substructural Logics , 1996, Reports Math. Log..

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

[15]  P. Jipsen,et al.  Residuated frames with applications to decidability , 2012 .

[16]  Rostislav Horčík,et al.  Word problem for knotted residuated lattices , 2015 .

[17]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[18]  Peter Jipsen,et al.  Residuated lattices: An algebraic glimpse at sub-structural logics , 2007 .

[19]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[20]  Hermann Maurer.  Automata, Languages and Programming , 2009, Lecture Notes in Computer Science.

[21]  Ralph Freese,et al.  Free modular lattices , 1980 .

[22]  Eiji Kiriyama,et al.  The contraction rule and decision problems for logics without structural rules , 1991, Stud Logica.

[23]  Laurent Chottin.  Strict Deterministic Languages and Controlled Rewriting Systems , 1979, ICALP.

[24]  Kazushige Terui,et al.  Algebraic proof theory for substructural logics: Cut-elimination and completions , 2012, Ann. Pure Appl. Log..

[25]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[26]  Alasdair Urquhart,et al.  The undecidability of entailment and relevant implication , 1984, Journal of Symbolic Logic.