On the termination of Russell's description elimination algorithm

DOI10.1017/S1755020310000286zbMATH Open1252.03004MaRDI QIDQ3096819FDOQ3096819

Authors: Clemens Grabmayer, Joop Leo, Vincent van Oostrom, Albert Visser 

Publication date: 14 November 2011

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Recommendations

• RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH
• scientific article; zbMATH DE number 3866573
• Strong termination for the epsilon substitution method
• Dummy elimination: Making termination easier
• Termination of rewriting

zbMATH Keywords

nontermination of elimination of descriptionsRussell's description elimination rewrite systemtermination behavior

Mathematics Subject Classification ID

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

Cites Work

• A formulation of the simple theory of types
• Title not available (Why is that?)
• Higher-order rewrite systems and their confluence
• Title not available (Why is that?)
• New Foundations for Mathematical Logic
• The Hydra battle and Cichon's principle
• Finite family developments

Cited In (2)

• Incomplete symbols -- definite descriptions revisited
• The possibility of analysis: convergence and proofs of convergence

This page was built for publication: On the termination of Russell's description elimination algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096819)