{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:08:46Z","timestamp":1753884526769},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055776","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"267-276","source":"Crossref","is-referenced-by-count":10,"title":["Encoding the hydra battle as a rewrite system"],"prefix":"10.1007","author":[{"given":"H\u00e9l\u00e8ne","family":"Touzet","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"704","DOI":"10.2307\/2043364","volume":"97","author":"E.A. Cichon","year":"1983","unstructured":"E.A. Cichon, A short proof of two recently discovered independence results using recursion theoretic methods. Proceedings of the American Mathematical Society, vol 97 (1983), p.704\u2013706.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"23_CR2","unstructured":"E.A. Cichon, Termination proofs and complexity characterisations. Proof theory, P. Aczel, H. Simmons and S. Wainer Eds, Cambridge university press (1992), p.173\u2013193."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud, Rewrite systems. Handbook of Theoretical Computer Science, J. Van Leeuwen Ed., north-Holland 1990, p.243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"M.C.F. Ferreira and H. Zantema, Total termination of term rewriting. Proceedings of RTA-93, Lecture Notes in Computer Science 690, p. 213\u2013227.","DOI":"10.1007\/3-540-56868-9_17"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(92)90289-R","volume":"105-1","author":"D. Hofbauer","year":"1992","unstructured":"D. Hofbauer, Termination proofs with multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science 105-1 (1992), p.129\u2013140.","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","volume-title":"Dissertation","author":"D. Hofbauer","year":"1991","unstructured":"D. Hofbauer, Termination proofs and derivation lengths in term rewriting systems Dissertation, Technische Universit\u00e4t Berlin, 1991 (also available as Technical Report: TU Berlin, Forschungsberichte des Fachbereichs Informatik 92-46, 1992)."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1112\/blms\/14.4.285","volume":"14","author":"L. Kirby","year":"1982","unstructured":"L. Kirby and J. Paris, Accessible independence results for Peano arithmetic. Bull. London Math. Soc. 14 (1982), p.285\u2013225.","journal-title":"Bull. London Math. Soc."},{"key":"23_CR8","unstructured":"J.W. Robbin, Subrecursive Hierarchies. Ph.D. Princeton"},{"key":"23_CR9","volume-title":"Habilitationsschrift","author":"D. Schmidt","year":"1977","unstructured":"D. Schmidt, Well-partial orderings and their maximal order types. Habilitationsschrift, Fakult\u00e4t f\u00fcr Mathematik der Ruprecht-Karl-Universit\u00e4t, Heidelberg (1977)."},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2272973","volume":"37-2","author":"S.S. Wainer","year":"1972","unstructured":"S.S. Wainer, Ordinal recursion, and a refinement of the extented Grzegorczyk hierarchy. Journal of Symbolic Logic 37-2 (1972), p.281\u2013292.","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0304-3975(94)00135-6","volume":"139","author":"A. Weiermann","year":"1995","unstructured":"A. Weiermann, Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science 139 (1995), p.355\u2013362.","journal-title":"Theoretical Computer Science"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1006\/jsco.1994.1059","volume":"18","author":"A. Weiermann","year":"1994","unstructured":"A. Weiermann, Complexity bounds for some finite forms of Kruskal's theorem. Journal of Symbolic Computation 18 (1994), p.463\u2013488.","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T18:17:08Z","timestamp":1549909028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0055776","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}