Skip to Main content Skip to Navigation
New interface
Conference papers

Implicational Relevance Logic is 2-ExpTime-Complete

Sylvain Schmitz 1, 2, * 
* Corresponding author
1 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Schmitz Connect in order to contact the contributor
Submitted on : Wednesday, October 22, 2014 - 6:51:50 PM
Last modification on : Saturday, June 25, 2022 - 7:43:38 PM

Links full text



Sylvain Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications, Jul 2014, Vienna, Austria. pp.395--409, ⟨10.1007/978-3-319-08918-8_27⟩. ⟨hal-01076698⟩



Record views