{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:49:08Z","timestamp":1725616148808},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Birkh\u00e4user Boston","isbn-type":[{"type":"print","value":"9780817634834"},{"type":"electronic","value":"9781461234661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/978-1-4612-3466-1_9","type":"book-chapter","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T17:40:09Z","timestamp":1317404409000},"page":"161-180","source":"Crossref","is-referenced-by-count":7,"title":["Stockmeyer induction"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Ferreira","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Bounded Arithmetic","author":"S Buss","year":"1986","unstructured":"S. Buss, Bounded Arithmetic ( Bibliopolis, Napoli, 1986 ). Revision of 1985 Princeton University Ph.D. thesis."},{"key":"9_CR2","volume-title":"proceedings of a Workshop in Logic and Computation","author":"S Buss","year":"1987","unstructured":"S. Buss, Axiomatizations and conservation results for fragments of Bounded Arithmetic, to appear in AMS Contemporary Mathematics, proceedings of a Workshop in Logic and Computation, May 1987."},{"key":"9_CR3","unstructured":"BS87] W. Buchholz and W. Sieg, A note on polynomial time computable arithmetic, to appear in AMS Contemporary Mathematics, proceedings of a Workshop in Logic and Computation, May 87."},{"key":"9_CR4","first-page":"24","volume-title":"Logic, Methodology and Philosophy of Science II","author":"A Cobham","year":"1965","unstructured":"A. Cobham, The intrisic computational difficulty of functions, in Logic, Methodology and Philosophy of Science II ( North- Holland, Amsterdam, 1965 ) 24\u201330."},{"key":"9_CR5","volume-title":"proceedings of a Workshop in Logic and Computation","author":"F Ferreira","year":"1987","unstructured":"F. Ferreira, Polynomial time computable arithmetic, to appear in AMS Contemporary Mathematics, proceedings of a Workshop in Logic and Computation, May 1987."},{"key":"9_CR6","volume-title":"Polynomial Time Computable Arithmetic and Conservative Extensions","author":"F Ferreira","year":"1988","unstructured":"F. Ferreira, Polynomial Time Computable Arithmetic and Conservative Extensions, Pennsylvania State University Ph.D. thesis, December 1988."},{"key":"9_CR7","unstructured":"F. Ferreira, Postscript to \u201cStockmeyer induction\u201d, to appear in Actas da Conferencia em Memoria de Hugo Ribeiro (Lisboa)."},{"key":"9_CR8","unstructured":"J. ICrajicek, P. Pudlak and G. Takeuti, Bounded arithmetic and the polynomial hierarchy, submitted to Annals of Pure and Applied Logic."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0168-0072(87)90066-2","volume":"35","author":"A Wilkie","year":"1987","unstructured":"A. Wilkie and J. Paris, On the scheme of induction for bounded arithmetic formulas, Annals of Pure and Applied Logic 35 (1987) 261\u2013302.","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Feasible Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4612-3466-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T21:28:10Z","timestamp":1619818090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4612-3466-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780817634834","9781461234661"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4612-3466-1_9","relation":{},"subject":[],"published":{"date-parts":[[1990]]}}}