6That is, theories where every rewrite step is performed only at the top position of the term. In such theories completeness can be simplified as follows: given ∃X1,…,Xks →∗t, for each ρ such that ρ(s) →R,Ax∗ρ(t), and for all the substitutions σ1,…,σn,… provided by narrowing from s, there is an index i and a substitution τ such that ρ = Axσi; τ.