Let $f$ be the $i$th formula on the list.

The algorithm compares $x$ with each entry in turn until a match is found or the list is exhausted.


[see also: enumerate]

In the final section of the paper, we list some open problems.

All possible types are listed in Table 4.

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