乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:11:58Z","timestamp":1704154318803},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0304-3975(99)00178-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"299-333","source":"Crossref","is-referenced-by-count":7,"title":["On the intuitionistic force of classical search"],"prefix":"10.1016","volume":"232","author":[{"given":"Eike","family":"Ritter","sequence":"first","affiliation":[]},{"given":"David","family":"Pym","sequence":"additional","affiliation":[]},{"given":"Lincoln","family":"Wallen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00178-4_BIB1","doi-asserted-by":"crossref","unstructured":"H. Barendregt, Lambda calculi with types, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 2, Oxford Science Publications, 1992, pp. 117\u2013310.","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB2","series-title":"Elements of Intuitionism","author":"Dummett","year":"1980"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB3","doi-asserted-by":"crossref","unstructured":"U. Egly, Some pitfalls of LK-to-LJ translations and how to avoid them, in: W. McCune (Ed.), Proc. CADE-14, Lecture Notes in Computer Science, Vol. 1249, Springer, Berlin, 1997, pp. 116\u2013130.","DOI":"10.1007\/3-540-63104-6_14"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB4","unstructured":"M.C. Fitting, Resolution for intuitionistic logic, in: Z.W. Ras, M. Zemankova (Eds.), Methodologies for Intelligent Systems, Elsevier, Amsterdam, 1987, pp. 400\u2013407."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB5","doi-asserted-by":"crossref","unstructured":"M.C. Fitting, First-order modal tableaux, J. Automated Reasoning, 4 (1988) 191\u2013214.","DOI":"10.1007\/BF00244394"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB6","unstructured":"G. Gentzen, Untersuchungen \u00fcber das logische Schlie\u00dfen, Math. Z. 176\u2013210 (1934) 405\u2013431."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB7","series-title":"Proofs and Types","author":"Girard","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(99)00178-4_BIB8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00881956","article-title":"The liberalized \u03b4-rule in free variable semantic tableaux","volume":"13","author":"H\u00e4hnle","year":"1994","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB9","doi-asserted-by":"crossref","unstructured":"H. Herbelin, A \u03bb-calculus structure isomorphic to sequent calculus structure, in: Proc. Computer Science Logic \u201994, Kazimierz, Poland, Lecture Notes in Computer Science, Vol. 933, Springer, Berlin, 1995.","DOI":"10.1007\/BFb0022247"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB10","unstructured":"J. Herbrand, Investigations in proof theory, in: J. van Heijenoort (Ed.), From Frege to G\u00f6del, Harvard University Press, Harvard, 1967."},{"issue":"2","key":"10.1016\/S0304-3975(99)00178-4_BIB11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1017\/S0956796800001301","article-title":"The virtues of eta-expansion","volume":"5","author":"Jay","year":"1995","journal-title":"J. Functional Programming"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB12","first-page":"1","article-title":"Permutability of inferences in Gentzen's calculi LK and LJ","volume":"10","author":"Kleene","year":"1952","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB13","unstructured":"J.W. Klop, Term rewriting systems, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 2, Oxford Science Publications, 1992, pp. 1\u2013116."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB14","unstructured":"B. Meltzer, Prolegomena to a theory of efficiency of proof procedures, in: Artificial Intelligence and Heuristic Programming, Edinburgh University Press, Edinburgh, 1971, pp. 15\u201333."},{"issue":"1","key":"10.1016\/S0304-3975(99)00178-4_BIB15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","article-title":"Forum: a multiple conclusion specification logic","volume":"165","author":"Miller","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Ann. Pure App. Logic"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB17","doi-asserted-by":"crossref","unstructured":"H.-J. Ohlbach, A resolution calculus for modal logics, in: E. Lusk, R. Overbeek (Eds.), Proc. 9th CADE, Lecture Notes in Computer Science, Vol. 310, Springer, Berlin, 1988, pp. 500\u2013516.","DOI":"10.1007\/BFb0012852"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB18","doi-asserted-by":"crossref","unstructured":"J. Otten, C. Kreitz, A connection based proof method for intuitionistic logic, in: Proc. 4th Tableaux workshop, Lecture Notes in Artificial Intelligence, Vol. 918, Springer, Berlin, 1995, pp. 122\u2013137.","DOI":"10.1007\/3-540-59338-1_32"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB19","doi-asserted-by":"crossref","unstructured":"M. Parigot, \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction, in: Proc. LPAR 92, St. Petersburg, Lecture Notes in Computer Science, Vol. 624, Springer, Berlin, 1992, pp. 190\u2013201.","DOI":"10.1007\/BFb0013061"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB20","unstructured":"M. Parigot, Church\u2013Rosser property in classical free deduction, in: G. Huet, G. Plotkin (Eds.), Logical Environments, Cambridge University Press, Cambridge, 1993."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB21","doi-asserted-by":"crossref","unstructured":"M. Parigot, Strong normalization for second order classical natural deduction, in: Proc. LICS 93, IEEE Computer Soc. Press, Sliver Spring, MD, 1993, pp. 39\u201347.","DOI":"10.1109\/LICS.1993.287602"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB22","unstructured":"D. Prawitz, Natural Deduction: A Proof-Theoretical Study, Almqvist & Wiksell, Stockholm, 1965."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB23","unstructured":"D.J. Pym, Proofs, search and computation in general logic, Ph.D. Thesis, University of Edinburgh, 1990."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01063152","article-title":"A note on the proof theory of the \u03bb\u03a0-calculus","volume":"54","author":"Pym","year":"1995","journal-title":"Studia Logica"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB25","first-page":"1994","article-title":"A uniform proof-theoretic investigation of linear logic programming","volume":"4","author":"Pym","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB26","doi-asserted-by":"crossref","unstructured":"D.J. Pym, L.A. Wallen, Proof-search in the \u03bb\u03a0-calculus, in: G. Huet, G. Plotkin (Eds.), Logical Frameworks, Cambridge University Press, Cambridge, 1991, pp. 309\u2013340.","DOI":"10.1017\/CBO9780511569807.013"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB27","doi-asserted-by":"crossref","unstructured":"D.J. Pym, L.A. Wallen, Logic programming via proof-valued computations, in: K. Broda (Ed.), UK Conference on Logic Programming, Springer WICS, 1992, pp. 253\u2013262.","DOI":"10.1007\/978-1-4471-3421-3_14"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB28","doi-asserted-by":"crossref","unstructured":"E. Ritter, D.J. Pym, L.A. Wallen, On the intuitionistic force of classical search (extended abstract), in: P. Miglioli, U. Moscato, D. Mundici, M. Ornaghi (Eds.), Proc. Tableaux \u201996, Lecture Notes in Computer Science, Vol. 1071, Springer, Berlin, 1996, pp. 295\u2013311.","DOI":"10.1007\/3-540-61208-4_19"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB29","unstructured":"E. Ritter, D.J. Pym, L.A. Wallen, Proof-terms for classical and intuitionistic resolution (extended abstract), in: M. McRobbie, J. Slaney (Eds.), Proc. CADE-13, Lecture Notes in Computer Science, Vol. 1104, Springer, Berlin, 1996, pp. 17\u201331."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB30","doi-asserted-by":"crossref","unstructured":"N. Shankar, Proof search in the intuitionistic sequent calculus, in: D. Kapur (Ed.), Proc. CADE 11, Lecture Notes in Artificial Intelligence, Vol. 607, Springer, Berlin, 1992.","DOI":"10.1007\/3-540-55602-8_189"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB31","doi-asserted-by":"crossref","unstructured":"R.M. Smullyan, First-order logic, Ergebnisse der Mathematik, Vol. 43, Springer, Berlin, 1968.","DOI":"10.1007\/978-3-642-86718-7"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB32","unstructured":"L.A. Wallen, Generating connection calculi from tableau- and sequent-based proof systems, in: A.G. Cohn, J.R. Thomas (Eds.), Artificial Intelligence and its Applications, Wiley, New York, 1986, pp. 35\u201350; Proc. AISB 85, Warwick, England, April 1985."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB33","unstructured":"L.A. Wallen, Matrix proof methods for modal logics, in: J. McDermott (Ed.), Proc. 10th. IJCAI, Morgan Kaufmann, Los Altus, CA, 1987, pp. 917\u2013923."},{"key":"10.1016\/S0304-3975(99)00178-4_BIB34","series-title":"Automated Deduction in Non-Classical Logics","author":"Wallen","year":"1990"},{"key":"10.1016\/S0304-3975(99)00178-4_BIB35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0003-4843(74)90010-2","article-title":"The correspondence between cut-elimination and normalisation","volume":"7","author":"Zucker","year":"1974","journal-title":"Ann. Math. Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001784?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001784?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:40:39Z","timestamp":1704152439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397599001784"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00178-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}