Abstract
Two co-initial reductions in a term rewriting system are said to be equivalent if they
perform the same steps, albeit maybe in a different order. We present four characterisations of such a notion of equivalence, based on permutation, standardisation, labelling and projection, respectively. We prove that the characterisations all yield the
... read more