Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systemsPierre LescanneRAIRO. Inform. théor., 16 4 (1982) 331-347DOI: https://doi.org/10.1051/ita/1982160403311