2000 character limit reached
Implicational Relevance Logic is 2-EXPTIME-Complete (1402.0705v4)
Published 4 Feb 2014 in cs.LO
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.