Implicational Relevance Logic is 2-EXPTIME-Complete
Logic in Computer Science
2022-05-18 v4
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.
Cite
@article{arxiv.1402.0705,
title = {Implicational Relevance Logic is 2-EXPTIME-Complete},
author = {Sylvain Schmitz},
journal= {arXiv preprint arXiv:1402.0705},
year = {2022}
}
Comments
Fixed Fig. 6 as pointed out by Hiromi Tanaka