The first-order theory of lexicographic path orderings is undecidable
- 1 April 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 176 (1-2) , 67-87
- https://doi.org/10.1016/s0304-3975(96)00049-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Simple LPO constraint solving methodsInformation Processing Letters, 1993
- A new method for undecidability proofs of first order theoriesJournal of Symbolic Computation, 1992
- SOLVING SYMBOLIC ORDERING CONSTRAINTSInternational Journal of Foundations of Computer Science, 1990
- Equational problems anddisunificationJournal of Symbolic Computation, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946