Implicational Relevance Logic is 2-EXPTIME-Complete

We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.

[1]  N. Rescher.  Review: Moh Shaw-Kwei, The Deduction Theorems and Two New Logical Systems , 1952 .

[2]  Rupak Majumdar,et al.  Expand, Enlarge, and Check for Branching Vector Addition Systems , 2013, CONCUR.

[3]  Philippe de Groote,et al.  Towards Abstract Categorial Grammars , 2001, ACL.

[4]  Jean Goubault-Larrecq,et al.  Karp-Miller Trees for a Branching Extension of VASS , 2005, Discret. Math. Theor. Comput. Sci..

[5]  Ahmed Bouajjani,et al.  Analysis of recursively parallel programs , 2012, POPL '12.

[6]  Stéphane Demri,et al.  The Covering and Boundedness Problems for Branching Vector Addition Systems , 2009, FSTTCS.

[7]  Nuel D. Belnap,et al.  Entailment : the logic of relevance and necessity , 1975 .

[8]  Owen Rambow,et al.  Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations , 1994, ACL.

[9]  Sylvain Schmitz,et al.  Non-elementary complexities for branching VASS, MELL, and extensions , 2014, CSL-LICS.

[10]  Bruno Guillaume,et al.  Vector addition tree automata , 2004, LICS 2004.

[11]  Vincent Padovani,et al.  Ticket Entailment is decidable , 2017 .

[12]  Sylvain Salvati,et al.  Minimalist Grammars in the Light of Logic , 2011, Logic and Grammar.

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

[14]  Philippe Schnoebelen,et al.  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[15]  Richard Statman,et al.  Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..

[16]  Natarajan Shankar,et al.  Decision problems for propositional linear logic , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[18]  Alasdair Urquhart,et al.  The complexity of decision procedures in relevance logic II , 1999, Journal of Symbolic Logic.

[19]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[20]  Alasdair Urquhart.  The Complexity of Decision Procedures in Relevance Logic II , 1999 .

[21]  Katalin Bimbó,et al.  On the decidability of implicational ticket entailment , 2013, The Journal of Symbolic Logic.

[22]  Florent Jacquemard,et al.  FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems , 2016, Log. Methods Comput. Sci..

[23]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[24]  Sylvain Schmitz.  On the Computational Complexity of Dominance Links in Grammatical Formalisms , 2010, ACL.

[25]  Stéphane Demri,et al.  The covering and boundedness problems for branching vector addition systems , 2013, J. Comput. Syst. Sci..