{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T09:24:41Z","timestamp":1763544281116,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3760,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0168-0072(02)00066-0","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T07:49:29Z","timestamp":1034063369000},"page":"197-223","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Ordinal notations and well-orderings in bounded arithmetic"],"prefix":"10.1016","volume":"120","author":[{"given":"Arnold","family":"Beckmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Pollett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel R.","family":"Buss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"unstructured":"A. Beckmann, Separating fragments of bounded arithmetic, Ph.D. Thesis, University of M\u00fcnster, 1996.","key":"10.1016\/S0168-0072(02)00066-0_BIB1"},{"unstructured":"A. Beckmann, Notations for exponentiation, 1999, submitted for publication.","key":"10.1016\/S0168-0072(02)00066-0_BIB2"},{"unstructured":"S.R. Buss, Bounded arithmetic, bibliopolis, 1986. Revision of 1985 Princeton University Ph.D. Thesis.","key":"10.1016\/S0168-0072(02)00066-0_BIB3"},{"doi-asserted-by":"crossref","unstructured":"S.R. Buss, Axiomatizations and conservation results for fragments of bounded arithmetic, in: Logic and Computation, Proc. of a Workshop held Carnegie-Mellon University, 1987, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence, RI, 1990, pp. 57\u201384.","key":"10.1016\/S0168-0072(02)00066-0_BIB4","DOI":"10.1090\/conm\/106\/1057816"},{"key":"10.1016\/S0168-0072(02)00066-0_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/plms\/s3-69.1.1","article-title":"An application of Boolean complexity to separation problems in bounded arithmetic","volume":"69","author":"Buss","year":"1994","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0168-0072(02)00066-0_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2269764","article-title":"Systems of predicative analysis I","volume":"29","author":"Feferman","year":"1964","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(02)00066-0_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2269866","article-title":"Systems of predicative analysis II: Representations of ordinals","volume":"33","author":"Feferman","year":"1968","journal-title":"J. Symbolic Logic"},{"year":"1993","author":"H\u00e1jek","series-title":"Metamathematics of First-order Arithmetic, Perspectives in Mathematical Logic","key":"10.1016\/S0168-0072(02)00066-0_BIB8"},{"key":"10.1016\/S0168-0072(02)00066-0_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"year":"1995","author":"Kraj\u0131́\u010dek","series-title":"Bounded Arithmetic, Propositional Calculus and Complexity Theory","key":"10.1016\/S0168-0072(02)00066-0_BIB10"},{"key":"10.1016\/S0168-0072(02)00066-0_BIB11","article-title":"Proof Theory","volume":"vol. 1409","author":"Pohlers","year":"1989"},{"key":"10.1016\/S0168-0072(02)00066-0_BIB12","article-title":"Proof Theory","volume":"vol. 225","author":"Sch\u00fctte","year":"1977"},{"unstructured":"R. Sommer, Transfinite induction and hierarchies generated by transfinite recursion within Peano arithmetic, Ph.D. Thesis, U.C. Berkeley, 1990.","key":"10.1016\/S0168-0072(02)00066-0_BIB13"},{"key":"10.1016\/S0168-0072(02)00066-0_BIB14","series-title":"Arithmetic, Proof Theory and Computational Complexity","first-page":"320","article-title":"Ordinal arithmetic in I\u03940","author":"Sommer","year":"1993"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007202000660?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007202000660?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T10:03:01Z","timestamp":1759140181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007202000660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0168007202000660"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(02)00066-0","relation":{},"ISSN":["0168-0072"],"issn-type":[{"type":"print","value":"0168-0072"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Ordinal notations and well-orderings in bounded arithmetic","name":"articletitle","label":"Article Title"},{"value":"Annals of Pure and Applied Logic","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0168-0072(02)00066-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}