{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:27Z","timestamp":1725537207520},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04027-6_34","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T13:27:52Z","timestamp":1252934872000},"page":"470-484","source":"Crossref","is-referenced-by-count":2,"title":["Non-Commutative First-Order Sequent Calculus"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Tatsuta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"34_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.apal.2008.01.006","volume":"153","author":"S. Berardi","year":"2008","unstructured":"Berardi, S., Yamagata, Y.: A sequent calculus for Limit Computable Mathematics. Annals of Pure and Applied Logic\u00a0153(1-3), 111\u2013126 (2008)","journal-title":"Annals of Pure and Applied Logic"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-76637-7_18","volume-title":"Programming Languages and Systems","author":"S. Berardi","year":"2007","unstructured":"Berardi, S., Tatsuta, M.: Positive arithmetic without exchange is a subclassical logic. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 271\u2013285. Springer, Heidelberg (2007)"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0027763000018055","volume":"7","author":"S. Maehara","year":"1954","unstructured":"Maehara, S.: Eine Darstellung der intuitionistischen Logik in der Klassischen. Nagoya Mathematical Journal\u00a07, 45\u201364 (1954)","journal-title":"Nagoya Mathematical Journal"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Nakano, H.: A Constructive Formalization of the Catch and Throw Mechanism. In: Proceedings of Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 82\u201389 (1992)","DOI":"10.1109\/LICS.1992.185522"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:54:36Z","timestamp":1552143276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}