Publication details

Saarland University Computer Science

The First-Order Theory of Lexicographic Path Orderings is Undecidable

Hubert Comon, Ralf Treinen

Theoretical Computer Science, April 1997

fragment of the theory of a lexicographic path ordering is undecidable, both in the partial and in the total precedence cases. Our result implies in particular that the simplification rule of ordered completion is undecidable.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy