{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:17Z","timestamp":1725551597917},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_25","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T09:44:25Z","timestamp":1132652665000},"page":"352-366","source":"Crossref","is-referenced-by-count":10,"title":["On the Specification of Sequent Systems"],"prefix":"10.1007","author":[{"given":"Elaine","family":"Pimentel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic\u00a05, 56\u201368 (1940)","journal-title":"Journal of Symbolic Logic"},{"unstructured":"Felty, A., Miller, D.: Specifying theorem provers in a higher-order logic programming language. In: Ninth International Conference on Automated Deduction (1988)","key":"25_CR3"},{"key":"25_CR4","first-page":"68","volume-title":"The Collected Papers of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Investigations into logical deductions. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, pp. 68\u2013131. North-Holland Publishing Co., Amsterdam (1969)"},{"key":"25_CR5","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\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0168-0072(93)90093-S","volume":"59","author":"J.-Y. Girard","year":"1993","unstructured":"Girard, J.-Y.: On the unity of logic. Ann. of Pure and Applied Logic\u00a059, 201\u2013217 (1993)","journal-title":"Ann. of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: On the meaning of logical rules I: syntax vs. semantics. In: Computational Logic, Berger and Schwichtenberg, pp. 215\u2013272. SV (1999)","key":"25_CR7","DOI":"10.1007\/978-3-642-58622-4_7"},{"unstructured":"Guglielmi, A.: A system of Interaction and Structure. ACM Transactions in Computational Logic (2005) (to appear)","key":"25_CR8"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the ACM\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the ACM"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","volume":"165","author":"D. Miller","year":"1996","unstructured":"Miller, D.: Forum: A multiple-conclusion specification language. Theoretical Computer Science\u00a0165(1), 201\u2013232 (1996)","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(99)00171-1","volume":"232","author":"R. McDowell","year":"2000","unstructured":"McDowell, R., Miller, D.: Cut-elimination for a logic with definitions and induction. Theoretical Computer Science\u00a0232, 91\u2013119 (2000)","journal-title":"Theoretical Computer Science"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Ann. of Pure and Applied Logic"},{"unstructured":"Miller, D., Pimentel, E.: Linear logic as a framework for specifying sequent calculus. In: Lecture Notes in Logic 17, Logic Colloquium 1999 (2004)","key":"25_CR13"},{"key":"25_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45616-3_2","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D. Miller","year":"2002","unstructured":"Miller, D., Pimentel, E.: Using linear logic to reason about sequent systems. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, p. 2. Springer, Heidelberg (2002)"},{"key":"25_CR15","first-page":"810","volume-title":"Fifth International Logic Programming Conference","author":"G. Nadathur","year":"1988","unstructured":"Nadathur, G., Miller, D.: An Overview of \u03bbProlog. In: Fifth International Logic Programming Conference, pp. 810\u2013827. MIT Press, Cambridge (August 1988)"},{"unstructured":"Pfenning, F.: Elf: A Language for Logic Definition and Verified Metaprogramming. In: Fourth Annual Symposium on Logic in Computer Science (1989)","key":"25_CR16"},{"unstructured":"Pfenning, F.: Structural Cut Elimination. In: Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science (1995)","key":"25_CR17"},{"issue":"1-2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/inco.1999.2832","volume":"157","author":"F. Pfenning","year":"2000","unstructured":"Pfenning, F.: Structural Cut Elimination: I. Intuitionistic and Classical Logic. Information and Computation\u00a0157(1-2), 84\u2013141 (2000)","journal-title":"Information and Computation"},{"unstructured":"Pimentel, E.G.: L\u00f3gica linear e a especifica\u00e7\u00e3o de sistemas computacionais. PhD thesis, Universidade Federal de Minas Gerais, Belo Horizonte, M.G., Brasil (written in English) (December 2001)","key":"25_CR19"},{"unstructured":"Pimentel, E.G.: Cut elimination for Llinda (2005), Draft, available from \n                  \n                    http:\/\/www.mat.ufmg.br\/~elaine","key":"25_CR20"},{"unstructured":"Tiu, A.: A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Penn State University (2004)","key":"25_CR21"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:00:33Z","timestamp":1558288833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11591191_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}