Title:  Mortality in Infinite-State Systems

Nachum Dershowitz (Tel Aviv University)

We investigate combinatorial commutation properties for
reordering a sequence of two kinds of steps,
and for separating well-foundedness of unions of relations.
To that end, we develop the notion of a constricting sequence.
These results can be applied, for example, to generic path orderings used in termination
proofs.