{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:18:13Z","timestamp":1734153493241,"version":"3.30.2"},"reference-count":6,"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":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2002,7,5]],"date-time":"2002-07-05T00:00:00Z","timestamp":1025827200000},"content-version":"vor","delay-in-days":885,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0304-3975(99)00172-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Extended normal form theorems for logical proofs from axioms"],"prefix":"10.1016","volume":"232","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigori","family":"Mints","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00172-3_BIB1","first-page":"1997","article-title":"A normal form for arithmetical derivations implying the \u03c9-consistency of arithmetic","volume":"21","author":"Ikeda","journal-title":"Tsukuba J. Math."},{"year":"1967","series-title":"Mathematical Logic","author":"Kleene","key":"10.1016\/S0304-3975(99)00172-3_BIB2"},{"key":"10.1016\/S0304-3975(99)00172-3_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/malq.19680140702","article-title":"Reflection principles and their use for establishing the complexity of axiomatic systems","volume":"14","author":"Kreisel","year":"1968","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0304-3975(99)00172-3_BIB4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0168-0072(93)90188-J","article-title":"A normal form for logical derivations implying one for arithmetic derivations","volume":"62","author":"Mints","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(99)00172-3_BIB5","doi-asserted-by":"crossref","unstructured":"C. Smorynski, The incompleteness theorems, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 819\u2013865.","DOI":"10.1016\/S0049-237X(08)71123-6"},{"key":"10.1016\/S0304-3975(99)00172-3_BIB6","unstructured":"G. Takeuti, Proof Theory, 2nd Edition, North-Holland, Amsterdam, 1987."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001723?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001723?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T10:34:37Z","timestamp":1734086077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397599001723"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00172-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extended normal form theorems for logical proofs from axioms","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00172-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}