Implicational Relevance Logic is 2-ExpTime-Complete

DOI10.1007/978-3-319-08918-8_27MaRDI QIDQ5170831zbMATH OpenOpenAlexFDO

Authors 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

branching VASScomplexityfocusing proofsrelevance logic

Mathematics Subject Classification ID

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

Cited in

(1)

• There exist exactly two maximal strictly relevant extensions of the relevant logic R

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170831)