{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:14Z","timestamp":1725518414804},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710691"},{"type":"electronic","value":"9783540710707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71070-7_42","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T05:56:30Z","timestamp":1219989390000},"page":"507-522","source":"Crossref","is-referenced-by-count":3,"title":["Focusing in Linear Meta-logic"],"prefix":"10.1007","author":[{"given":"Vivek","family":"Nigam","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":"42_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. J. of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"J. of Logic and Computation"},{"issue":"3","key":"42_CR2","first-page":"285","volume":"4","author":"M. D\u2019Agostino","year":"1994","unstructured":"D\u2019Agostino, M., Mondadori, M.: The taming of the cut. Classical refutations with analytic cut\u00a04(3), 285\u2013319 (1994)","journal-title":"Classical refutations with analytic cut"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0012823","volume-title":"Ninth International Conference on Automated Deduction","author":"A. Felty","year":"1988","unstructured":"Felty, A., Miller, D.: Specifying theorem provers in a higher-order logic programming language. In: Ninth International Conference on Automated Deduction, Argonne, IL, May 1988, pp. 61\u201380. Springer, Heidelberg (1988)"},{"key":"42_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, Amsterdam (1969)"},{"key":"42_CR5","unstructured":"Girard, J.-Y.: Le Point Aveugle: Cours de logique: Tome 1, Vers la perfection. Hermann (2006)"},{"issue":"1","key":"42_CR6","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":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J. Hodas","year":"1994","unstructured":"Hodas, J., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation\u00a0110(2), 327\u2013365 (1994)","journal-title":"Information and Computation"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-74915-8_34","volume-title":"Computer Science Logic","author":"C. Liang","year":"2007","unstructured":"Liang, C., Miller, D.: Focusing and polarization in intuitionistic logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 451\u2013465. Springer, Heidelberg (2007)"},{"issue":"1","key":"42_CR9","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 logic. Theoretical Computer Science\u00a0165(1), 201\u2013232 (1996)","journal-title":"Theoretical Computer Science"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-74915-8_35","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Nigam, V.: Incorporating tables into proofs. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 466\u2013480. Springer, Heidelberg (2007)"},{"key":"42_CR11","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, pp. 2\u201323. Springer, Heidelberg (2002)"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Miller, D., Pimentel, E.: Linear logic as a framework for specifying sequent calculus. In: van Eijck, J., van Oostrom, V., Visser, A. (eds.) Logic Colloquium 1999: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, pp. 111\u2013135. A. K. Peters Ltd (2004)","DOI":"10.1017\/9781316755921.010"},{"key":"42_CR13","unstructured":"Nigam, V., Miller, D.: Focusing in linear meta-logic: Extended report, http:\/\/hal.inria.fr\/inria-00281631"},{"key":"42_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511527340","volume-title":"Structural Proof Theory","author":"S. Negri","year":"2001","unstructured":"Negri, S., Von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)"},{"key":"42_CR15","first-page":"361","volume-title":"Proceedings of the First Russian Conference on Logic Programming","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Free deduction: An analysis of \u201ccomputations\u201d in classical logic. In: Proceedings of the First Russian Conference on Logic Programming, London, UK, pp. 361\u2013380. Springer, Heidelberg (1992)"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Pfenning, F.: Elf: A language for logic definition and verified metaprogramming. In: Fourth Annual Symposium on Logic in Computer Science, Monterey, CA, June 1989, pp. 313\u2013321 (1989)","DOI":"10.1109\/LICS.1989.39186"},{"issue":"1\/2","key":"42_CR17","first-page":"84","volume":"157","author":"F. Pfenning","year":"2000","unstructured":"Pfenning, F.: Structural cut elimination I. intuitionistic and classical logic\u00a0157(1\/2), 84\u2013141 (2000)","journal-title":"intuitionistic and classical logic"},{"key":"42_CR18","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":"42_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11591191_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"E. Pimentel","year":"2005","unstructured":"Pimentel, E., Miller, D.: On the specification of sequent systems. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 352\u2013366. Springer, Heidelberg (2005)"},{"key":"42_CR20","unstructured":"Prawitz, D.: Natural Deduction. Almqvist & Wiksell, Uppsala (1965)"},{"issue":"1","key":"42_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1005091418752","volume":"60","author":"W. Sieg","year":"1998","unstructured":"Sieg, W., Byrnes, J.: Normal natural deduction proofs (in classical logic). Studia Logica\u00a060(1), 67\u2013106 (1998)","journal-title":"Studia Logica"},{"issue":"4","key":"42_CR22","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.2307\/2274279","volume":"49","author":"P. Schroeder-Heister","year":"1984","unstructured":"Schroeder-Heister, P.: A natural extension of natural deduction. Journal of Symbolic Logic\u00a049(4), 1284\u20131300 (1984)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"42_CR23","doi-asserted-by":"publisher","first-page":"560","DOI":"10.2307\/2271362","volume":"33","author":"R.M. Smullyan","year":"1968","unstructured":"Smullyan, R.M.: Analytic cut. J. of Symbolic Logic\u00a033(4), 560\u2013564 (1968)","journal-title":"J. of Symbolic Logic"},{"issue":"7","key":"42_CR24","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s001530100091","volume":"40","author":"J. Plato von","year":"2001","unstructured":"von Plato, J.: Natural deduction with general elimination rules. Archive for Mathematical Logic\u00a040(7), 541\u2013567 (2001)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71070-7_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:15:15Z","timestamp":1605744915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710691","9783540710707"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}