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.

翻译：我们表明,相关性逻辑的隐含碎片的可探测性在双倍指数时间里是完全的,在矢量添加分解系统中,可以减少或不再具有可覆盖性。