{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:54Z","timestamp":1725663534434},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543176"},{"type":"electronic","value":"9783540475583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54317-1_86","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:40:04Z","timestamp":1330209604000},"page":"137-142","source":"Crossref","is-referenced-by-count":0,"title":["A survey of ordinal interpretations of type \u025b0 for termination of rewriting systems"],"prefix":"10.1007","author":[{"given":"Bernard R.","family":"Hodgson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clement F.","family":"Kent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/conm\/065\/891248","volume":"65","author":"W. Buchholz","year":"1987","unstructured":"W. Buchholz and S.S. Wainer, \u201cProvably computable functions and the fast growing hierarchy.\u201d In: S.G. Simpson, ed., Logic and Combinatorics. (Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, August 1985), Contemporary Mathematics 65 (1987) 179\u2013198.","journal-title":"Contemporary Mathematics"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1090\/S0002-9939-1983-0687646-0","volume":"87","author":"E.A. Cichon","year":"1983","unstructured":"E.A. Cichon, \u201cA short proof of two recently discovered independence results using recursion theoretic methods.\u201d Proceedings of the American Mathematical Society 87 (1983) 704\u2013706.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.2307\/2273557","volume":"48","author":"E.A. Cichon","year":"1983","unstructured":"E.A. Cichon and S.S. Wainer, \u201cThe slow-growing and the Grzegorczyk hierarchies.\u201d Journal of Symbolic Logic 48 (1983) 399\u2013408.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","volume":"65","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz, \u201cComputing with rewrite systems.\u201d Information and Control 65 (1985) 122\u2013157.","journal-title":"Information and Control"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, \u201cTermination of rewriting.\u201d Journal of Symbolic Computation 3 (1987) 69\u2013115. (Corrigendum: 4 (1987) 409-410)","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR6","unstructured":"N. Dershowitz and J.-P. Jouannaud, \u201cRewriting systems.\u201d In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science. North-Holland, to appear."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz and Z. Manna, \u201cProving termination with multiset ordering.\u201d Communications of the Association for Computing Machinery 22 (1979) 465\u2013476.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"R.W. Floyd, \u201cAssigning meanings to programs.\u201d Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematics, vol. 19, American Mathematical Society, 1967, pp. 19\u201332.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2307\/2268019","volume":"9","author":"R.L. Goodstein","year":"1944","unstructured":"R.L. Goodstein, \u201cOn the restricted ordinal theorem.\u201d Journal of Symbolic Logic 9 (1944) 33\u201341.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"779","DOI":"10.2307\/2274742","volume":"54","author":"C.F. Kent","year":"1989","unstructured":"C.F. Kent and B.R. Hodgson, \u201cExtensions of arithmetic for proving termination of computations.\u201d Journal of Symbolic Logic 54 (1989) 779\u2013794.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR11","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, \u201cAccessible independence results for Peano arithmetic.\u201d Bulletin of the London Mathematical Society 14 (1982) 285\u2013293.","journal-title":"Bulletin of the London Mathematical Society"},{"key":"10_CR12","volume-title":"Canonical algebraic simplification in computational logic. Report ATP-25 (Automatic Theorem Proving Project)","author":"D.S. Lankford","year":"1975","unstructured":"D.S. Lankford, Canonical algebraic simplification in computational logic. Report ATP-25 (Automatic Theorem Proving Project), University of Texas, Austin, TX, 1975."},{"key":"10_CR13","unstructured":"Z. Manna et S. Ness, \u201cOn the termination of Markov algorithms.\u201d Proceedings of the Third. Hawaii International Conference on System Science, 1970, pp. 789\u2013792."},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1017\/S0305004100028255","volume":"49","author":"N.A. Routledge","year":"1953","unstructured":"N.A. Routledge, \u201cOrdinal recursion.\u201d Proceedings of the Cambridge Philosophical Society 49 (1953) 175\u2013182.","journal-title":"Proceedings of the Cambridge Philosophical Society"}],"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-54317-1_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:36Z","timestamp":1605646416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54317-1_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543176","9783540475583"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54317-1_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}