A note on simplification orderings
Author:
- Nachum DershowitzNDNachum Dershowitz
Open Access
- 1 December 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 9 (5) , 212-215
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963