{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:08Z","timestamp":1720624928801},"reference-count":7,"publisher":"Elsevier BV","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":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81009-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"112-122","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Characterising polynomial time computable functions using theories with weak set existence principles"],"prefix":"10.1016","volume":"78","author":[{"given":"Aleksander","family":"Ignjatovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phuong","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB1","author":"Buss","year":"1986","journal-title":"Bounded Arithmetic, Bibliopolis"},{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2275511","article-title":"Delineating computational complexity via second order theories with weak set principles (I)","volume":"60","author":"Ignjatovic","year":"1995","journal-title":"The Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Ignjatovic, A. Delineating computational complexity classes via second order theories with weak set existence principles (II), unpublished manuscript, 1994","DOI":"10.2307\/2275511"},{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0168-0072(90)90023-U","article-title":"J. Exponentiation and second order bounded arithmetic","volume":"48","author":"Krajicek","year":"1990","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB5","first-page":"2","author":"Leivant","year":"1991","journal-title":"A foundational delineation of computational feasibility"},{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB6","series-title":"Arithmetic, proof theory and computational complexity","first-page":"247","article-title":"An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic","author":"Razborov","year":"1993"},{"key":"10.1016\/S1571-0661(04)81009-0_NEWBIB7","series-title":"Arithmetic, proof theory and computational complexity","first-page":"364","article-title":"RSUV isomorphisms","author":"Takeuti","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:12:33Z","timestamp":1585897953000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":7,"alternative-id":["S1571066104810090"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81009-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}