{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:49:22Z","timestamp":1742392162360},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"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":[[1994,6]]},"DOI":"10.1016\/0304-3975(94)90087-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"193-206","source":"Crossref","is-referenced-by-count":10,"title":["Depth of proofs, depth of cut-formulas and complexity of cut formulas"],"prefix":"10.1016","volume":"129","author":[{"given":"Wenhui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90087-6_BIB1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01625836","article-title":"The number of proof lines and the size of proofs in first order logic","volume":"27","author":"Krajicek","year":"1988","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/0304-3975(94)90087-6_BIB2","series-title":"Handbook of Mathematical Logic","article-title":"Proof theory: some applications of cut-elimination","author":"Schwichtenberg","year":"1977"},{"key":"10.1016\/0304-3975(94)90087-6_BIB3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(91)90086-H","article-title":"Cut elimination and automatic proof procedures","volume":"91","author":"Zhang","year":"1991","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900876?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900876?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:35Z","timestamp":1555129655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0304397594900876"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90087-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}