Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T10:09:05.559Z Has data issue: false hasContentIssue false

ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM

Published online by Cambridge University Press:  21 September 2011

CLEMENS GRABMAYER*
Affiliation:
Department of Philosophy, Utrecht University
JOOP LEO*
Affiliation:
Department of Philosophy, Utrecht University
VINCENT VAN OOSTROM*
Affiliation:
Department of Philosophy, Utrecht University
ALBERT VISSER*
Affiliation:
Department of Philosophy, Utrecht University
*
*DEPARTMENT OF PHILOSOPHY, UTRECHT UNIVERSITY, JANSKERKHOF 13A, UTRECHT, THE NETHERLANDS. E-mail:clemens.grabmayer@phil.uu.nl
†DEPARTMENT OF PHILOSOPHY, UTRECHT UNIVERSITY, JANSKERKHOF 13A, UTRECHT, THE NETHERLANDS. E-mail:joop.leo@phil.uu.nl
‡DEPARTMENT OF PHILOSOPHY, UTRECHT UNIVERSITY, JANSKERKHOF 13A, UTRECHT, THE NETHERLANDS. E-mail:vincent.vanoostrom@phil.uu.nl
§DEPARTMENT OF PHILOSOPHY, UTRECHT UNIVERSITY, JANSKERKHOF 13A, UTRECHT, THE NETHERLANDS. E-mail:albert.visser@phil.uu.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we study the termination behavior of Russell’s description elimination rewrite system. We discuss certain claims made by Kripke (2005) in his paper concerning the possible nontermination of elimination of descriptions.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011