×
Grabmayer, Clemens; Leo, Joop; van Oostrom, Vincent; Visser, Albert

On the termination of Russell’s description elimination algorithm. (English) Zbl 1252.03004

Rev. Symb. Log. 4, No. 3, 367-393 (2011).
Summary: In this paper we study the termination behavior of Russell’s description elimination rewrite system. We discuss certain claims made by S. Kripke in his paper [“Russel’s notion of scope”, Mind 114, 1005–1037 (2005; doi:10.1093/mind/fzi1005)] concerning the possible nontermination of elimination of descriptions.

Cited in 2 Documents

MSC:

03-03 History of mathematical logic and foundations
03A05 Philosophical and critical aspects of logic and foundations
68Q42 Grammars and rewriting systems

Keywords:

termination behavior; Russell’s description elimination rewrite system; nontermination of elimination of descriptions
Cite Review PDF
Full Text: DOI

References:

[1] DOI: 10.1017/CBO9780511569906 · doi:10.1017/CBO9780511569906
[2] Korp, Proceedings of the 20th International Conference on Rewriting Techniques and Applications, pp 295– (2009) · doi:10.1007/978-3-642-02348-4_21
[3] van Oostrom, Proceedings of the 8th International Conference on Rewriting Techniques and Applications, pp 308– (1997) · Zbl 1379.68208 · doi:10.1007/3-540-62950-5_80
[4] Gödel, The Philosophy of Bertrand Russell, pp 123– (1944)
[5] Term Rewriting Systems, (2003) · Zbl 1030.68053
[6] Fleischer, FUN, pp 146– (2007)
[7] Russell, Principia Mathematica to (1970) · Zbl 0877.01042
[8] DOI: 10.2307/2266170 · Zbl 0023.28901 · doi:10.2307/2266170
[9] DOI: 10.1093/mind/XIV.4.479 · doi:10.1093/mind/XIV.4.479
[10] Quine, Mathematical Logic (1996)
[11] DOI: 10.2307/2300564 · Zbl 0016.19301 · doi:10.2307/2300564
[12] Neale, Descriptions (1990)
[13] DOI: 10.1007/s00200-009-0094-4 · Zbl 1181.68163 · doi:10.1007/s00200-009-0094-4
[14] DOI: 10.1016/S0304-3975(97)00143-6 · Zbl 0895.68078 · doi:10.1016/S0304-3975(97)00143-6
[15] Levy, Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings, pp 156– (2000)
[16] DOI: 10.1093/mind/fzi1005 · doi:10.1093/mind/fzi1005
[17] Khasidashvili, Trees in Algebra and Programming, 19th International Colloquium, CAAP’94, Edinburgh, UK, April 1113, 1994, pp 172– (1994)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.