{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:03Z","timestamp":1725551943630},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122507"},{"type":"electronic","value":"9783642122514"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_20","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T23:32:42Z","timestamp":1270855962000},"page":"272-287","source":"Crossref","is-referenced-by-count":1,"title":["Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and \u03bb-Calculus"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundations of Mathematics, rev. edn., vol.\u00a0103. North-Holland, Amsterdam (1985)","key":"20_CR2"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.2307\/2274219","volume":"50","author":"R. de Vrijer","year":"1985","unstructured":"de Vrijer, R.: A direct proof of the finite developments theorem. Journal of Symbolic Logic\u00a050(2), 339\u2013343 (1985)","journal-title":"Journal of Symbolic Logic"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-04027-6_20","volume-title":"Computer Science Logic","author":"J. Endrullis","year":"2009","unstructured":"Endrullis, J., Geuvers, H., Zantema, H.: Degrees of undecidability in term rewriting. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 255\u2013270. Springer, Heidelberg (2009)"},{"key":"20_CR5","series-title":"Undergraduate topics in computer science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-434-8","volume-title":"Models of Computation: An Introduction to Computability Theory","author":"M. Fernandez","year":"2009","unstructured":"Fernandez, M.: Models of Computation: An Introduction to Computability Theory. Undergraduate topics in computer science. Springer, Heidelberg (2009)"},{"key":"20_CR6","first-page":"1","volume":"4","author":"A. Grzegorczyk","year":"1953","unstructured":"Grzegorczyk, A.: Some classes of recursive functions. Rozpr. Mat.\u00a04, 1\u201345 (1953)","journal-title":"Rozpr. Mat."},{"key":"20_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity from a Programming Perspective","author":"N.D. Jones","year":"1997","unstructured":"Jones, N.D.: Computability and Complexity from a Programming Perspective. MIT Press, Cambridge (1997)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-58140-5_20","volume-title":"Logical Foundations of Computer Science","author":"Z. Khasidashvili","year":"1994","unstructured":"Khasidashvili, Z.: The longest perpetual reductions in orthogonal expression reduction systems. In: Matiyasevich, Y.V., Nerode, A. (eds.) LFCS 1994. LNCS, vol.\u00a0813, pp. 191\u2013203. Springer, Heidelberg (1994)"},{"key":"20_CR9","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013116. Oxford University Press, Oxford (1992)"},{"unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0II, 143. North-Holland, Amsterdam (1999)","key":"20_CR10"},{"volume-title":"Computational Complexity","year":"1994","author":"C. Papadimitriou","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)","key":"20_CR11"},{"volume-title":"Theory of Recursive Functions and Effective Computability","year":"1987","author":"H. Rogers Jr.","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)","key":"20_CR12"},{"unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology (2006)","key":"20_CR13"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: The typed lambda calculus is not elementary recursive. Theoretical Computer Science\u00a09, 73\u201381 (1979)","journal-title":"Theoretical Computer Science"},{"unstructured":"Terese: Term Rewriting Systems. In: Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)","key":"20_CR15"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2307\/2586765","volume":"64","author":"H. Xi","year":"1999","unstructured":"Xi, H.: Upper bounds for standardizations and an application. Journal of Symbolic Logic\u00a064(1), 291\u2013303 (1999)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12251-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T21:32:02Z","timestamp":1674077522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}