Implicational Relevance Logic is 2-ExpTime-Complete

DOI10.1007/978-3-319-08918-8_27zbMath1417.03168OpenAlexW3105321196MaRDI QIDQ5170831

Sylvain Schmitz

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08918-8_27

zbMATH Keywords

complexityrelevance logicfocusing proofsbranching VASS

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

This page was built for publication: Implicational Relevance Logic is 2-ExpTime-Complete