{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:52Z","timestamp":1725662932837},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164869"},{"type":"electronic","value":"9783540398257"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16486-3_94","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:45:15Z","timestamp":1330177515000},"page":"125-143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exponential time and bounded arithmetic"],"prefix":"10.1007","author":[{"given":"Peter","family":"Clote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaisi","family":"Takeuti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","unstructured":"S.R. Buss, Bounded Arithmetic, Ph.D. Dissertation, Princeton University, June 1985, 189 pages."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"S.R. Buss, \u201cThe polynomial hierarchy and fragments of bounded arithmetic.\u201d Proc. Seventeenth ACM Symposium on Theory of Computing, pp. 285\u2013290 (1985).","DOI":"10.1145\/22145.22177"},{"key":"10_CR3","unstructured":"T. Coquand and G. Huet, \u201cA calculus of constructions,\u201d Technical Report, INRIA (Institut National de Recherche en Informatique et en Automatique \u2014 FRANCE), July 17, 1985, 17 pages."},{"key":"10_CR4","unstructured":"A. Cobham, \u201cThe intrinsic computational difficulty of functions,\u201d Logic, Methodology and Philosophy of Science II, Jerusalem 1964, pp. 24\u201330, ed. Y. Bar-Hillel, North Holland, (1965)."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"S.A. Cook, \u201cFeasibly constructive proofs and the propositional calculus,\u201d Proc. Seventh ACM Symposium on Theory of Computing, pp. 83\u201397 (1975).","DOI":"10.1145\/800116.803756"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/2272354","volume":"39","author":"N.D. Jones","year":"1974","unstructured":"N.D. Jones and A.L. Selman, \u201cTuring machines and the spectra of first-order formulas with equality,\u201d Journal of Symbolic Logic 39 (1974), pp. 139\u2013150.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR7","unstructured":"A. Kanamori and K. McAloon, \u201cOn Godel incompleteness and finite combinatorics,\u201d to appear in Annals of Pure and Applied Logic."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"494","DOI":"10.2307\/2269958","volume":"36","author":"R. Parikh","year":"1971","unstructured":"R. Parikh, \u201cExistence and feasibility in arithmetic,\u201d Journal of Symbolic Logic 36, (1971), pp. 494\u2013508.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"J. Paris and L. Harrington, \u201cA mathematical incompleteness for Peano arithmetic,\u201d Handbook of Mathematical Logic, pp. 1133\u20131142. Studies in Logic and the Foundations of Mathematics, vol. 139, ed. Jon Barwise, North Holland (1977).","DOI":"10.1016\/S0049-237X(08)71130-3"},{"key":"10_CR10","unstructured":"J. Paris and A. Wilkie, \u201cOn the scheme of induction for bounded arithmetic formulas,\u201d Proceedings of Logic Colloquium '84 (Manchester, England), North Holland, to appear."},{"key":"10_CR11","unstructured":"G. Takeuti, Proof Theory, North Holland (1975)."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"C. Wrathall, \u201cComplete sets and the polynomial time hierarchy,\u201d Theoretical Computer Science 3, pp. 23\u201333 (1976).","journal-title":"Theoretical Computer Science"},{"key":"10_CR13","unstructured":"A. Wilkie and G. Wilmers, written communication."}],"container-title":["Lecture Notes in Computer Science","Structure in Complexity Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16486-3_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:05:31Z","timestamp":1578517531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16486-3_94"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164869","9783540398257"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-16486-3_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}