Implicational relevance logic is 2-ExpTime-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8560 LNCS, Issue , 2014, Pages 395-409

  Schmitz, Sylvain ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

branching VASS; complexity; focusing proofs; Relevance logic

Indexed keywords

DIFFERENTIATION (CALCULUS); VECTORS;

BRANCHING VASS; COMPLEXITY; COVERABILITY; EXPONENTIAL TIME; RELEVANCE LOGIC; VECTOR ADDITION SYSTEMS;

BIOMINERALIZATION;

EID: 84958552698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-08918-8_27     Document Type: Conference Paper

References (23)

1. Anderson, A.R., Belnap, Jr., N.D.: Entailment: The Logic of Relevance and Necessity, vol. I. Princeton University Press (1975)
2. Andreoli, J.M.: Logic programming with focusing proofs in linear logic. J. Logic Comput. 2(3), 297-347 (1992)
3. Bimbó, K., Dunn, J.M.: On the decidability of implicational ticket entailment. J. Symb. Log. 78(1), 214-236 (2013)
4. Church, A.: The weak theory of implication. Kontrolliertes Denken, Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften, pp. 22-37. Kommissions-Verlag Karl Alber, Munich (1951)
5. Curry, H.H., Feys, R.: Combinatory Logic. Studies in Logic and the Foundations of Mathematics, vol. 1, 22. North-Holland Publishing Company (1958)
6. Demri, S., Jurdzínski, M., Lachish, O., Lazíc, R.: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1), 23-38 (2012)
7. Dunn, J.M., Restall, G.: Relevance logic. In: Handbook of Philosophical Logic, pp. 1-128. Kluwer Academic Publishers (2002)
8. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson's Lemma. In: LICS 2011, pp. 269-278. IEEE Computer Society (2011)
9. de Groote, P., Guillaume, B., Salvati, S.: Vector addition tree automata. In: LICS 2004, pp. 64-73. IEEE Computer Society (2004)
10. Kripke, S.A.: The problem of entailment. In: ASL 1959. J. Symb. Log., vol. 24, p. 324 (1959) (abstract)
11. Lazíc, R., Schmitz, S.: Non-elementary complexities for branching VASS, MELL, and extensions. In: CSL-LICS 2014, ACM (to appear, 2014), arXiv:1401.6785 [cs.LO]
12. Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure App. Logic 56(1-3), 239-311 (1992)
13. Majumdar, R.,Wang, Z.: Expand, enlarge, and check for branching vector addition systems. In: D'Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 152-166. Springer, Heidelberg (2013)
14. Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3), 305-329 (1982)
15. Moh, S.K.: The deduction theorems and two new logical systems. Methodos 2, 56-75 (1950)
16. Padovani, V.: Ticket entailment is decidable. Math. Struct. Comput. Sci. 23(3), 568-607 (2013)
17. Riche, J., Meyer, R.K.: Kripke, Belnap, Urquhart and relevant decidability & complexity. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 224-240. Springer, Heidelberg (1999)
18. Schmitz, S.: On the computational complexity of dominance links in grammatical formalisms. In: ACL 2010, pp. 514-524. ACL Press (2010)
19. Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theor. Comput. Sci. 9(1), 67-72 (1979)
20. Urquhart, A.: The undecidability of entailment and relevant implication. J. Symb. Log. 49(4), 1059-1073 (1984)
21. Urquhart, A.: The complexity of decision procedures in relevance logic. Truth or Consequences: Essays in honour of Nuel Belnap, pp. 61-76. Kluwer Academic Publishers (1990)
22. Urquhart, A.: The complexity of decision procedures in relevance logic II. J. Symb. Log. 64(4), 1774-1802 (1999)
23. Verma, K.N., Goubault-Larrecq, J.: Karp-Miller trees for a branching extension of VASS. Discrete Math. Theor. Comput. Sci. 7(1), 217-230 (2005)