Skip to main content
Conference Proceedings

Implicational relevance logic is 2-ExpTime-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8560 LNCS 395-409
DOI: 10.1007/978-3-319-08918-8_27
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2014 Springer International Publishing Switzerland.

Author supplied keywords

Cite

CITATION STYLE

APA

Schmitz, S. (2014). Implicational relevance logic is 2-ExpTime-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8560 LNCS, pp. 395–409). Springer Verlag. https://doi.org/10.1007/978-3-319-08918-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free