{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:57:03Z","timestamp":1759147023222,"version":"3.30.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0168-0072(01)00040-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:26Z","timestamp":1027634666000},"page":"49-64","source":"Crossref","is-referenced-by-count":19,"title":["On the computational content of intuitionistic propositional proofs"],"prefix":"10.1016","volume":"109","author":[{"given":"Samuel R","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"M.L. Bonet, T. Pitassi, R. Raz, No feasible interpolation for TC0-Frege proofs, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Piscataway, NJ, IEEE Computer Society Press, Silver Spring, MD, pp. 254\u2013263.","key":"10.1016\/S0168-0072(01)00040-9_BIB1","DOI":"10.1109\/SFCS.1997.646114"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB2","series-title":"Handbook of Proof Theory","first-page":"1","article-title":"An introduction to proof theory","author":"Buss","year":"1998"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0168-0072(99)00002-0","article-title":"The complexity of the disjunction and existence properties in intuitionistic logic","volume":"99","author":"Buss","year":"1999","journal-title":"Ann. Pure Appl. Logic"},{"unstructured":"A. Goerdt, Efficient interpolation for the intuitionistic sequent calculus, Technische Universit\u00e4t Chemnitz, CSR-00-02, January 2000, preprint.","key":"10.1016\/S0168-0072(01)00040-9_BIB4"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB5","doi-asserted-by":"crossref","first-page":"457","DOI":"10.2307\/2275541","article-title":"Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic","volume":"62","author":"Kraj\u0131\u0301\u010dek","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(84)90029-0","article-title":"Tautologies with a unique Craig interpolant","volume":"27","author":"Mundici","year":"1984","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB7","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","article-title":"Lower bounds for resolution and cutting plane proofs and monotone computations","volume":"62","author":"Pudl\u00e1k","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB8","series-title":"On the complexity of propositional calculus, Sets and proofs, in Logic Colloquium \u201997","first-page":"197","author":"Pudl\u00e1k","year":"1999"},{"key":"10.1016\/S0168-0072(01)00040-9_BIB9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1090\/dimacs\/039\/15","article-title":"Algebraic models of computation and interpolation for algebraic systems","volume":"39","author":"Pudl\u00e1k","year":"1998","journal-title":"DIMACS Ser. Discrete Math. Theor. Comp. Sci."},{"year":"1989","author":"Sch\u00f6ning","series-title":"Logik f\u00fck Informatiker","key":"10.1016\/S0168-0072(01)00040-9_BIB10"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007201000409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007201000409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T16:28:47Z","timestamp":1733416127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007201000409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0168007201000409"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(01)00040-9","relation":{},"ISSN":["0168-0072"],"issn-type":[{"type":"print","value":"0168-0072"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}