IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE
Sylvain Schmitz · Journal of Symbolic Logic · 2016
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.