{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:57Z","timestamp":1725489357455},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_26","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"344-358","source":"Crossref","is-referenced-by-count":8,"title":["A Characterization of Medial as Rewriting Rule"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Stra\u00dfburger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0022-4049(95)00159-X","volume":"113","author":"R. Blute","year":"1996","unstructured":"Blute, R., Cockett, R., Seely, R., Trimble, T.: Natural deduction and coherence for weakly distributive categories. Journal of Pure. and Applied Algebra\u00a0113, 229\u2013296 (1996)","journal-title":"Journal of Pure. and Applied Algebra"},{"key":"26_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-62950-5_74","volume-title":"Rewriting Techniques and Applications","author":"D. Bechet","year":"1997","unstructured":"Bechet, D., de Groote, P., Retor\u00e9, C.: A complete axiomatisation of the inclusion of series-parallel partial orders. In: Comon, H. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a01232, pp. 230\u2013240. Springer, Heidelberg (1997)"},{"key":"26_CR4","unstructured":"Br\u00fcnnler, K.: Deep Inference and Symmetry for Classical Proofs. PhD thesis, Technische Universit\u00e4t Dresden (2003)"},{"key":"26_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-45653-8_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Br\u00fcnnler","year":"2001","unstructured":"Br\u00fcnnler, K., Fernanto Tiu, A.: A local system for classical logic. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 347\u2013361. Springer, Heidelberg (2001)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-540-30124-0_13","volume-title":"Computer Science Logic","author":"P. Gianantonio Di","year":"2004","unstructured":"Di Gianantonio, P.: Structures for multiplicative cyclic linear logic: Deepness vs cyclicity. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 130\u2013144. Springer, Heidelberg (2004)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Devarajan, H., Hughes, D., Plotkin, G., Pratt, V.R.: Full completeness of the multiplicative linear logic of Chu spaces. In: 14th IEEE Symposium on Logic in Computer Science (LICS 1999) (1999)","DOI":"10.1109\/LICS.1999.782619"},{"key":"26_CR8","volume-title":"Proof-Theoretical Coherence","author":"K. Do\u0161en","year":"2004","unstructured":"Do\u0161en, K., Petri\u0107, Z.: Proof-Theoretical Coherence. KCL Publications, London (2004)"},{"key":"26_CR9","unstructured":"Do\u0161en, K., Petri\u0107, Z.: Intermutation. Mathematical Institute, Belgrade (2007)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Annals of Mathematical Logic\u00a028, 181\u2013203 (1989)","journal-title":"Annals of Mathematical Logic"},{"issue":"2","key":"26_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1017\/S0960129500000451","volume":"4","author":"A. Fleury","year":"1994","unstructured":"Fleury, A., Retor\u00e9, C.: The mix rule. Mathematical Structures in Computer Science\u00a04(2), 273\u2013285 (1994)","journal-title":"Mathematical Structures in Computer Science"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44802-0_5","volume-title":"Computer Science Logic","author":"A. Guglielmi","year":"2001","unstructured":"Guglielmi, A., Stra\u00dfburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 54\u201368. Springer, Heidelberg (2001)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Transactions on Computational Logic, 8(1) (2007)","DOI":"10.1145\/1182613.1182614"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.4007\/annals.2006.164.1065","volume":"164","author":"D.J.D. Hughes","year":"2006","unstructured":"Hughes, D.J.D.: Proofs Without Syntax. Annals of Mathematics\u00a0164(3), 1065\u20131076 (2006)","journal-title":"Annals of Mathematics"},{"key":"26_CR15","unstructured":"Lamarche, F.: Exploring the gap between linear and classical logic, (Accepted for publication in TAC) (2006)"},{"key":"26_CR16","volume-title":"Graduate Texts in Mathematics","author":"S. Mac lane","year":"1971","unstructured":"Mac lane, S.: Categories for the Working Mathematician. In: Graduate Texts in Mathematics, vol.\u00a05, Springer, Heidelberg (1971)"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-009-2639-4_4","volume-title":"Algorithms and Order","author":"R.H. M\u00f6hring","year":"1989","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 105\u2013194. Kluwer Acad. Publ, Boston, MA (1989)"},{"key":"26_CR18","unstructured":"Retor\u00e9, C.: R\u00e9seaux et S\u00e9quents Ordonn\u00e9s. Th\u00e8se de Doctorat, sp\u00e9cialit\u00e9 math\u00e9matiques, Universit\u00e9 Paris VII (February 1993)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Retor\u00e9, C.: Perfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs. ENTCS, 3 (1996)","DOI":"10.1016\/S1571-0661(05)80416-5"},{"issue":"3","key":"26_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(01)00175-X","volume":"294","author":"C. Retor\u00e9","year":"2003","unstructured":"Retor\u00e9, C.: Handsome proof-nets: perfect matchings and cographs. Theoretical Computer Science\u00a0294(3), 473\u2013488 (2003)","journal-title":"Theoretical Computer Science"},{"key":"26_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-36078-6_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Stra\u00dfburger","year":"2002","unstructured":"Stra\u00dfburger, L.: A local system for linear logic. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 388\u2013402. Springer, Heidelberg (2002)"},{"key":"26_CR22","unstructured":"Stra\u00dfburger, L.: Linear Logic and Noncommutativity in the Calculus of Structures. PhD thesis, Technische Universit\u00e4t Dresden (2003)"},{"issue":"1-3","key":"26_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0304-3975(03)00240-8","volume":"309","author":"L. Stra\u00dfburger","year":"2003","unstructured":"Stra\u00dfburger, L.: MELL in the Calculus of Structures. Theoretical Computer Science\u00a0309(1-3), 213\u2013285 (2003)","journal-title":"Theoretical Computer Science"},{"key":"26_CR24","unstructured":"Stra\u00dfburger, L.: On the axiomatisation of Boolean categories with and without medial Accepted for publication in TAC (2005)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:35Z","timestamp":1619518355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}