{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:08Z","timestamp":1725664388857},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603818"},{"type":"electronic","value":"9783540455134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60381-6_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:23:23Z","timestamp":1330280603000},"page":"106-123","source":"Crossref","is-referenced-by-count":15,"title":["Well-foundedness of term orderings"],"prefix":"10.1007","author":[{"given":"M. C. F.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"H.","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N. Orderings for term rewriting systems. Theoretical Computer Science 17, 3 (1982), 279\u2013301.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N. Termination of rewriting. Journal of Symbolic Computation 3, 1 and 2 (1987), 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., and Hoot, C. Topics in termination. In Proceedings of the 5th Conference on Rewriting Techniques and Applications (1993), C. Kirchner, Ed., vol. 690 of Lecture Notes in Computer Science, Springer, pp. 198\u2013212.","DOI":"10.1007\/3-540-56868-9_16"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., and Jouannaud, J.-P. Rewrite systems. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., vol. B. Elsevier, 1990, ch. 6, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ferreira, M. C. F., and Zantema, H. Syntactical analysis of total termination. In Proceedings of the 4th International Conference on Algebraic and Logic Programming (1994), G. Levi and M. Rodr\u00edguez Artalejo, Eds., vol. 850 of Lecture Notes in Computer Science, Springer, pp. 204\u2013222.","DOI":"10.1007\/3-540-58431-5_15"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0168-0072(91)90022-E","volume":"53","author":"J. H. Gallier","year":"1991","unstructured":"Gallier, J. H. What's so special about Kruskal's theorem and the ordinal \u03b30? A survey of some results in proof theory. Annals of Pure and Applied Logic 53 (1991), 199\u2013260.","journal-title":"Annals of Pure and Applied Logic"},{"key":"7_CR7","unstructured":"Geerling, M. Termination of term rewriting systems. Master's thesis, Utrecht University, 1991."},{"key":"7_CR8","unstructured":"Geser, A. An improved general path order. Tech. Rep. MIP-9407, University of Passau, 1994."},{"key":"7_CR9","unstructured":"Kamin, S., and L\u00e9vy, J. J. Two generalizations of the recursive path ordering. University of Illinois, 1980."},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C. S. J. A. Nash-Williams","year":"1963","unstructured":"Nash-Williams, C. S. J. A. On well-quasi ordering finite trees. Proc. Cambridge Phil. Soc. 59 (1963), 833\u2013835.","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0747-7171(89)80035-5","volume":"8","author":"L. Puel","year":"1989","unstructured":"Puel, L. Using unavoidable sets of trees to generalize Kruskal's theorem. Journal of Symbolic Computation 8 (1989), 335\u2013382.","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Steinbach, J. Extensions and comparison of simplification orderings. In Proceedings of the 3rd Conference on Rewriting Techniques an Applications (1989), N. Dershowitz, Ed., vol. 355 of Lecture Notes in Computer Science, Springer, pp. 434\u2013448.","DOI":"10.1007\/3-540-51081-8_124"}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60381-6_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:45Z","timestamp":1619573865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60381-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603818","9783540455134"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60381-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}