Skip to main content Accessibility help
×
×
Home

IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE

  • SYLVAIN SCHMITZ (a1)

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.

Copyright

References

Hide All
[1] Anderson, Alan Ross and Belnap, Nuel D. Jr., Entailment: The logic of relevance and necessity, vol. I, Princeton University Press, Princeton, 1975.
[2] Andreoli, Jean-Marc, Logic programming with focusing proofs in linear logic . Journal of Logic and Computation, vol. 2 (1992), no. 3, pp. 297347.
[3] Bimbó, Katalin and Michael Dunn, J., On the decidability of implicational ticket entailment , this Journal, vol. 78 (2013), no. 1, pp. 214236.
[4] Bojańczyk, Mikołaj, Muscholl, Anca, Schwentick, Thomas, and Segoufin, Luc, Two-variable logic on data trees and XML reasoning . Journal of the ACM, vol. 56 (2009), no. 3, pp. 148.
[5] Bouajjani, Ahmed and Emmi, Michael, Analysis of recursively parallel programs . ACM Transactions on Programming Languages and Systems, vol. 35 (2013), no. 3, pp. 10:1–10:49.
[6] Church, Alonzo, The weak theory of implication , Kontrolliertes Denken. Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften (Menne, A., Wilhelmy, A., and Angsil, H., editors), Kommissions-Verlag Karl Alber, Munich, 1951, pp. 2237.
[7] Curry, Haskell H. and Feys, Robert, Combinatory logic, vol. 1, Studies in Logic and the Foundations of Mathematics, vol. 22, North-Holland Publishing Company, Amsterdam, 1958.
[8] Groote, Philippe de, Towards abstract categorial grammars , Proceedings of ACL 2001, ACL Press, Toulouse, 2001, pp. 252259.
[9] de Groote, Philippe, Guillaume, Bruno, and Salvati, Sylvain, Vector addition tree automata, Proceedings of LICS 2004 , IEEE Computer Society, 2004, pp. 6473.
[10] Demri, Stéphane, Jurdziński, Marcin, Lachish, Oded, and Lazić, Ranko, The covering and boundedness problems for branching vector addition systems . Journal of Computer and System Sciences, vol. 79 (2013), no. 1, pp. 2338.
[11] Dimino, Jérémie, Jacquemard, Florent, and Segoufin, Luc, FO 2(<,+1,∼) on data trees, data tree automata and branching vector addition systems, preprint, hal.inria.fr:hal-00769249, 2015.
[12] Michael Dunn, J. and Restall, Greg, Relevance logic , Handbook of philosophical logic (Gabbay, Dov M. and Guenthner, Franz, editors), vol. 6, Kluwer Academic Publishers, Dordrecht, 2002, pp. 1128.
[13] Figueira, Diego, Figueira, Santiago, Schmitz, Sylvain, and Schnoebelen, Philippe, Ackermannian and primitive-recursive bounds with Dickson’s Lemma, Proceedings of LICS 2011 , IEEE Computer Society, 2011, pp. 269278.
[14] Kripke, Saul A., The problem of entailment , Proceedings of ASL 1959, vol. 24, this Journal, no. 4, 1959, (Abstract), p. 324.
[15] Lazić, Ranko and Schmitz, Sylvain, Non-elementary complexities for branching VASS, MELL, and extensions, Proceedings of CSL-LICS 2014 , ACM, 2014.
[16] Lincoln, Patrick, Mitchell, John, Scedrov, Andre, and Shankar, Natarajan, Decision problems for propositional linear logic . Annals of Pure and Applied Logic, vol. 56 (1992), no. 1–3, pp. 239311.
[17] Majumdar, Rupak and Wang, Zilong, Expand, enlarge, and check for branching vector addition systems , Proceedings of Concur 2013 (D’Argenio, Pedro R. and Melgratti, Hernán, editors), Lecture Notes in Computer Science, vol. 8052, Springer, Heidelberg, 2013, pp. 152166.
[18] Mayr, Ernst W. and Meyer, Albert R., The complexity of the word problems for commutative semigroups and polynomial ideals , Advances in Mathematics, vol. 46 (1982), no. 3, pp. 305329.
[19] Moh, Shaw Kei, The deduction theorems and two new logical systems . Methodos, vol. 2 (1950), pp. 5675.
[20] Padovani, Vincent, Ticket entailment is decidable . Mathematical Structures in Computer Science, vol. 23 (2013), no. 3, pp. 568607.
[21] Rambow, Owen, Multiset-valued linear index grammars: imposing dominance constraints on derivations , Proceedings of ACL’94, ACL Press, Las Cruces, 1994, pp. 263270.
[22] Riche, Jacques and Meyer, Robert K., Kripke, Belnap, Urquhart and relevant decidability & complexity , Proceedings of CSL ’98 (Gottlob, Georg, Grandjean, Étienne, and Seyr, Katrin, editors), Lecture Notes in Computer Science, vol. 1584, Springer, Heidelberg, 1999, pp. 224240.
[23] Salvati, Sylvain, Minimalist grammars in the light of logic , Logic and grammar (Pogodalla, Sylvain, Quatrini, Myriam, and Retoré, Christian, editors), Lecture Notes in Computer Science, vol. 6700, Springer, Heidelberg, 2011, pp. 81117.
[24] Schmitz, Sylvain, On the computational complexity of dominance links in grammatical formalisms , Proceedings of ACL 2010, ACL Press, Uppsala, 2010, pp. 514524.
[25] Statman, Richard, Intuitionistic propositional logic is polynomial-space complete . Theoretical Computer Science, vol. 9 (1979), no. 1, pp. 6772.
[26] Urquhart, Alasdair, The undecidability of entailment and relevant implication , this Journal, vol. 49 (1984), no. 4, pp. 10591073.
[27] Urquhart, Alasdair, The complexity of decision procedures in relevance logic , Truth or consequences: Essays in honour of Nuel Belnap (Michael Dunn, J. and Gupta, Anil, editors), Kluwer Academic Publishers, Dordrecht, 1990, pp. 6176.
[28] Urquhart, Alasdair, The complexity of decision procedures in relevance logic II , this Journal, vol. 64 (1999), no. 4, pp. 17741802.
[29] Verma, Kumar Neeraj and Goubault-Larrecq, Jean, Karp-Miller trees for a branching extension of VASS . Discrete Mathematics and Theoretical Computer Science, vol. 7 (2005), no. 1, pp. 217230.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed