{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:56Z","timestamp":1725485576260},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_4","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:48:36Z","timestamp":1180666116000},"page":"53-67","source":"Crossref","is-referenced-by-count":1,"title":["A Note on Universal Measures for Weak Implicit Computational Complexity"],"prefix":"10.1007","author":[{"given":"Arnold","family":"Beckmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0168-0072(98)00020-7","volume":"95","author":"T. Arai","year":"1998","unstructured":"Toshiyasu Arai. Some results on cut-elimination, provable well-orderings, induction and reflection. Ann. Pure Appl. Logic, 95:93\u2013184, 1998.","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T. Baker","year":"1975","unstructured":"Theodore Baker, John Gill, and Robert Solovay. Relativizations of the P question. SIAM J. Comput., 4:431\u2013442, 1975.","journal-title":"SIAM J. Comput."},{"key":"4_CR3","series-title":"PhD thesis","volume-title":"Seperating fragments of bounded predicative arithmetic","author":"A. Beckmann","year":"1996","unstructured":"Arnold Beckmann. Seperating fragments of bounded predicative arithmetic. PhD thesis, Westf. Wilhelms-Univ., M\u00fcnster, 1996."},{"key":"4_CR4","unstructured":"Arnold Beckmann. Dynamic ordinal analysis. Arch. Math. Logic, 2001. accepted for publication."},{"key":"4_CR5","unstructured":"Samuel R. Buss. Bounded arithmetic, volume 3 of Stud. Proof Theory, Lect. Notes. Bibliopolis, Naples, 1986."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0168-0072(94)00057-A","volume":"75","author":"S. R. Buss","year":"1995","unstructured":"Samuel R. Buss. Relating the bounded arithmetic and the polynomial time hierarchies. Ann. Pure Appl. Logic, 75:67\u201377, 1995.","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/plms\/s3-69.1.1","volume":"69","author":"S. R. Buss","year":"1994","unstructured":"Samuel R. Buss and Jan Kraj\u00ed\u010dek. An application of boolean complexity to separation problems in bounded arithmetic. Proc. London Math. Soc., 69:1\u201321, 1994.","journal-title":"Proc. London Math. Soc."},{"key":"4_CR8","volume-title":"Computational Limitations of Small Depth Circuits","author":"J. H\u00e5stad","year":"1987","unstructured":"Johan H\u00e5stad. Computational Limitations of Small Depth Circuits. MIT Press, Cambridge, MA, 1987."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01352935","volume":"33","author":"J. Johannsen","year":"1994","unstructured":"Jan Johannsen. A note on sharply bounded arithmetic. Arch. Math. Logik Grundlag., 33:159\u2013165, 1994.","journal-title":"Arch. Math. Logik Grundlag."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/2154418","volume":"338","author":"J. Kraj\u00ed\u010dek","year":"1993","unstructured":"Jan Kraj\u00ed\u010dek. Fragments of bounded arithmetic and bounded query classes. Trans. Amer. Math. Soc., 338:587\u201398, 1993.","journal-title":"Trans. Amer. Math. Soc."},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Jan Kraj\u00ed\u010dek. Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Heidelberg\/New York, 1995."},{"key":"4_CR12","doi-asserted-by":"publisher","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. Ann. Pure Appl. Logic, 52:143\u2013153, 1991.","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR13","unstructured":"Daniel Leivant. Substructural termination proofs and feasibility certification. In Proceedings of the 3rd Workshop on Implicit Computational Complexity (Aarhus), pages 75\u201391, 2001."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"494","DOI":"10.2307\/2269958","volume":"36","author":"R. J. Parikh","year":"1971","unstructured":"Rohit J. Parikh. Existence and feasibility in arithmetic. J. Symbolic Logic, 36:494\u2013508, 1971.","journal-title":"J. Symbolic Logic"},{"key":"4_CR15","series-title":"Lect. Notes Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-46825-7","volume-title":"Proof Theory. An Introduction","author":"W. Pohlers","year":"1989","unstructured":"Wolfram Pohlers. Proof Theory. An Introduction. Number 1407 in Lect. Notes Math. Springer, Berlin\/Heidelberg\/New York, 1989."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0168-0072(99)00008-1","volume":"100","author":"C. Pollett","year":"1999","unstructured":"Chris Pollett. Structure and definability in general bounded arithmetic theories. Ann. Pure Appl. Logic, 100:189\u2013245, 1999.","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/oso\/9780198536901.003.0016","volume-title":"Arithmetic, proof theory, and computational complexity","author":"G. Takeuti","year":"1993","unstructured":"Gaisi Takeuti. RSUV isomorphism. In Peter Clote and Jan Kraj\u00ed\u010dek, editors, Arithmetic, proof theory, and computational complexity, Oxford Logic Guides, pages 364\u201386. Oxford University Press, New York, 1993."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Andrew C. Yao. Separating the polynomial-time hierarchy by oracles. Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science, pages 1\u201310, 1985.","DOI":"10.1109\/SFCS.1985.49"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"942","DOI":"10.2307\/2275794","volume":"61","author":"D. Zambella","year":"1996","unstructured":"Domenico Zambella. Notes on polynomially bounded arithmetic. J. Symbolic Logic, 61:942\u2013966, 1996.","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36078-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:15:34Z","timestamp":1707934534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}