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 ∃ ⁡ x 1 , … , x k s → ∗ t , for each ρ such that ρ ( s ) → R , A x ∗ ρ ( t ) , and for all the substitutions σ 1 , … , σ n , … provided by narrowing from s , there is an index i and a substitution τ such that ρ = A x σ i ; τ .