{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T23:52:04Z","timestamp":1696031524332},"reference-count":17,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T00:00:00Z","timestamp":1316563200000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p>In this paper we study the termination behavior of Russell\u2019s description elimination rewrite system. We discuss certain claims made by Kripke (2005) in his paper concerning the possible nontermination of elimination of descriptions.<\/jats:p>","DOI":"10.1017\/s1755020310000286","type":"journal-article","created":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T08:23:12Z","timestamp":1316593392000},"page":"367-393","source":"Crossref","is-referenced-by-count":3,"title":["ON THE TERMINATION OF RUSSELL\u2019S DESCRIPTION ELIMINATION ALGORITHM"],"prefix":"10.1017","volume":"4","author":[{"given":"CLEMENS","family":"GRABMAYER","sequence":"first","affiliation":[]},{"given":"JOOP","family":"LEO","sequence":"additional","affiliation":[]},{"given":"VINCENT","family":"VAN OOSTROM","sequence":"additional","affiliation":[]},{"given":"ALBERT","family":"VISSER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"key":"S1755020310000286_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00143-6"},{"key":"S1755020310000286_ref4","first-page":"172","volume-title":"Trees in Algebra and Programming, 19th International Colloquium, CAAP\u201994, Edinburgh, UK, April 1113, 1994, volume 787 of Lecture Notes in Computer Science","author":"Khasidashvili","year":"1994"},{"key":"S1755020310000286_ref11","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1937.11987928"},{"key":"S1755020310000286_ref10","volume-title":"Descriptions","author":"Neale","year":"1990"},{"key":"S1755020310000286_ref2","first-page":"146","volume-title":"FUN, volume 4475 of Lecture Notes in Computer Science","author":"Fleischer","year":"2007"},{"key":"S1755020310000286_ref5","first-page":"295","volume-title":"Proceedings of the 20th International Conference on Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science","author":"Korp","year":"2009"},{"key":"S1755020310000286_ref13","doi-asserted-by":"publisher","DOI":"10.1093\/mind\/XIV.4.479"},{"key":"S1755020310000286_ref15","volume-title":"Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science","year":"2003"},{"key":"S1755020310000286_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-009-0094-4"},{"key":"S1755020310000286_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"S1755020310000286_ref6","doi-asserted-by":"publisher","DOI":"10.1093\/mind\/fzi1005"},{"key":"S1755020310000286_ref7","first-page":"156","volume-title":"Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings, volume 1833 of Lecture Notes in Computer Science","author":"Levy","year":"2000"},{"key":"S1755020310000286_ref3","first-page":"123","volume-title":"The Philosophy of Bertrand Russell, volume 5 of The Library of Living Philosophers","author":"G\u00f6del","year":"1944"},{"key":"S1755020310000286_ref12","volume-title":"Mathematical Logic","author":"Quine","year":"1996"},{"key":"S1755020310000286_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569906"},{"key":"S1755020310000286_ref16","first-page":"308","volume-title":"Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science","author":"van Oostrom","year":"1997"},{"key":"S1755020310000286_ref14","volume-title":"Principia Mathematica to * 56","author":"Russell","year":"1970"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020310000286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T06:39:34Z","timestamp":1556347174000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020310000286\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["S1755020310000286"],"URL":"https:\/\/doi.org\/10.1017\/s1755020310000286","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}