{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:08Z","timestamp":1755220928700,"version":"3.43.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Studia Logica"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1023\/a:1005212701420","type":"journal-article","created":{"date-parts":[[2002,12,21]],"date-time":"2002-12-21T16:13:47Z","timestamp":1040487227000},"page":"385-407","source":"Crossref","is-referenced-by-count":2,"title":["An O(n log n)-Space Decision Procedure for the Relevance Logic B+"],"prefix":"10.1007","volume":"66","author":[{"given":"Luca","family":"Vigan\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"322846_CR1","unstructured":"Anderson, A. R., and N. D. Belnap, Jr., Entailment, The Logic of Relevance and Necessity, I, Princeton University Press, 1975."},{"key":"322846_CR2","unstructured":"Anderson, A. R., N. D. Belnap, Jr., and J. M. Dunn, Entailment, The Logic of Relevance and Necessity II, Princeton University Press, 1992."},{"key":"322846_CR3","doi-asserted-by":"crossref","unstructured":"Basin, D., M. D. Agostino, D. M. Gabbay, S. Matthews. and L. Vigan\u00d2, eds., Labelled Deduction, Kluwer, 2000.","DOI":"10.1007\/978-94-011-4040-9"},{"key":"322846_CR4","doi-asserted-by":"crossref","unstructured":"Basin, D., S. Matthews, and L. Vigan\u00d2, \u2018The new method for bounding the complexity of modal logies\u2019, in G. Gottlob, A. Leitsch, and D. Mundici, eds., Proceedings of KGC'97, LNCS 1289, pages 89\u2013102, Springer, 1997.","DOI":"10.1007\/3-540-63385-5_35"},{"key":"322846_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1005003904639","volume":"60","author":"D. Basin","year":"1998","unstructured":"Basin, D., S. Matthews, and L. Vigan\u00d2, \u2018Natural deduction for non-classical logics\u2019, Studia Logica 60 (1998), 119\u2013160.","journal-title":"Studia Logica"},{"key":"322846_CR6","unstructured":"Basin, D., and L. Vigan\u00d2, \u2018A recipe for the complexity analysis of non-classical logics\u2019, in D. M. Gabbay and M. de Rijke, eds., Frontiers of Combining Systems 2, pages 57\u201375, Research Studies Press\/Wiley, 2000."},{"key":"322846_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00454743","volume":"20","author":"R. T. Brady","year":"1991","unstructured":"Brady, R. T., \u2018Gentzenization and decidability of some contraction-less relevant logics\u2019, Journal of Philosophical Logic 20 (1991), 97\u2013117.","journal-title":"Journal of Philosophical Logic"},{"key":"322846_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00881958","volume":"13","author":"M. D'Agostino","year":"1994","unstructured":"D'Agostino, M., and D. M. Gabbay, \u2018A generalization of analytic deduction via labelled deductive systems. Part I: basic substructural logics\u2019, Journal of Automated Reasoning 13 (1994), 243\u2013281.","journal-title":"Journal of Automated Reasoning"},{"key":"322846_CR9","doi-asserted-by":"crossref","unstructured":"D'Agostino, M., D. M. Gabbay, and K. Broda, \u2018Tableau methods for substructural logics\u2019, in D'Agostino et al.[10], pages 397\u2013467.","DOI":"10.1007\/978-94-017-1754-0_7"},{"key":"322846_CR10","doi-asserted-by":"crossref","unstructured":"D'Agostino, M., D. M. Gabbay, R. H\u00c4hnle, and J. Posegga, editors, Handbook of Tableau Methods, Kluwer, 1999.","DOI":"10.1007\/978-94-017-1754-0"},{"key":"322846_CR11","first-page":"15","volume":"20","author":"K. Do\u0160en","year":"1986","unstructured":"Do\u0160en, K., \u2018Negation as a modal operator\u2019, Reports on Mathematical Logic 20 (1986). 15\u201327.","journal-title":"Reports on Mathematical Logic"},{"key":"322846_CR12","doi-asserted-by":"crossref","unstructured":"Dunn, J. M., \u2018Star and perp: Two treatments of negation\u2019, in J. Tomberlin, ed., Philosophical Perspectives VII, pages 331\u2013357, Ridgeview, 1994.","DOI":"10.2307\/2214128"},{"key":"322846_CR13","doi-asserted-by":"crossref","unstructured":"Fitting, M., Proof Methods for Modal and Intuitionistic Logics, Kluwer, 1983.","DOI":"10.1007\/978-94-017-2794-5"},{"key":"322846_CR14","doi-asserted-by":"crossref","unstructured":"Gabbay, D. M., Labelled Deductive Systems I, Clarendon Press, 1996.","DOI":"10.1093\/oso\/9780198538332.001.0001"},{"key":"322846_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF00249365","volume":"14","author":"S. Giambrone","year":"1985","unstructured":"Giambrone, S., \u2018TW\n+ and RW\n+ are decidable\u2019, Journal of Philosophical Logic 14 (1985), 235\u2013254.","journal-title":"Journal of Philosophical Logic"},{"key":"322846_CR16","first-page":"329","volume":"150\u2013151\u2013152","author":"P. Gochet","year":"1995","unstructured":"Gochet, P., P. Gribomont, and D. Rossetto, \u2018Algorithms for relevant logic\u2019, Logique et Analyse, 150\u2013151\u2013152 (1995), 329\u2013346.","journal-title":"Logique et Analyse"},{"key":"322846_CR17","doi-asserted-by":"crossref","unstructured":"Gor\u00c9, R. P., \u2018Tableau methods for modal and temporal logics\u2019, in D'Agostino et al.[10], pages 297\u2013396.","DOI":"10.1007\/978-94-017-1754-0_6"},{"issue":"1","key":"322846_CR18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1093\/logcom\/3.1.63","volume":"3","author":"J. Hudelmaier","year":"1993","unstructured":"Hudelmaier, J., \u2018A O(n log n)-space decision procedure for intuitionsitic propositional logic\u2019, Journal of Logic and Computation, 3(1), (1993), 63\u201375.","journal-title":"Journal of Logic and Computation"},{"key":"322846_CR19","doi-asserted-by":"crossref","unstructured":"Hudelmaier, J., \u2018Improved decision procedures for the modal logics K, T and S4\u2019, in H. Kleine B\u00fcning, ed., Proceedings of CSL'95, LNCS 1092, pages 320\u2013334. Springer, 1996.","DOI":"10.1007\/3-540-61377-3_46"},{"issue":"4","key":"322846_CR20","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.2307\/2275375","volume":"57","author":"E. Or\u0141owska","year":"1992","unstructured":"Or\u0141owska, E., \u2018Relational proof system for relevant logics\u2019, Journal of Symbolic Logic 57(4), (1992), 1425\u20131440.","journal-title":"Journal of Symbolic Logic"},{"key":"322846_CR21","doi-asserted-by":"crossref","unstructured":"Paulson, L. C., Isabelle: a generic theorem prover, LNCS 828, Springer, 1994.","DOI":"10.1007\/BFb0030541"},{"key":"322846_CR22","unstructured":"Prawitz, D., Natural Deduction, Almqvist and Wiksell, 1965."},{"key":"322846_CR23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF00248640","volume":"21","author":"G. Priest","year":"1992","unstructured":"Priest, G., and R. Sylvan, \u2018Simplified semantics for basic relevant logics\u2019, Journal of Philosophical Logic 21 (1992), 217\u2013232.","journal-title":"Journal of Philosophical Logic"},{"key":"322846_CR24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01349561","volume":"22","author":"G. Restall","year":"1993","unstructured":"Restall, G., \u2018Simplified semantics for relevant logics (and some of their rivals)\u2019, Journal of Philosophical Logic 22 (1993), 481\u2013511.","journal-title":"Journal of Philosophical Logic"},{"issue":"2","key":"322846_CR25","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1017998605966","volume":"27","author":"G. Restall","year":"1998","unstructured":"Restall, G., \u2018Displaying and deciding substructural logics 1: Logics with contraposition\u2019, Journal of Philosophical Logic 27(2) (1998), 179\u2013216.","journal-title":"Journal of Philosophical Logic"},{"key":"322846_CR26","unstructured":"Restall, G., An Introduction to Substructural Logics, Routledge, 1999."},{"key":"322846_CR27","doi-asserted-by":"crossref","unstructured":"Restall, G., \u2018Negation in relevant logics (how I stopped worrying and learned to love the Routley star)\u2019, in D. M. Gabbay and H. Wansing, eds., What is negation?, pages 53\u201376, Kluwer, 1999.","DOI":"10.1007\/978-94-015-9309-0_3"},{"key":"322846_CR28","unstructured":"Routley, R., V. Plumwood, R. K. Meyer, and R. T. Brady, Relevant Logics and their Rivals, Ridgeview, 1982."},{"key":"322846_CR29","unstructured":"Troelstra, A. S., and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1996."},{"issue":"4","key":"322846_CR30","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.2307\/2274261","volume":"49","author":"A. Urquhart","year":"1984","unstructured":"Urquhart, A., \u2018The undecidability of entailment and relevant implication\u2019, Journal of Symbolic Logic 49(4) (1984), 1059\u20131073.","journal-title":"Journal of Symbolic Logic"},{"key":"322846_CR31","doi-asserted-by":"crossref","unstructured":"Urquhart, A., \u2018The complexity of decision procedures in relevance logic\u2019, in J. M. Dunn and A. Gupta, eds., Truth or Consequences, pages 61\u201376, Kluwer, 1990.","DOI":"10.1007\/978-94-009-0681-5_5"},{"key":"322846_CR32","unstructured":"Urquhart, A., \u2018The complexity of decision procedures in relevance logic II\u2019 (manuscript), 1997."},{"key":"322846_CR33","doi-asserted-by":"crossref","unstructured":"van Dalen, D., \u2018Intuitionistic logic\u2019, in D. M. Gabbay and F. Guenthner, eds., Handbook of Philosophical Logic III, pages 225\u2013339, Reidel, 1986.","DOI":"10.1007\/978-94-009-5203-4_4"},{"key":"322846_CR34","doi-asserted-by":"crossref","unstructured":"Vigan\u00d2, L., Labelled Non-Classical Logics, Kluwer, 2000.","DOI":"10.1007\/978-1-4757-3208-5"},{"key":"322846_CR35","series-title":"Technical Report","volume-title":"An O(n log n)-space decision procedure for the relevance logic B+'","author":"L. Vigan\u00d2","year":"2000","unstructured":"Vigan\u00d2, L., \u2018An O(n log n)-space decision procedure for the relevance logic B+\u2019 (extended version), Technical Report No. 140. May 2000, Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Germany. Available at http:\/\/www.informatik.uni-freiburg.de\/tr\/."},{"key":"322846_CR36","unstructured":"Wallen, L., Automated Deduction in Non-Classical Logics, MIT Press, 1990."},{"key":"322846_CR37","unstructured":"Zeman, J. J., Modal Logic, Oxford University Press, 1973."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005212701420.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1005212701420\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005212701420.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:25:56Z","timestamp":1754630756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1005212701420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["322846"],"URL":"https:\/\/doi.org\/10.1023\/a:1005212701420","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}