2000 character limit reached
Implicational Relevance Logic is 2-EXPTIME-Complete
Published 4 Feb 2014 in cs.LO | (1402.0705v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.