{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:11Z","timestamp":1725489491610},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427520"},{"type":"electronic","value":"9783540455042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45504-3_11","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T18:56:02Z","timestamp":1187031362000},"page":"170-190","source":"Crossref","is-referenced-by-count":4,"title":["Implicit Characterizations of Pspace"],"prefix":"10.1007","author":[{"given":"Isabel","family":"Oitavem","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s001530050054","volume":"36","author":"A. Beckmann","year":"1996","unstructured":"Beckmann A., Wweiermann A.: A term rewriting characterization of the polytime functions and related complexity classes, Archive for Mathematical Logic 36, 1996, pp.11\u201330.","journal-title":"Archive for Mathematical Logic"},{"key":"11_CR2","unstructured":"Bellantoni S.: Predicative Recursion and Computational Complexity, Ph. D. Dissertation, University of Toronto, 1993."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bellantoni S.: Predicative Recursion and the Polytime Hierarchy, Feasible Mathematics II, ed. P. Clote and J. B. Remmel, Birkh\u00e4user, 1995, pp.15\u201329.","DOI":"10.1007\/978-1-4612-2566-9_2"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni S., Cook S.: A New Recursion-Theoretic Characterization of Polytime Functions, Computational Complexity, vol.2, 1992, pp.97\u2013110.","journal-title":"Computational Complexity"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S009753979528175X","volume":"29","author":"S. Bellantoni","year":"1999","unstructured":"Bellantoni S., Niggl K.-H.: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited, SIAM Journal of Computing, vol.29, N.2, 1999, pp.401\u2013415.","journal-title":"SIAM Journal of Computing"},{"key":"11_CR6","unstructured":"Bellatoni S., Oitavem I.: Separating NC along the \u03b4 axis, submitted."},{"key":"11_CR7","unstructured":"Buss S.: Bounded Arithmetic, Bibliopolis, 1986."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0168-0072(96)00015-2","volume":"83","author":"E.A. Cichon","year":"1997","unstructured":"Cichon E.A., Weiermann A.: Term rewriting theory for the primitive recursive functions, Annals of Pure and Applied Logic 83, 1997, pp.199\u2013223.","journal-title":"Annals of Pure and Applied Logic"},{"key":"11_CR9","unstructured":"Ferreira F.: Polynomial Time Computable Arithmetic and Conservative Extensions, Ph. D. Dissertation, Pennsylvania State University, 1988."},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/conm\/106\/1057819","volume":"106","author":"F. Ferreira","year":"1990","unstructured":"Ferreira F.: Polynomial Time Computable Arithmetic, Contemporary Mathematics, Volume 106, 1990, pp.137\u2013156.","journal-title":"Contemporary Mathematics"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Leivant D. and Marion J.-Y.: Ramified Recurrence and Computational Complexity II: Substitution and Poly-space, Computer Science Logic, ed. L. Pacholski and J. Tiuryn, Springer-Verlag, 1995, pp.486\u2013500.","DOI":"10.1007\/BFb0022277"},{"key":"11_CR12","unstructured":"Leivant D. and Marion J.-Y.: Ramified Recurrence and Computational Complexity IV: Predicative functionals and poly-space, Preprint."},{"issue":"7","key":"11_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s001530050163","volume":"39","author":"K.-H. Niggl","year":"2000","unstructured":"Niggl K.-H.: The \u03bc-Measure as a Tool for Classifying Computacional Complexity, Archive for Mathematical Logic, vol.39, N.7, 2000, pp.509\u2013514.","journal-title":"Archive for Mathematical Logic"},{"key":"11_CR14","unstructured":"Oitavem I.: Tr\u00eas assuntos de L\u00f3gica e Complexidade, Master thesis, Universidade de Lisboa, 1995."},{"key":"11_CR15","first-page":"109","volume":"10","author":"I. Oitavem","year":"1997","unstructured":"Oitavem I.: New recursive characterizations of the elementary functions and the functions computable in polynomial space, Revista Matematica de la Universidad Complutense de Madrid, vol.10, N.1, 1997, pp.109\u2013125.","journal-title":"New recursive characterizations of the elementary functions and the functions computable in polynomial space"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Oitavem I.: A term rewriting characterization of the functions computable in polynomial space, Archive for Mathematical Logic, to appear.","DOI":"10.1007\/s001530200002"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Oitavem I.: Classes of Computational Complexity: Implicit Characterizations \u2014 a Study in Mathematical Logic, Ph.D. thesis, Universidade de Lisboa, 2001.","DOI":"10.1007\/3-540-45504-3_11"},{"key":"11_CR18","unstructured":"Papadimitriou C.H.: Computational Complexity, Addison-Wesley Publishing Company, 1994."}],"container-title":["Lecture Notes in Computer Science","Proof Theory in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45504-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:53:16Z","timestamp":1556743996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45504-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427520","9783540455042"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45504-3_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}