{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:10Z","timestamp":1725455650685},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022571","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"223-230","source":"Crossref","is-referenced-by-count":5,"title":["On the weakness of sharply bounded polynomial induction"],"prefix":"10.1007","author":[{"given":"Jan","family":"Johannsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"A. David","year":"1990","unstructured":"David A. Mix Barrington, Neil Immermann, and Howard Straubing. On uniformity within NC1. Journal of Computing and Systems Sciences, 41:274\u2013306, 1990.","journal-title":"Journal of Computing and Systems Sciences"},{"key":"25_CR2","volume-title":"Bounded Arithmetic","author":"S. R. Buss","year":"1986","unstructured":"Samuel R. Buss. Bounded Arithmetic. Bibliopolis, Napoli, 1986."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Peter Clote. Sequential, machine independent characterizations of the parallel complexity classes ALogTIME, ACk, NCk and NC. In Samuel R. Buss and Philip J. Scott, editors, Feasible Mathematics, pages 49\u201369. Birkh\u00e4user, 1990.","DOI":"10.1007\/978-1-4612-3466-1_4"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0168-0072(91)90043-L","volume":"52","author":"J. Kraj\u00ed\u010dek","year":"1991","unstructured":"Jan Kraj\u00ed\u010dek, Pavel Pudl\u00e1k, and Gaisi Takeuti. Bounded arithmetic and the polynomial hierarchy. Annals of Pure and Applied Logic, 52:143\u2013153, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR5","first-page":"281","volume-title":"Logic and Computation, volume 106 of Contemporary Mathematics","author":"G. Takeuti","year":"1990","unstructured":"Gaisi Takeuti. Sharply bounded arithmetic and the function a\u22121. In Logic and Computation, volume 106 of Contemporary Mathematics, pages 281\u2013288. American Mathematical Society, Providence, 1990."}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022571.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:49:06Z","timestamp":1607550546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0022571","relation":{},"subject":[]}}