## step

The remainder of our work breaks into five steps.

As a first step we shall bound $A$ below.

For the base step of the induction, consider a vertex $t$ in $A$.

A key step in obtaining (6) is Jensen's inequality.

This was one of the major steps in Wiener's original proof of his Tauberian theorem.

......, from which it is an easy step, via Lemma 1, to the conclusion that ......

The next step is to establish ......

Going back to the existential step of the proof, suppose that ......

All the computation will be done by one processor in one step.

By reversing the steps above, we see that ......

Using (2) and following steps analogous to those above, we obtain ......

To be sure we can carry out step $n$, we need to know that ......

The MR algorithm takes $n$ steps to solve the problem.

at each step of the construction

Go to the list of words starting with: a b c d e f g h i j k l m n o p q r s t u v w y z