{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T23:10:23Z","timestamp":1738105823964,"version":"3.33.0"},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2008,2]]},"abstract":"<jats:p>We investigate cut elimination in propositional substructural logics. The problem is to decide whether a given calculus admits (reductive) cut elimination. We show that for commutative single-conclusion sequent calculi containing generalised knotted structural rules and arbitrary logical rules the problem can be decided by resolution-based methods. A general cut-elimination proof for these calculi is also provided.<\/jats:p>","DOI":"10.1017\/s0960129507006573","type":"journal-article","created":{"date-parts":[[2008,3,5]],"date-time":"2008-03-05T14:42:14Z","timestamp":1204728134000},"page":"81-105","source":"Crossref","is-referenced-by-count":4,"title":["Towards an algorithmic construction of cut-elimination procedures"],"prefix":"10.1017","volume":"18","author":[{"given":"AGATA","family":"CIABATTONI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXANDER","family":"LEITSCH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,2,1]]},"reference":[{"key":"S0960129507006573_ref5","first-page":"1","volume-title":"Handbook of Proof Theory","author":"Buss","year":"1998"},{"key":"S0960129507006573_ref11","first-page":"2","article-title":"Using Linear Logic to reason about sequent systems","volume":"2381","author":"Miller","year":"2002","journal-title":"Springer-Verlag Lecture Notes in Artificial Intelligence"},{"key":"S0960129507006573_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60605-2"},{"key":"S0960129507006573_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363681"},{"key":"S0960129507006573_ref9","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1094061862"},{"key":"S0960129507006573_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90146-6"},{"key":"S0960129507006573_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201353"},{"key":"S0960129507006573_ref2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.3233\/FUN-2004-59401","article-title":"Analytic Calculi for Monoidal T-norm Based Logic","volume":"59","author":"Baaz","year":"2004","journal-title":"Fundamenta Informaticae"},{"key":"S0960129507006573_ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0359"},{"key":"S0960129507006573_ref1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exi001"},{"key":"S0960129507006573_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-006-6607-2"},{"key":"S0960129507006573_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-006-8305-5"},{"key":"S0960129507006573_ref12","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/11591191_25","article-title":"On the specification of sequent system","volume":"3835","author":"Miller","year":"2005","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129507006573_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00370844"},{"key":"S0960129507006573_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079691"},{"key":"S0960129507006573_ref18","doi-asserted-by":"crossref","unstructured":"van Benthem J. (1991) Language in Action: Categories, Lambdas and Dynamic Logic, Studies in Logic 130, North-Holland.","DOI":"10.1007\/BF00250539"},{"key":"S0960129507006573_ref14","unstructured":"Restall G. (1999) An Introduction to Substructural Logics, Routledge."},{"volume-title":"Beweistheorie","year":"1960","author":"Sch\u00fctte","key":"S0960129507006573_ref16"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129507006573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T22:44:22Z","timestamp":1738104262000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129507006573\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["S0960129507006573"],"URL":"https:\/\/doi.org\/10.1017\/s0960129507006573","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"type":"print","value":"0960-1295"},{"type":"electronic","value":"1469-8072"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}