paper

Implicational Relevance Logic is 2-EXPTIME-Complete

arXiv:1402.0705 · doi:10.1007/978-3-319-08918-8_27 10.1017/jsl.2015.7

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.

Fixed Fig. 6 as pointed out by Hiromi Tanaka

References in corpus (1)