Implicational Relevance Logic is 2-ExpTime-Complete - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Implicational Relevance Logic is 2-ExpTime-Complete

Résumé

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.

Dates et versions

hal-01076698 , version 1 (22-10-2014)

Identifiants

Citer

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⟩
74 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More