{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:26Z","timestamp":1759638686759},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":5252,"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":[[1999,3]]},"DOI":"10.1016\/s0168-0072(98)00031-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T15:00:04Z","timestamp":1051110004000},"page":"57-73","source":"Crossref","is-referenced-by-count":7,"title":["Turning cycles into spirals"],"prefix":"10.1016","volume":"96","author":[{"given":"A.","family":"Carbone","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(98)00031-1_BIB1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00247711","article-title":"Don't eliminate cut","volume":"13","author":"Boolos","year":"1984","journal-title":"J. Philos. Logic"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB2","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0168-0072(91)90059-U","article-title":"The undecidability of k-provability","volume":"53","author":"Buss","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0168-0072(96)00019-X","article-title":"Interpolants, cut elimination and flow graphs for the propositional calculus","volume":"83","author":"Carbone","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB4","series-title":"Some combinatorics behind proofs","author":"Carbone","year":"1995"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB5","series-title":"I.H.E.S. Transactions of the American Mathematical Society","article-title":"Cycling in proofs and feasibility","author":"Carbone","year":"1998"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB6","series-title":"Proofs and Groups with distorted Length Function, Manuscript","author":"Carbone","year":"1996"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB7","article-title":"Looking from the inside and from the outside","author":"Carbone","year":"1996"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/S0273-0979-97-00715-5","article-title":"Making proofs without modus ponens: an introduction to the combinatorics and complexity of cut elimination","volume":"34","author":"Carbone","year":"1997","journal-title":"Bulle. Amer. Math. Soc."},{"key":"10.1016\/S0168-0072(98)00031-1_BIB9","series-title":"Geometry, Symmetry and Implicit Representations of Combinatorial Structures","author":"Carbone","year":"1997"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB10","article-title":"Proof Theory and Logical Complexity","volume":"vol. 1","author":"Girard","year":"1987"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0168-0072(98)00031-1_BIB12","doi-asserted-by":"crossref","first-page":"2337","DOI":"10.1007\/BF01629444","article-title":"Lower bounds for increasing complexity of derivations after cut elimination","volume":"20","author":"Orevkov","year":"1982","journal-title":"J. Sov. Math."},{"key":"10.1016\/S0168-0072(98)00031-1_BIB13","doi-asserted-by":"crossref","first-page":"494","DOI":"10.2307\/2269958","article-title":"Existence and feasibility in arithmetic","volume":"36","author":"Parikh","year":"1971","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0003-4843(78)90011-6","article-title":"Bounds for proof-search and speed-up in predicate calculus","volume":"15","author":"Statman","year":"1978","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB15","article-title":"Proof Theory","volume":"volume 81","author":"Takeuti","year":"1975"},{"key":"10.1016\/S0168-0072(98)00031-1_BIB16","first-page":"234","article-title":"Complexity of a derivation in the propositional calculus","volume":"8","author":"Tseitin","year":"1968","journal-title":"Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007298000311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007298000311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:26:39Z","timestamp":1556396799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007298000311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0168007298000311"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(98)00031-1","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}