Implicational Relevance Logic is 2-EXPTIME-Complete

Abstract

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.